Decidability of an Xstit Logic

This paper presents proofs of completeness and decidability of a non-temporal fragment of an Xstit logic. This shows a distinction between the non-temporal fragments of Xstit logic and regular stit logic since the latter is undecidable. The proof of decidability is via the finite model property. The finite model property is shown to hold by constructing a filtration. However, the set that is used to filter the models isn’t simply closed under subformulas, it has more complex closure conditions. The filtration set is akin to the Fischer–Ladner closure of a set used to show completeness and decidability of propositional dynamic logic.     

Notes on Logics of Metric Spaces

In [14], we studied the computational behaviour of various first-order and modal languages interpreted in metric or weaker distance spaces. [13] gave an axiomatisation of an expressive and decidable metric logic. The main result of this paper is in showing that the technique of representing metric spaces by means of Kripke frames can be extended to cover the modal (hybrid) language that is expressively complete over metric spaces for the (undecidable) two-variable fragment of first-order logic with binary pred-icates interpreting the metric. The frame conditions needed correspond rather directly with a Boolean modal logic that is, again, of the same expressivity as the two-variable fragment. We use this representation to derive an axiomatisation of the modal hybrid variant of the two-variable fragment, discuss the compactness property in distance logics, and derive some results on (the failure of) interpolation in distance logics of various expressive power. Presented by Melvin Fitting     

Lattices of Finitely Alternative Normal Tense Logics

Studia Logica - A finitely alternative normal tense logic $$T_{n,m}$$ is a normal tense logic characterized by frames in which every point has at most n future alternatives and m past alternatives....     

The Logics of Strict-Tolerant Logic

Adding a transparent truth predicate to a language completely governed by classical logic is not possible. The trouble, as is well-known, comes from paradoxes such as the Liar and Curry. Recently, Cobreros, Egré, Ripley and van Rooij have put forward an approach based on a non-transitive notion of consequence which is suitable to deal with semantic paradoxes while having a transparent truth predicate together with classical logic. Nevertheless, there are some interesting issues concerning the set of metainferences validated by this logic. In this paper, we show that this logic, once it is adequately understood, is weaker than classical logic. Moreover, the logic is in a way similar to the paraconsistent logic LP.     

All Finitely Axiomatizable Tense Logics of Linear Time Flows Are CoNP-complete

We prove that all finitely axiomatizable tense logics with temporal operators for ‘always in the future’ and ‘always in the past’ and determined by linear fows time are coNP-complete. It follows, for example, that all tense logics containing a density axiom of the form ■ⁿ⁺¹_F p → ⁿ_F p, for some n ≥ 0, are coNP-complete. Additionally, we prove coNP-completeness of all ∩-irreducible tense logics. As these classes of tense logics contain many Kripke incomplete bimodal logics, we obtain many natural examples of Kripke incomplete normal bimodal logics which are nevertheless coNP-complete.     

A Note on the Interpolation Property in Tense Logic

It is proved that all bimodal tense logics which contain the logic of the weak orderings and have unbounded depth do not have the interpolation property.     

Combinations of Tense and Modality for Predicate Logic

