In terms of validity in Kripke frames, a modal formula expresses a universal monadic second-order condition. Those modal formulae which are equivalent to first-order conditions are called elementary. Modal formulae which have a certain persistence property which implies their validity in all canonical frames of modal logics axiomatized with them, and therefore their completeness, are called canonical. This is a survey of a recent and ongoing study of the class of elementary and canonical modal formulae. We summarize main ideas (...) and results, and outline further research perspectives. (shrink)

The Barcan formula (BF) is commonly paraphrased as the schematic conditional that if it is possible that there be a phi then something or other is possibly a phi. It is validated by the most straightforward systems of quantified modal logic. It is also widely considered to pose a threat to the commonsensical metaphysical view that there are no non-actual (or ‘merely possible’) things. I show how BF can be cleared of such a charge by construing it as a (...) bridge principle connecting modality de dicto and modality de re while retaining a Russellian robust sense of reality in modal matters. (shrink)

In this article, we provide three generators of propositional formulae for arbitrary languages, which uniformly sample three different formulae spaces. They take the same three parameters as input, namely, a desired depth, a set of atomics and a set of logical constants (with specified arities). The first generator returns formulae of exactly the given depth, using all or some of the propositional letters. The second does the same but samples up-to the given depth. The third generator outputs formulae with (...) exactly the desired depth and all the atomics in the set. To make the generators uniform (i.e. to make them return every formula in their space with the same probability), we will prove various cardinality results about those spaces. (shrink)

In this paper, we present a way to translate the metainferences of a mixed metainferential system into formulae of an extended-language system, called its associated σ-system. To do this, the σ-system will contain new operators (one for each standard), called the σ operators, which represent the notions of "belonging to a (given) standard". We first prove, in a model-theoretic way, that these translations preserve (in)validity. That is, that a metainference is valid in the base system if and only if its (...) translation is a tautology of its corresponding σ-system. We then use these results to obtain other key advantages. Most interestingly, we provide a recipe for building unlabeled sequent calculi for σ-systems. We then exemplify this with a σ-system useful for logics of the ST family, and prove soundness and completeness for it, which indirectly gives us a calculus for the metainferences of all those mixed systems. Finally, we respond to some possible objections and show how our σ-framework can shed light on the “obeying” discussion within mixed metainferential contexts. (shrink)

We generalize and extend the class of Sahlqvist formulae in arbitrary polyadic modal languages, to the class of so called inductive formulae. To introduce them we use a representation of modal polyadic languages in a combinatorial style and thus, in particular, develop what we believe to be a better syntactic approach to elementary canonical formulae altogether. By generalizing the method of minimal valuations à la Sahlqvist–van Benthem and the topological approach of Sambin and Vaccaro we prove that all inductive formulae (...) are elementary canonical and thus extend Sahlqvist’s theorem over them. In particular, we give a simple example of an inductive formula which is not frame-equivalent to any Sahlqvist formula. Then, after a deeper analysis of the inductive formulae as set-theoretic operators in descriptive and Kripke frames, we establish a somewhat stronger model-theoretic characterization of these formulae in terms of a suitable equivalence to syntactically simpler formulae in the extension of the language with reversive modalities. Lastly, we study and characterize the elementary canonical formulae in reversive languages with nominals, where the relevant notion of persistence is with respect to discrete frames. (shrink)

In this paper I defend the traditional interpretations of Kant’s Formula of a Law of Nature from recent attacks leveled by Faviola Rivera-Castro, James Furner, Ido Geiger, Pauline Kleingeld and Sven Nyholm. After a short introduction, the paper is divided into four main sections. In the first, I set out the basics of the three traditional interpretations, the Logical Contradiction Interpretation, the Practical Contradiction Interpretation and the Teleological Contradiction Interpretation. In the second, I examine the work of Geiger, (...) Kleingeld and Nyholm: these three commentators reject the traditional interpretations entirely, but I argue that this rejection is ill-founded. In the third and fourth, I take a detailed look at Furner’s work, work in which he seeks to revise (rather than reject) the traditional interpretations. I argue that, despite his more modest aims, Furner’s revision is also ill-founded. (shrink)

According to an influential view, when it comes to representing reality, some words are better suited for the job than others. This is elitism. There is reason to believe that the set of the best, or elite, words should not be redundant or arbitrary. However, we are often forced to choose between these two theoretical vices, especially in cases involving theories that seem to be mere notational variants. This is the riddle of redundancy: both redundancy and arbitrariness are vicious, but (...) there are cases in which one must be picked. Logical realists admit that there are some logical constants among the elite words. This leads to awkward questions, such as which among conjunction and disjunction is elite. In this paper, I show how the riddle of redundancy arises for logical realists, and offer a solution. This approach requires us to change how we represent negation. Instead of using some particular symbol, we represent negation by flipping formulae over the horizontal axis. (shrink)

