In this paper the logic of broad necessity is explored. Definitions of what it means for one modality to be broader than another are formulated, and it is proven, in the context of higher-order logic, that there is a broadest necessity, settling one of the central questions of this investigation. It is shown, moreover, that it is possible to give a reductive analysis of this necessity in extensional language. This relates more generally to a conjecture that it is not possible (...) to define intensional connectives from extensional notions. This conjecture is formulated precisely in higher-order logic, and concrete cases in which it fails are examined. The paper ends with a discussion of the logic of broad necessity. It is shown that the logic of broad necessity is a normal modal logic between S4 and Triv, and that it is consistent with a natural axiomatic system of higher-order logic that it is exactly S4. Some philosophical reasons to think that the logic of broad necessity does not include the S5 principle are given. (shrink)

In this paper we prove the uncompactness of every stit logic that contains a generalized refref conditional and is a sublogic of the stit logic with refref equivalence, a syntactical condition of uncompactness that covers infinitely many stit logics. This result is established through the uncompactness of every stit logic whose semantic structures contain no chain of busy choice sequences with cardinality , where is any natural number . The basic idea in the proof is to apply the notion of (...) companions to stit sentences in finding busy choice sequences in structures, and to make use of a relation between chains of busy choice sequences and generalized refref conditionals in connecting the two conditions of uncompactness mentioned above. (shrink)

There are many parallels between the role of possible worlds in modal logic and that of times in tense logic. But the similarities only go so far, and it is important to note where the two come apart. This paper argues that even though worlds and times play similar roles in the model theories of modal and tense logic, there is no tense analogue of the possible-worlds analysis of modal operators. An important corollary of this result is that presentism cannot (...) be the tense analogue of actualism. (shrink)

The purpose of this paper is to present some results instit theory, a theory of agency proposed by N. Belnap and M. Perloff. We will establish a correspondence between the numbers ofstit modalities and the complexity degrees ofbusy choice sequences in semantic structures, and consequently, a correspondence between the number of modes of actions/inactions instit theory and the complexity degrees ofbusy choice sequences in semantic structures.

Epistemic modals have peculiar logical features that are challenging to account for in a broadly classical framework. For instance, while a sentence of the form $$p\wedge \Diamond \lnot p$$ (‘p, but it might be that not p’) appears to be a contradiction, $$\Diamond \lnot p$$ does not entail $$\lnot p$$, which would follow in classical logic. Likewise, the classical laws of distributivity and disjunctive syllogism fail for epistemic modals. Existing attempts to account for these facts generally either under- or over-correct. (...) Some theories predict that $$ p\wedge \Diamond \lnot p$$, a so-called epistemic contradiction, is a contradiction only in an etiolated sense, under a notion of entailment that does not always allow us to replace $$p\wedge \Diamond \lnot p$$ with a contradiction; these theories underpredict the infelicity of embedded epistemic contradictions. Other theories savage classical logic, eliminating not just rules that intuitively fail, like distributivity and disjunctive syllogism, but also rules like non-contradiction, excluded middle, De Morgan’s laws, and disjunction introduction, which intuitively remain valid for epistemic modals. In this paper, we aim for a middle ground, developing a semantics and logic for epistemic modals that makes epistemic contradictions genuine contradictions and that invalidates distributivity and disjunctive syllogism but that otherwise preserves classical laws that intuitively remain valid. We start with an algebraic semantics, based on ortholattices instead of Boolean algebras, and then propose a possibility semantics, based on partial possibilities related by compatibility. Both semantics yield the same consequence relation, which we axiomatize. We then show how to lift an arbitrary possible worlds model for a non-modal language to a possibility model for a language with epistemic modals. The goal throughout is to retain what is desirable about classical logic while accounting for the non-classicality of epistemic vocabulary. (shrink)