In recent years combinations of tense and modality have moved into the focus of logical research. From a philosophical point of view, logical systems combining tense and modality are of interest because these logics have a wide field of application in original philosophical issues, for example in the theory of causation, of action, etc. But until now only methods yielding completeness results for propositional languages have been developed. In view of philosophical applications, analogous results with respect to languages of predicate logic are desirable, and in this paper I present two such results. The main developments in this area can be split into two directions, differing in the question whether the ordering of time is world-independent or not. Semantically, this difference appears in the discussion whether T×W-frames or Kamp-frames (resp. Ockham-frames) provide a suitable semantics for combinations of tense and modality. Here, two calculi are presented, the first adequate with respect to Kamp-semantics, the second to T×W-semantics. (Both calculi contain an appropriate version of Gabbay's irreflexivity rule.) Furthermore, the proposed constructions of canonical frames simplify some of those which have hitherto been discussed.     

Combinatory Logic and the Semantics of Substructural Logics

The results of this paper extend some of the intimate relations that are known to obtain between combinatory logic and certain substructural logics to establish a general characterization theorem that applies to a very broad family of such logics. In particular, I demonstrate that, for every combinator X, if LX is the logic that results by adding the set of types assigned to X (in an appropriate type assignment system, TAS) as axioms to the basic positive relevant logic B∘T, then LX is sound and complete with respect to the class of frames in the Routley-Meyer relational semantics for relevant and substructural logics that meet a first-order condition that corresponds in a very direct way to the structure of the combinator X itself. Presented by Rob Goldblatt     

A Theory of Hypermodal Logics: Mode Shifting in Modal Logic

A hypermodality is a connective whose meaning depends on where in the formula it occurs. The paper motivates the notion and shows that hypermodal logics are much more expressive than traditional modal logics. In fact we show that logics with very simple K hypermodalities are not complete for any neighbourhood frames.     

两种行动逻辑的冲突:对医患关系紧张的一种社会学反思

医惠双方具有不同的行动逻辑.医方通过各项安排,让医方尽可能地避免各种风险的发生;患方则依自己的判断,在医疗活动中尽量避免不必要医疗费用的产生.医惠双方不同行动逻辑的冲突,必然在费用这一点导致医惠关系紧张.签署知情同意书,可起到缓解紧张医患关系的作用.     

Completeness and Decidability of General First-Order Logic (with a Detour Through the Guarded Fragment)

This paper investigates the “general” semantics for first-order logic introduced to Antonelli (Review of Symbolic Logic 6(4), 637–58, 2013): a sound and complete axiom system is given, and the satisfiability problem for the general semantics is reduced to the satisfiability of formulas in the Guarded Fragment of Andréka et al. (Journal of Philosophical Logic 27(3):217–274, 1998), thereby showing the former decidable. A truth-tree method is presented in the Appendix.     

Meaning-Preserving Translations of Non-classical Logics into Classical Logic: Between Pluralism and Monism

Journal of Philosophical Logic - In order to prove the validity of logical rules, one has to assume these rules in the metalogic. However, rule-circular ‘justifications’ are...     

Frame Based Formulas for Intermediate Logics

In this paper we define the notion of frame based formulas. We show that the well-known examples of formulas arising from a finite frame, such as the Jankov-de Jongh formulas, subframe formulas and cofinal subframe formulas, are all particular cases of the frame based formulas. We give a criterion for an intermediate logic to be axiomatizable by frame based formulas and use this criterion to obtain a simple proof that every locally tabular intermediate logic is axiomatizable by Jankov-de Jongh formulas. We also show that not every intermediate logic is axiomatizable by frame based formulas. Presented by Johan van Benthem     

Existential Import and an Unnecessary Restriction on Predicate Logics

Contemporary logicians continue to address problems associated with the existential import of categorical propositions. One notable problem concerns invalid instances of subalternation in the case of a universal proposition with an empty subject term. To remedy problems, logicians restrict first-order predicate logics to exclude such terms. Examining the historical origins of contemporary discussions reveals that logicians continue to make various category mistakes. We now believe that no proposition per se has existential import as commonly understood and thus it is unnecessary to restrict first-order predicate logics to non-empty classes. After introducing the problem, we trace some nineteenth century treatments of the issue to locate a source of misconstruing propositional import (1) in misconceptions of ‘implies’ and ‘affirms’ and name the process/product fallacy, along with (2) the translation of categorical sentences using quantifiers and accommodating an empty class. Next we treat some metalogical matters to orient our discussion by which we provide a more precise nomenclature about ‘sentence’ and ‘proposition’ to correct previous misconceptions; here we uncover a common category mistake in respect of a proposition’s efficacy. The semantic distinction between agent and force is helpful in this connection. We conclude by showing that logicians have reinserted existence as a predicate, a position previously excised by Kant, and that the Frege-Russell ambiguity thesis applies only to relationships within a categorical sentence between grammatical predicate and subject.     

Mathematics and Symbolic Logics: Some Notes on an Uneasy Relationship

Symbolic logics tend to be too mathematical for the philosophers and too philosophical for the mathematicians; and their history is too historical for most mathematicians, philosophers and logicians. This paper reflects upon these professional demarcations as they have developed during the century.     

Paraconsistent and Paracomplete Logics Based on k-Cyclic Modal Pseudocomplemented De Morgan Algebras

Studia Logica - The study of the theory of operators over modal pseudocomplemented De Morgan algebras was begun in papers [20] and [21]. In this paper, we introduce and study the class of modal...