Paraconsistent logics are logical systems that reject the classical principle, usually dubbed Explosion, that a contradiction implies everything. However, the received view about paraconsistency focuses only the inferential version of Explosion, which is concerned with formulae, thereby overlooking other possible accounts. In this paper, we propose to focus, additionally, on a meta-inferential version of Explosion, i.e. which is concerned with inferences or sequents. In doing so, we will offer a new characterization of paraconsistency by means of which a logic (...) is paraconsistent if it invalidates either the inferential or the meta-inferential notion of Explosion. We show the non-triviality of this criterion by discussing a number of logics. On the one hand, logics which validate and invalidate both versions of Explosion, such as classical logic and Asenjo–Priest’s 3-valued logic LP. On the other hand, logics which validate one version of Explosion but not the other, such as the substructural logics TS and ST, introduced by Malinowski and Cobreros, Egré, Ripley and van Rooij, which are obtained via Malinowski’s and Frankowski’s q- and p-matrices, respectively. (shrink)

This paper develops a new class of justification logic, the logic of epistemic entitlement. The logic of epistemic entitlement invokes the notion of epistemic entitlement in epistemology, and interprets a justification formula in the form of???? ∶???? as follows: the warrant???? entitles the agent to believe????. In the logic of epistemic entitlement, the formula???? ∶???? is true if and only if???? is true in all possible worlds entitled to be conceived by????. In contrast to the standard epistemic semantics (...) of justification logic, the formula???? ∶???? in Fitting’s model is true if and only if???? is true in all possible worlds that can be conceived of and satisfies the evidential condition: the epistemic state???? ∈ ℰ(????,????) that the epistemic agent is in. Thus, if???? is not a dead point in the model, the point model of???? cannot satisfy both formulas of the form???? ∶???? and????′∶ ¬????. Thus standard justification logic cannot characterize the conflicting beliefs of agents for different warrants. Instead, the logic of epistemic entitlement solves this problem by entitling agents to believe???? and ¬???? on two disjoint sets of possible worlds on????,???? and????′, respectively. ℳ,???? ⊩???? ∶???? if and only if ℳ,???? ⊩???? for every???? ∈????????????(????,????) with????????????. Such an epistemic entitlement in the paper is axiomatized into the logic J_???????????? and the validity of its axioms is verified. And a canonical model of J_???????????? is established to prove its completeness. Finally, extensions of J_???????????? are attempted to explore the logic of entitlement of belief J_EntD4 and logic of entitlement of knowledge J_EntT4. (shrink)

A wide family of many-valued logics—for instance, those based on the weak Kleene algebra—includes a non-classical truth-value that is ‘contaminating’ in the sense that whenever the value is assigned to a formula φ⁠, any complex formula in which φ appears is assigned that value as well. In such systems, the contaminating value enjoys a wide range of interpretations, suggesting scenarios in which more than one of these interpretations are called for. This calls for an evaluation of systems with (...) multiple contaminating values. In this paper, we consider the countably infinite family of multiple-conclusion consequence relations in which classical logic is enriched with one or more contaminating values whose behavior is determined by a linear ordering between them. We consider some motivations and applications for such systems and provide general characterizations for all consequence relations in this family. Finally, we provide sequent calculi for a pair of four-valued logics including two linearly ordered contaminating values before defining two-sided sequent calculi corresponding to each of the infinite family of many-valued logics studied in this paper. (shrink)

We investigate a recently devised polyhedral semantics for intermediate logics, in which formulas are interpreted in n-dimensional polyhedra. An intermediate logic is polyhedrally complete if it is complete with respect to some class of polyhedra. The first main result of this paper is a necessary and sufficient condition for the polyhedral completeness of a logic. This condition, which we call the Nerve Criterion, is expressed in terms of Alexandrov’s notion of the nerve of a poset. It affords a purely combinatorial (...) characterisation of polyhedrally complete logics. Using the Nerve Criterion we show, easily, that there are continuum many intermediate logics that are not polyhedrally complete but which have the finite model property. We also provide, at considerable combinatorial labour, a countably infinite class of logics axiomatised by the Jankov–Fine formulas of ‘starlike trees’ all of which are polyhedrally complete. The polyhedral completeness theorem for these ‘starlike logics’ is the second main result of this paper. (shrink)

We investigate an enrichment of the propositional modal language L with a "universal" modality ■ having semantics x ⊧ ■φ iff ∀y(y ⊧ φ), and a countable set of "names" - a special kind of propositional variables ranging over singleton sets of worlds. The obtained language ℒ $_{c}$ proves to have a great expressive power. It is equivalent with respect to modal definability to another enrichment ℒ(⍯) of ℒ, where ⍯ is an additional modality with the semantics x ⊧ ⍯φ (...) iff Vy(y ≠ x → y ⊧ φ). Model-theoretic characterizations of modal definability in these languages are obtained. Further we consider deductive systems in ℒ $_{c}$ . Strong completeness of the normal ℒ $_{c}$ logics is proved with respect to models in which all worlds are named. Every ℒ $_{c}$ -logic axiomatized by formulae containing only names (but not propositional variables) is proved to be strongly frame-complete. Problems concerning transfer of properties ([in]completeness, filtration, finite model property etc.) from ℒ to ℒ $_{c}$ are discussed. Finally, further perspectives for names in multimodal environment are briefly sketched. (shrink)