Hilbert’s choice operators τ and ε, when added to intuitionistic logic, strengthen it. In the presence of certain extensionality axioms they produce classical logic, while in the presence of weaker decidability conditions for terms they produce various superintuitionistic intermediate logics. In this thesis, I argue that there are important philosophical lessons to be learned from these results. To make the case, I begin with a historical discussion situating the development of Hilbert’s operators in relation to his evolving program in the (...) foundations of mathematics and in relation to philosophical motivations leading to the development of intuitionistic logic. This sets the stage for a brief description of the relevant part of Dummett’s program to recast debates in metaphysics, and in particular disputes about realism and anti-realism, as closely intertwined with issues in philosophical logic, with the acceptance of classical logic for a domain reflecting a commitment to realism for that domain. Then I review extant results about what is provable and what is not when one adds epsilon to intuitionistic logic, largely due to Bell and DeVidi, and I give several new proofs of intermediate logics from intuitionistic logic+ε without identity. With all this in hand, I turn to a discussion of the philosophical significance of choice operators. Among the conclusions I defend are that these results provide a finer-grained basis for Dummett’s contention that commitment to classically valid but intuitionistically invalid principles reflect metaphysical commitments by showing those principles to be derivable from certain existence assumptions; that Dummett’s framework is improved by these results as they show that questions of realism and anti-realism are not an “all or nothing” matter, but that there are plausibly metaphysical stances between the poles of anti-realism and realism, because different sorts of ontological assumptions yield intermediate rather than classical logic; and that these intermediate positions between classical and intuitionistic logic link up in interesting ways with our intuitions about issues of objectivity and reality, and do so usefully by linking to questions around intriguing everyday concepts such as “is smart,” which I suggest involve a number of distinct dimensions which might themselves be objective, but because of their multivalent structure are themselves intermediate between being objective and not. Finally, I discuss the implications of these results for ongoing debates about the status of arbitrary and ideal objects in the foundations of logic, showing among other things that much of the discussion is flawed because it does not recognize the degree to which the claims being made depend on the presumption that one is working with a very strong logic. (shrink)

We study a class of formulas generalizing the weak law of the excluded middle and provide a characterization of these formulas in terms of Kripke frames and Brouwer algebras. We use these formulas to separate logics corresponding to factors of the Medvedev lattice.

Using labelled formulae, a cut-free sequent calculus for intuitionistic propositional logic is presented, together with an easy cut-admissibility proof; both extend to cover, in a uniform fashion, all intermediate logics characterised by frames satisfying conditions expressible by one or more geometric implications. Each of these logics is embedded by the Gödel–McKinsey–Tarski translation into an extension of S4. Faithfulness of the embedding is proved in a simple and general way by constructive proof-theoretic methods, without appeal to semantics other than in the (...) explanation of the rules. (shrink)

Hamkins and Löwe proved that the modal logic of forcing is S4.2 . In this paper, we consider its modal companion, the intermediate logic KC and relate it to the fatal Heyting algebra H ZFC of forcing persistent sentences. This Heyting algebra is equationally generic for the class of fatal Heyting algebras. Motivated by these results, we further analyse the class of fatal Heyting algebras.

We consider modal logics whose intermediate fragments lie between the logic of infinite problems [20] and the Medvedev logic of finite problems [15]. There is continuum of such logics [19]. We prove that none of them is finitely axiomatizable. The proof is based on methods from [12] and makes use of some graph-theoretic constructions (operations on coverings, and colourings).

The numerous modal systems between S4 and S5 are investigated from an epistemological point of view by interpreting necessity either as knowledge or as (strong) belief. It is shown that-granted some assumptions about epistemic logic for which the author has argued elsewhere-the system S4.4 may be interpreted as the logic of true belief, while S4.3.2 and S4.2 may be taken to represent epistemic logic systems for individuals who accept the scheme knowledge = true belief only for certain special instances. There (...) is strong evidence in favor of the assumption that S4.2 is the logic of knowledge. (shrink)

We prove that S4 is complete with respect to Boolean combinations of countable unions of convex subsets of the real line, thus strengthening a 1944 result of McKinsey and Tarski 45 141). We also prove that the same result holds for the bimodal system S4+S5+C, which is a strengthening of a 1999 result of Shehtman 369).