Standpoint logic is a recently proposed formalism in the context of knowledge integration, which advocates a multi-perspective approach permitting reasoning with a selection of diverse and possibly conflicting standpoints rather than forcing their unification. In this paper, we introduce nested sequent calculi for propositional standpoint logics---proof systems that manipulate trees whose nodes are multisets of formulae---and show how to automate standpoint reasoning by means of non-deterministic proof-search algorithms. To obtain worst-case complexity-optimal proof-search, we introduce a novel technique in the context (...) of nested sequents, referred to as "coloring," which consists of taking a formula as input, guessing a certain coloring of its subformulae, and then running proof-search in a nested sequent calculus on the colored input. Our technique lets us decide the validity of standpoint formulae in CoNP since proof-search only produces a partial proof relative to each permitted coloring of the input. We show how all partial proofs can be fused together to construct a complete proof when the input is valid, and how certain partial proofs can be transformed into a counter-model when the input is invalid. These "certificates" (i.e. proofs and counter-models) serve as explanations of the (in)validity of the input. (shrink)

We present epistemic multilateral logic, a general logical framework for reasoning involving epistemic modality. Standard bilateral systems use propositional formulae marked with signs for assertion and rejection. Epistemic multilateral logic extends standard bilateral systems with a sign for the speech act of weak assertion (Incurvati and Schlöder 2019) and an operator for epistemic modality. We prove that epistemic multilateral logic is sound and complete with respect to the modal logic S5 modulo an appropriate translation. The logical framework developed (...) provides the basis for a novel, proof-theoretic approach to the study of epistemic modality. To demonstrate the fruitfulness of the approach, we show how the framework allows us to reconcile classical logic with the contradictoriness of so-called Yalcin sentences and to distinguish between various inference patterns on the basis of the epistemic properties they preserve. (shrink)

Although written in Japanese, 意志の解明（Explication of Will） pursues a Davidson-style logical formula of will-stating sentences.

In this paper I critically engage with Pauline Kleingeld’s ‘volitional self-contradiction’ interpretation of Kant’s formula of universal law. I make three remarks: first, I seek to clarify what it means for a contradiction to be volitional as opposed to logical; second, I suggest that her interpretation might need to be closer to Korsgaard’s ‘practical contradiction’ interpretation than she thinks; and third, I suggest that more work needs to be done to explain how a volitional self-contradiction generates both a (...) ‘contradiction in conception’ and a ‘contradiction in will.’. (shrink)

We study logical reduction (factorization) of relations into relations of lower arity by Boolean or relative products that come from applying conjunctions and existential quantifiers to predicates, i.e. by primitive positive formulas of predicate calculus. Our algebraic framework unifies natural joins and data dependencies of database theory and relational algebra of clone theory with the bond algebra of C.S. Peirce. We also offer new constructions of reductions, systematically study irreducible relations and reductions to them and introduce a new characteristic (...) of relations, ternarity, that measures their ‘complexity of relating’ and allows to refine reduction results. In particular, we refine Peirce’s controversial reduction thesis, and show that reducibility behaviour is dramatically different on finite and infinite domains. (shrink)

The present paper intends to report two results. It is shown that the formula P(x)=∀y∀z[¬G(x, y)→¬M(z)] provides the logic underlying gauge symmetry, where M denotes the predicate of being massive. For the logic of spontaneous symmetry breaking, by Higgs mechanism, we have P(x)=∀y∀z[G(x, y)→M(z)]. Notice that the above two formulas are not logically equivalent. The results are obtained by integrating four components, namely, gauge symmetry and Higgs mechanism in quantum field theory, and Gödel's incompleteness theorem and Tarski's indefinability theorem (...) in mathematical logic. Gödel numbering is the key for arithmetic modeling applied in this paper. (shrink)