This paper investigates (modal) extensions of Heyting-Brouwer logic, i.e., the logic which results when the dual of implication (alias coimplication) is added to the language of intuitionistic logic. We first develop matrix as well as Kripke style semantics for those logics. Then, by extending the Gö;del-embedding of intuitionistic logic into S4, it is shown that all (modal) extensions of Heyting-Brouwer logic can be embedded into tense logics (with additional modal operators). An extension of the Blok-Esakia-Theorem is proved for this embedding.

Questions connected with the admissibility of rules of inference and the solvability of the substitution problem for modal and intuitionistic logic are considered in an algebraic framework. The main result is the decidability of the universal theory of the free modal algebra imageω extended in signature by adding constants for free generators. As corollaries we obtain: there exists an algorithm for the recognition of admissibility of rules with parameters in the modal system Grz, the substitution problem for Grz and for (...) the intuitionistic calculus H is decidable, intuitionistic propositional calculus H is decidable with respect to admissibility . A semantical criterion for the admissibility of rules of inference in Grz is given. (shrink)

We present a uniform proof-theoretic proof of the Gödel–McKinsey–Tarski embedding for a class of first-order intuitionistic theories. This is achieved by adapting to the case of modal logic the methods of proof analysis in order to convert axioms into rules of inference of a suitable sequent calculus. The soundness and the faithfulness of the embedding are proved by induction on the height of the derivations in the augmented calculi. Finally, we define an extension of the modal system for which the (...) result holds with respect to geometric intuitionistic. (shrink)

It is demonstrated that Hamblin's 15 tense theorem does not only hold for temporal logic with linear time but also for branching time. Furthermore three other theorems with finitely many tenses are shown.

ABSTRACT A spatial logic is a modal logic of which the models are the mathematical models of space. Successively considering the mathematical models of space that are the incidence geometry and the projective geometry, we will successively establish the language, the semantical basis, the axiomatical presentation, the proof of the decidability and the proof of the completeness of INC, the modal multilogic of incidence geometry, and PRO, the modal multilogic of projective geometry.

Stone representation theorems are a central ingredient in the metatheory of philosophical logics and are used to establish modal embedding results in a general but indirect and non-constructive way. Their use in logical embeddings will be reviewed and it will be shown how they can be circumvented in favour of direct and constructive arguments through the methods of analytic proof theory, and how the intensional part of the representation results can be recovered from the syntactic proof of those embeddings. Analytic (...) methods will also be used to establish the embedding of subintuitionistic logics into the corresponding modal logics. Finally, proof-theoretic embeddings will be interpreted as a reduction of classes of word problems. (shrink)

Proofs and countermodels are the two sides of completeness proofs, but, in general, failure to find one does not automatically give the other. The limitation is encountered also for decidable non-classical logics in traditional completeness proofs based on Henkin’s method of maximal consistent sets of formulas. A method is presented that makes it possible to establish completeness in a direct way: For any given sequent either a proof in the given logical system or a countermodel in the corresponding frame class (...) is found. The method is a synthesis of a generation of calculi with internalized relational semantics, a Tait–Schütte–Takeuti style completeness proof, and procedures to finitize the countermodel construction. Finitizations for intuitionistic propositional logic are obtained through the search for a minimal derivation, through pruning of infinite branches in search trees by means of a suitable syntactic counterpart of semantic filtration, or through a proof-theoretic embedding into an appropriate provability logic. A number of examples illustrates the method, its subtleties, challenges, and present scope. (shrink)

Our investigation is concerned with the finite model property with respect to admissible rules. We establish general sufficient conditions for absence of fmp w. r. t. admissibility which are applicable to modal logics containing K4: Theorem 3.1 says that no logic λ containing K4 with the co-cover property and of width > 2 has fmp w. r. t. admissibility. Surprisingly many, if not to say all, important modal logics of width > 2 are within the scope of this theorem–K4 itself, (...) S4, GL, K4.1, K4.2, S4.1, S4.2, GL.2, etc. Thus the situation is completely opposite to the case of the ordinary fmp–the absolute majority of important logics have fmp, but not with respect to admissibility. As regards logics of width ≤ 2, there exists a zone for fmp w. r. t. admissibility. It is shown that all modal logics A of width ≤ 2 extending S4 which are not sub-logics of three special tabular logics have fmp w.r.t. admissibility. (shrink)

A deductive system is said to be structurally complete if its admissible rules are derivable. In addition, it is called hereditarily structurally complete if all its extensions are structurally complete. Citkin (1978) proved that an intermediate logic is hereditarily structurally complete if and only if the variety of Heyting algebras associated with it omits five finite algebras. Despite its importance in the theory of admissible rules, a direct proof of Citkin’s theorem is not widely accessible. In this paper we offer (...) a self-contained proof of Citkin’s theorem, based on Esakia duality and the method of subframe formulas. As a corollary, we obtain a short proof of Citkin’s 2019 characterization of hereditarily structurally complete positive logics. (shrink)

We prove that S4 is complete with respect to Boolean combinations of countable unions of convex subsets of the real line, thus strengthening a 1944 result of McKinsey and Tarski 45 141). We also prove that the same result holds for the bimodal system S4+S5+C, which is a strengthening of a 1999 result of Shehtman 369).

Coming fromI andCl, i.e. from intuitionistic and classical propositional calculi with the substitution rule postulated, and using the sign to add a new connective there have been considered here: Grzegorozyk's logicGrz, the proof logicG and the proof-intuitionistic logicI set up correspondingly by the calculiFor any calculus we denote by the set of all formulae of the calculus and by the lattice of all logics that are the extensions of the logic of the calculus, i.e. sets of formulae containing the axioms (...) of and closed with respect to its rules of inference. In the logiclG the sign is decoded as follows: A = (A & A). The result of placing in the formulaA before each of its subformula is denoted byTrA. The maps are defined (in the definitions of x and the decoding of is meant), by virtue of which the diagram is constructed. (shrink)

In this paper we find an algebraic equivalent of the Hallden property in modal logics, namely, we prove that the Hallden-completeness in any normal modal logic is equivalent to the so-called super-embedding property of a suitable class of modal algebras. The joint embedding property of a class of algebras is equivalent to the Pseudo-Relevance Property. We consider connections of the above-mentioned properties with interpolation and amalgamation. Also an algebraic equivalent of of the principle of variable separation in superintuitionistic logics will (...) be found. (shrink)

We present our personal view on W.J. Blok's contribution to modal logic.

For (finitary) deductive systems, we formulate a signature‐independent abstraction of the weak excluded middle law (WEML), which strengthens the existing general notion of an inconsistency lemma (IL). Of special interest is the case where a quasivariety algebraizes a deductive system ⊢. We prove that, in this case, if ⊢ has a WEML (in the general sense) then every relatively subdirectly irreducible member of has a greatest proper ‐congruence; the converse holds if ⊢ has an inconsistency lemma. The result extends, in (...) a suitable form, to all protoalgebraic logics. A super‐intuitionistic logic possesses a WEML iff it extends. We characterize the IL and the WEML for normal modal logics and for relevance logics. A normal extension of has a global consequence relation with a WEML iff it extends, while every axiomatic extension of with an IL has a WEML. (shrink)

This paper is a survey of results concerning embeddings of intuitionistic propositional logic and its extensions into various classical modal systems.

This paper examines the logic of fictions within fictions. I argue that consistently nested consistent fictions must have certain formal characteristics. The most important is that they form a tree structure. Depending on one’s theory of fictional objects, additional constraints may apply regarding the appearance of a fictional object in two or more fictional universes. The background motivation for the paper is to use iterated fiction operators as a tool for making sense of iterated modal operators; I conclude by noting (...) briefly where the results about nested fictions can, and where they cannot, be extended to nested possible worlds. (shrink)

What an intuitionist may refer to with respect to a given epistemic state depends not only on that epistemic state itself but on whether it is viewed concurrently from within, in the hindsight of some later state, or ideally from a standpoint “beyond” all epistemic states (though the latter perspective is no longer strictly intuitionistic). Each of these three perspectives has a different—and, in the last two cases, a novel—logic and semantics. This paper explains these logics and their semantics and (...) provides soundness and completeness proofs. It provides, moreover, a critique of some common versions of Kripke semantics for intuitionistic logic and suggests ways of modifying them to take account of the perspective-relativity of reference. (shrink)