Semantic Information conveyed by daily language has been researched for many years; yet, we still need a practical formula to measure information of a simple sentence or prediction, such as “There will be heavy rain tomorrow”. For practical purpose, this paper introduces a new formula, Semantic Information Formula (SIF), which is based on L. A. Zadeh’s fuzzy set theory and P. Z. Wang’s random set falling shadow theory. It carries forward C. E. Shannon and K. Popper’s thought. (...) The fuzzy set’s probability defined by Zadeh is treated as the logical probability sought by Popper, and the membership grade is treated as the truth-value of a proposition and also as the posterior logical probability. The classical relative information formula (Information=log(Posterior probability / Prior probability) is revised into SIF by replacing the posterior probability with the membership grade and the prior probability with the fuzzy set’s probability. The SIF can be explained as “Information=Testing severity – Relative square deviation” and hence can be used as Popper's information criterion to test scientific theories or propositions. The information measure defined by the SIF also means the spared codeword length as the classical information measure. This paper introduces the set-Bayes’ formula which establishes the relationship between statistical probability and logical probability, derives Fuzzy Information Criterion (FIC) for the optimization of semantic channel, and discusses applications of SIF and FIC in areas such as linguistic communication, prediction, estimation, test, GPS, translation, and fuzzy reasoning. Particularly, through a detailed example of reasoning, it is proved that we can improve semantic channel with proper fuzziness to increase average semantic information to reach its upper limit: Shannon mutual information. (shrink)

Logics based on weak Kleene algebra (WKA) and related structures have been recently proposed as a tool for reasoning about flaws in computer programs. The key element of this proposal is the presence, in WKA and related structures, of a non-classical truth-value that is “contaminating” in the sense that whenever the value is assigned to a formula ϕ, any complex formula in which ϕ appears is assigned that value as well. Under such interpretations, the contaminating states represent occurrences (...) of a flaw. However, since different programs and machines can interact with (or be nested into) one another, we need to account for different kind of errors, and this calls for an evaluation of systems with multiple contaminating values. In this paper, we make steps toward these evaluation systems by considering two logics, HYB1 and HYB2, whose semantic interpretations account for two contaminating values beside classical values 0 and 1. In particular, we provide two main formal contributions. First, we give a characterization of their relations of (multiple-conclusion) logical consequence—that is, necessary and sufficient conditions for a set Δ of formulas to logically follow from a set Γ of formulas in HYB1 or HYB2 . Second, we provide sound and complete sequent calculi for the two logics. (shrink)

This paper and its sequel “look under the hood” of the usual sorts of proof-theoretic systems for certain well-known intuitionistic and classical propositional modal logics. Section 1 is preliminary. Of most importance: a marked formula will be the result of prefixing a formula in a propositional modal language with a step-marker, for this paper either 0 or 1. Think of 1 as indicating the taking of “one step away from 0.” Deductions will be constructed using marked formulas. Section (...) 2 presents the model-theoretic concepts, based on those in [7], that guide the rest of this paper. Section 3 presents Natural Deduction systems IK and CK, formalizations of intuitionistic and classical one-step versions of K. In these systems, occurrences of step-markers allow deductions to display deductive structure that is covered over in familiar “no step” proof-theoretic systems for such logics. Box and Diamond are governed by Introduction and Elimination rules; the familiar K rule and Necessitation are derived (i.e. admissible) rules. CK will be the result of adding the 0-version of the Rule of Excluded Middle to the rules which generate IK. Note: IK is the result of merely dropping that rule from those generating CK, without addition of further rules or axioms (as was needed in [7]). These proof-theoretic systems yield intuitionistic and classical consequence relations by the obvious definition. Section 4 provides some examples of what can be deduced in IK. Section 5 defines some proof-theoretic concepts that are used in Section 6 to prove the soundness of the consequence relation for IK (relative to the class of models defined in Section 2.) Section 7 proves its completeness (relative to that class). Section 8 extends these results to the consequence relation for CK. (Looking ahead: Part 2 will investigate one-step proof-theoretic systems formalizing intuitionistic and classical one-step versions of some familiar logics stronger than K.). (shrink)

In this extended critical discussion of 'Kant's Modal Metaphysics' by Nicholas Stang (OUP 2016), I focus on one central issue from the first chapter of the book: Stang’s account of Kant’s doctrine that existence is not a real predicate. In §2 I outline some background. In §§3-4 I present and then elaborate on Stang’s interpretation of Kant’s view that existence is not a real predicate. For Stang, the question of whether existence is a real predicate amounts to the question: ‘could (...) there be non-actual possibilia?’ (p.35). Kant’s view, according to Stang, is that there could not, and that the very notion of non-actual or ‘mere’ possibilia is incoherent. In §5 I take a close look at Stang’s master argument that Kant’s Leibnizian predecessors are committed to the claim that existence is a real predicate, and thus to mere possibilia. I argue that it involves substantial logical commitments that the Leibnizian could reject. I also suggest that it is danger of proving too much. In §6 I explore two closely related logical commitments that Stang’s reading implicitly imposes on Kant, namely a negative universal free logic and a quantified modal logic that invalidates the Converse Barcan Formula. I suggest that each can seem to involve Kant himself in commitment to mere possibilia. (shrink)

Lewis (1968) claims that his language of Counterpart Theory (CT) interprets modal discourse and he adverts to a translation scheme from the language of Quantifed Modal Logic (QML) to CT. However, everybody now agrees that his original translation scheme does not always work, since it does not always preserve the ‘intuitive’ meaning of the translated QML-formulas. Lewis discusses this problem with regard to the Necessitist Thesis, and I will extend his discourse to the analysis of the Converse Barcan Formula. (...) Everyone also agrees that there are CT-formulas that can express the QMLcontent that gets lost through the translation. The problem is how we arrive to them. In this paper, I propose new translation rules from QML to CT, based on a suggestion by Kaplan. However, I will claim that we cannot have ‘the’ translation scheme from QML to CT. The reason being that de re modal language is ambiguous. Accordingly, there are diferent sorts of QML, depending on how we resolve such ambiguity. Therefore, depending on what sort of QML we intend to translate into CT, we need to use the corresponding translation scheme. This suggests that all the translation problems might just disappear if we do what Lewis did not: begin with a fully worked out QML that tells us how to understand de re modal discourse. (shrink)

A complete axiomatic system CTL$_{rp}$ is introduced for a temporal logic for finitely branching $\omega^+$-trees in a temporal language extended with so called reference pointers. Syntactic and semantic interpretations are constructed for the branching time computation tree logic CTL$^{*}$ into CTL$_{rp}$. In particular, that yields a complete axiomatization for the translations of all valid CTL$^{*}$-formulae. Thus, the temporal logic with reference pointers is brought forward as a simpler (with no path quantifiers), but in a way more expressive medium for reasoning (...) about branching time. (shrink)

This paper investigates the metaphysics in higher-order counterfactual logic. I establish the necessity of identity and distinctness and show that the logic is committed to vacuism, which entails that all counteridenticals are true. I prove the Barcan, Converse Barcan, Being Constraint and Necessitism. I then show how to derive the Identity of Indiscernibles in counterfactual logic. I study a form of maximalist ontology which has been claimed to be so expansive as to be inconsistent. I show that it is equivalent (...) to the collapse of the counterfactual into the material conditional---which is itself equivalent to the modal logic TRIV. TRIV is consistent, from which it follows that maximalism is, surprisingly, consistent. I close by arguing that stating the limit assumption requires a higher-order logic. (shrink)

In this article, we present a definition of a hyperintensionality appropriate to relevant logics. We then show that relevant logics are hyperintensional in this sense, drawing consequences for other non-classical logics, including HYPE and some substructural logics. We further prove results concerning extensionality in relevant logics. We close by discussing related concepts for classifying formula contexts and potential applications of these results.

Complete deductive systems are constructed for the non-valid (refutable) formulae and sequents of some propositional modal logics. Thus, complete syntactic characterizations in the sense of Lukasiewicz are established for these logics and, in particular, purely syntactic decision procedures for them are obtained. The paper also contains some historical remarks and a general discussion on refutation systems.

Bilattices, introduced by Ginsberg as a uniform framework for inference in artificial intelligence, are algebraic structures that proved useful in many fields. In recent years, Arieli and Avron developed a logical system based on a class of bilattice-based matrices, called logical bilattices, and provided a Gentzen-style calculus for it. This logic is essentially an expansion of the well-known Belnap–Dunn four-valued logic to the standard language of bilattices. Our aim is to study Arieli and Avron’s logic from the perspective (...) of abstract algebraic logic . We introduce a Hilbert-style axiomatization in order to investigate the properties of the algebraic models of this logic, proving that every formula can be reduced to an equivalent normal form and that our axiomatization is complete w.r.t. Arieli and Avron’s semantics. In this way, we are able to classify this logic according to the criteria of AAL. We show, for instance, that it is non-protoalgebraic and non-self-extensional. We also characterize its Tarski congruence and the class of algebraic reducts of its reduced generalized models, which in the general theory of AAL is usually taken to be the algebraic counterpart of a sentential logic. This class turns out to be the variety generated by the smallest non-trivial bilattice, which is strictly contained in the class of algebraic reducts of logical bilattices. On the other hand, we prove that the class of algebraic reducts of reduced models of our logic is strictly included in the class of algebraic reducts of its reduced generalized models. Another interesting result obtained is that, as happens with some implicationless fragments of well-known logics, we can associate with our logic a Gentzen calculus which is algebraizable in the sense of Rebagliato and Verdú . We also prove some purely algebraic results concerning bilattices, for instance that the variety of distributive bilattices is generated by the smallest non-trivial bilattice. This result is based on an improvement of a theorem by Avron stating that every bounded interlaced bilattice is isomorphic to a certain product of two bounded lattices. We generalize it to the case of unbounded interlaced bilattices. (shrink)

This note considers deductive systems for the operator a of unprovability in some particular propositional normal modal logics. We give thus complete syntactic characterization of these logics in the sense of Lukasiewicz: for every formula  either `  or a  (but not both) is derivable. In particular, purely syntactic decision procedure is provided for the logics under considerations.

There is a curious bifurcation in the literature on ground and its logic. On the one hand, there has been a great deal of work that presumes that logical complexity invariably yields grounding. So, for instance, it is widely presumed that any fact stated by a true conjunction is grounded in those stated by its conjuncts, that any fact stated by a true disjunction is grounded in that stated by any of its true disjuncts, and that any fact stated (...) by a true double negation is grounded in that stated by the doubly-negated formula. This commitment is encapsulated in the system GG axiomatized and semantically characterized by [deRosset and Fine, 2023] (following [Fine, 2012]). On the other hand, there has been a great deal of important formal work on “flatter” theories of ground, yielding logics very different from GG [Correia, 2010] [Fine, 2016, 2017b]. For instance, these theories identify the fact stated by a self-conjunction $$(\phi \wedge \phi )$$ with that stated by its conjunct $$\phi $$. Since, in these systems, no fact grounds itself, the “flatter” theories are inconsistent with the principles of GG. This bifurcation raises the question of whether there is a single notion of ground suited to fulfill the philosophical ambitions of grounding enthusiasts. There is, at present, no unified semantic framework employing a single conception of ground for simultaneously characterizing both GG and the “flatter” approaches. This paper fills this gap by specifying such a framework and demonstrating its adequacy. (shrink)

We examine the set of formula-to-formula valid inferences of Classical Logic, where the premise and the conclusion share at least a propositional variable in common. We review the fact, already proved in the literature, that such a system is identical to the first-degree entailment fragment of R. Epstein's Relatedness Logic, and that it is a non-transitive logic of the sort investigated by S. Frankowski and others. Furthermore, we provide a semantics and a calculus for this logic. The semantics (...) is defined in terms of a \-matrix built on top of a 5-valued extension of the 3-element weak Kleene algebra, whereas the calculus is defined in terms of a Gentzen-style sequent system where the left and right negation rules are subject to linguistic constraints. (shrink)

This paper studies a formalisation of intuitionistic logic by Negri and von Plato which has general introduction and elimination rules. The philosophical importance of the system is expounded. Definitions of ‘maximal formula’, ‘segment’ and ‘maximal segment’ suitable to the system are formulated and corresponding reduction procedures for maximal formulas and permutative reduction procedures for maximal segments given. Alternatives to the main method used are also considered. It is shown that deductions in the system convert into normal form and that (...) deductions in normal form have the subformula property. (shrink)

In this article, we will present a number of technical results concerning Classical Logic, ST and related systems. Our main contribution consists in offering a novel identity criterion for logics in general and, therefore, for Classical Logic. In particular, we will firstly generalize the ST phenomenon, thereby obtaining a recursively defined hierarchy of strict-tolerant systems. Secondly, we will prove that the logics in this hierarchy are progressively more classical, although not entirely classical. We will claim that a logic is to (...) be identified with an infinite sequence of consequence relations holding between increasingly complex relata: formulae, inferences, metainferences, and so on. As a result, the present proposal allows not only to differentiate Classical Logic from ST, but also from other systems sharing with it their valid metainferences. Finally, we show how these results have interesting consequences for some topics in the philosophical logic literature, among them for the debate around Logical Pluralism. The reason being that the discussion concerning this topic is usually carried out employing a rivalry criterion for logics that will need to be modified in light of the present investigation, according to which two logics can be non-identical even if they share the same valid inferences. (shrink)

This paper presents rules of inference for a binary quantifier I for the formalisation of sentences containing definite descriptions within intuitionist positive free logic. I binds one variable and forms a formula from two formulas. Ix[F, G] means ‘The F is G’. The system is shown to have desirable proof-theoretic properties: it is proved that deductions in it can be brought into normal form. The discussion is rounded up by comparisons between the approach to the formalisation of definite descriptions (...) recommended here and the more usual approach that uses a term-forming operator ι, where ιxF means ‘the F’. (shrink)

This paper presents a semantical analysis of the Weak Kleene Logics Kw3 and PWK from the tradition of Bochvar and Halldén. These are three-valued logics in which a formula takes the third value if at least one of its components does. The paper establishes two main results: a characterisation result for the relation of logical con- sequence in PWK – that is, we individuate necessary and sufficient conditions for a set.

The paper is about 'absolute logic': an approach to logic that differs from the standard first-order logic and other known approaches. It should be a new approach the author has created proposing to obtain a general and unifying approach to logic and a faithful model of human mathematical deductive process. In first-order logic there exist two different concepts of term and formula, in place of these two concepts in our approach we have just one notion of expression. In our (...) system the set-builder notation is an expression-building pattern. In our system we can easily express second-order, third order and any-order conditions. The meaning of a sentence will depend solely on the meaning of the symbols it contains, it will not depend on external 'structures'. Our deductive system is based on a very simple definition of proof and provides a good model of human mathematical deductive process. The soundness and consistency of the system are proved. We discuss on the completeness of our deductive systems. We also discuss how our system relates to the most know types of paradoxes, from the discussion no specific vulnerability to paradoxes comes out. The paper provides both the theoretical material and a fully documented example of deduction. (shrink)

This paper considers a formalisation of classical logic using general introduction rules and general elimination rules. It proposes a definition of ‘maximal formula’, ‘segment’ and ‘maximal segment’ suitable to the system, and gives reduction procedures for them. It is then shown that deductions in the system convert into normal form, i.e. deductions that contain neither maximal formulas nor maximal segments, and that deductions in normal form satisfy the subformula property. Tarski’s Rule is treated as a general introduction rule for (...) implication. The general introduction rule for negation has a similar form. Maximal formulas with implication or negation as main operator require reduction procedures of a more intricate kind not present in normalisation for intuitionist logic. (shrink)

Infectious logics are systems that have a truth-value that is assigned to a compound formula whenever it is assigned to one of its components. This paper studies four-valued infectious logics as the basis of transparent theories of truth. This take is motivated as a way to treat different pathological sentences differently, namely, by allowing some of them to be truth-value gluts and some others to be truth-value gaps and as a way to treat the semantic pathology suffered by at (...) least some of these sentences as infectious. This leads us to consider four distinct four-valued logics: one where truth-value gaps are infectious, but gluts are not; one where truth-value gluts are infectious, but gaps are not; and two logics where both gluts and gaps are infectious, in some sense. Additionally, we focus on the proof theory of these systems, by offering a discussion of two related topics. On the one hand, we prove some limitations regarding the possibility of providing standard Gentzen sequent calculi for these systems, by dualizing and extending some recent results for infectious logics. On the other hand, we provide sound and complete four-sided sequent calculi, arguing that the most important technical and philosophical features taken into account to usually prefer standard calculi are, indeed, enjoyed by the four-sided systems. (shrink)

We employ a recently developed methodology -- called "structural refinement" -- to extract nested sequent systems for a sizable class of intuitionistic modal logics from their respective labelled sequent systems. This method can be seen as a means by which labelled sequent systems can be transformed into nested sequent systems through the introduction of propagation rules and the elimination of structural rules, followed by a notational translation. The nested systems we obtain incorporate propagation rules that are parameterized with formal grammars, (...) and which encode certain frame conditions expressible as first-order Horn formulae that correspond to a subclass of the Scott-Lemmon axioms. We show that our nested systems are sound, cut-free complete, and admit hp-admissibility of typical structural rules. (shrink)

A general class of labeled sequent calculi is investigated, and necessary and sufficient conditions are given for when such a calculus is sound and complete for a finite -valued logic if the labels are interpreted as sets of truth values. Furthermore, it is shown that any finite -valued logic can be given an axiomatization by such a labeled calculus using arbitrary "systems of signs," i.e., of sets of truth values, as labels. The number of labels needed is logarithmic in the (...) number of truth values, and it is shown that this bound is tight. (shrink)

We begin with the hypothetical assumption that Tarski’s 1933 formula ∀ True(x) φ(x) has been defined such that ∀x Tarski:True(x) ↔ Boolean-True. On the basis of this logical premise we formalize the Truth Teller Paradox: "This sentence is true." showing syntactically how self-reference paradox is semantically ungrounded.

Already in ancient philosophy, there was a transition from the implicit and hidden action of the Logical ( lógos) in nature ( phýsis) to the scientific and explicit expression of the logical structures of thought, action, the world and language. Heraclitus' heno-logic with Logos as hidden implicit principle of homologization of opposites ( tà enantía) in nature differs from Parmenides' paraconsistent logic developed in a hypothetical hemidyalectics given in the formula ''All is One'' ( hén pánta eînai). (...) Plato's concept of dia-logic (dialektikè téchne ) with a new concept of Logos as the one genus of beings ( hén tí génon toôn ontoôn) in which the word not-Being (negation) got its place enabled production of dyadic logical structure by the granulation of genera into opposite species and sub-species that it contains. Aristotle's concept of triadic-logic as syl-logistics ( syllogismós) and demonstrative science (epistéme apodeiktikê ) give a new approach by new granulation of the concept of Logos into triadic logical structure: (1) the structure of being (substratum-attributes relation), (2) the structure of thought (substance-second substances relation), and (3) the structure of propositions (subject-predicate relation). Plato's dialectic and Aristotle's syllogistic both deconstructed the implicit ontological unity of the world (pan, kosmos, sphairos ) given through the concept of Logos in Pre-Socratic philosophy in order to make that unity in explicit form given by the logical and semantical structures of the propositions about the world, about the thought and about the language. The hidden implicit of the nature, which had to be known intuitively, was transformed into unhidden explicit inferential logical structures given in the semantics and pragmatics of scientific demonstration. (shrink)

We introduce a framework that allows for the construction of sequent systems for expressive description logics extending ALC. Our framework not only covers a wide array of common description logics, but also allows for sequent systems to be obtained for extensions of description logics with special formulae that we call "role relational axioms." All sequent systems are sound, complete, and possess favorable properties such as height-preserving admissibility of common structural rules and height-preserving invertibility of rules.

In this paper we analyze how the semantics of the Alternating-time Temporal Logic ATL$^*$ deals with agents' commitments to strategies in the process of formula evaluation. In (\acro{atl}$^*$), one can express statements about the strategic ability of an agent (or a coalition of agents) to achieve a goal $\phi$ such as: ``agent $i$ can choose a strategy such that, if $i$ follows this strategy then, no matter what other agents do, $\phi$ will always be true''. However, strategies in \acro{atl} (...) are \emph{revocable} in the sense that in the evaluation of the goal $\phi$ the agent $i$ is no longer restricted by the strategy she has chosen in order to reach the state where the goal is evaluated. -/- Here we discuss some alternatives leading to amendments of that semantics. In particular, we consider variants of \acro{atl}$^*$ where strategies, on the contrary, are \emph{irrevocable}. Unlike in the standard semantics of \acro{atl}, memory plays an essential role in the semantics based on irrevocable strategies. -/- Further, we propose and discuss various syntactic and semantics mechanisms for handling commitments to strategies and release from such commitments in the semantics of ATL$^*$, leading to more expressive and semantically refined versions of that logic. (shrink)

FDE is a logic that captures relevant entailment between implication-free formulae and admits of an intuitive informational interpretation as a 4-valued logic in which “a computer should think”. However, the logic is co-NP complete, and so an idealized model of how an agent can think. We address this issue by shifting to signed formulae where the signs express imprecise values associated with two distinct bipartitions of the set of standard 4 values. Thus, we present a proof system which consists of (...) linear operational rules and only two branching structural rules, the latter expressing a generalized rule of bivalence. This system naturally leads to defining an infinite hierarchy of tractable depth-bounded approximations to FDE. Namely, approximations in which the number of nested applications of the two branching rules is bounded. (shrink)

This paper investigates logical aspects of combining linear orders as semantics for modal and temporal logics, with modalities for possible paths, resulting in a variety of branching time logics over classes of trees. Here we adopt a unified approach to the Priorean, Peircean and Ockhamist semantics for branching time logics, by considering them all as fragments of the latter, obtained as combinations, in various degrees, of languages and semantics for linear time with a modality for possible paths. We then (...) consider a hierarchy of natural classes of trees and bundled trees arising from a given class of linear orders and show that in general they provide different semantics. We also discuss transfer of definability from linear orders to trees and introduce a uniform translation from Priorean to Peircean formulae which transfers definability of properties of linear orders to definability of properties of all paths in trees. (shrink)

In this paper we discuss the extent to which conjunction and disjunction can be rightfully regarded as such, in the context of infectious logics. Infectious logics are peculiar many-valued logics whose underlying algebra has an absorbing or infectious element, which is assigned to a compound formula whenever it is assigned to one of its components. To discuss these matters, we review the philosophical motivations for infectious logics due to Bochvar, Halldén, Fitting, Ferguson and Beall, noticing that none of them (...) discusses our main question. This is why we finally turn to the analysis of the truth-conditions for conjunction and disjunction in infectious logics, employing the framework of plurivalent logics, as discussed by Priest. In doing so, we arrive at the interesting conclusion that —in the context of infectious logics— conjunction is conjunction, whereas disjunction is not disjunction. (shrink)

Sentences containing definite descriptions, expressions of the form ‘The F’, can be formalised using a binary quantifier ι that forms a formula out of two predicates, where ιx[F, G] is read as ‘The F is G’. This is an innovation over the usual formalisation of definite descriptions with a term forming operator. The present paper compares the two approaches. After a brief overview of the system INFι of intuitionist negative free logic extended by such a quantifier, which was presented (...) in (Kürbis 2019), INFι is first compared to a system of Tennant’s and an axiomatic treatment of a term forming ι operator within intuitionist negative free logic. Both systems are shown to be equivalent to the subsystem of INFι in which the G of ιx[F, G] is restricted to identity. INFι is then compared to an intuitionist version of a system of Lambert’s which in addition to the term forming operator has an operator for predicate abstraction for indicating scope distinctions. The two systems will be shown to be equivalent through a translation between their respective languages. Advantages of the present approach over the alternatives are indicated in the discussion. (shrink)

We introduce and study hierarchies of extensions of the propositional modal and temporal languages with pairs of new syntactic devices: point of reference-reference pointer which enable semantic references to be made within a formula. We propose three different but equivalent semantics for the extended languages, discuss and compare their expressiveness. The languages with reference pointers are shown to have great expressive power (especially when their frugal syntax is taken into account), perspicuous semantics, and simple deductive systems. For instance, Kamp's (...) and Stavi's temporal operators, as well as nominals (names, clock variables), are definable in them. Universal validity in these languages is proved undecidable. The basic modal and temporal logics with reference pointers are uniformly axiomatized and a strong completeness theorem is proved for them and extended to some classes of their extensions. (shrink)

Rosenkranz (2021) devised two bimodal epistemic logics: an idealized one and a realistic one. The former is shown to be sound with respect to a class of neighborhood frames called i-frames. Rosenkranz designed a specific i-frame able to invalidate a series of undesired formulas, proving that these are not theorems of the idealized logic. Nonetheless, an unwanted formula and an unwanted rule of inference are not invalidated. Invalidating the former guarantees the distinction between the two modal operators characteristic of (...) the logic, while invalidating the latter is crucial in order to deal with the problem of logical omniscience. In this paper, I present an i-frame able to invalidate all the undesired formulas already invalidated by Rosenkranz, together with the missing formula and rule of inference. (shrink)