Modal Logic

A brief overview of the system S5 in modal logic as defined by Brian F. Chellas, author of "Modal Logic: An Introduction." The history and usage of modal logic are given mention, along with some applications. Very much a draft. Written for PhileInSophia on July 5, 2021.

Possibility semantics offers an elegant framework for a semantic analysis of modal logic that does not recruit fully determinate entities such as possible worlds. The present papers considers the application of possibility semantics to the modeling of the indeterminacy of the future. Interesting theoretical problems arise in connection to the addition of object-language determinacy operator. We argue that adding a two-dimensional layer to possibility semantics can help solve these problems. The resulting system assigns to the two-dimensional determinacy operator a well-known (...) logic (coinciding with the logic of universal modalities under global consequence). The paper concludes with some preliminary inroads into the question of how to distinguish two-dimensional possibility semantics from the more established branching framework. (shrink)

This essay aims to provide a modal logic for rational intuition. Similarly to treatments of the property of knowledge in epistemic logic, I argue that rational intuition can be codified by a modal operator governed by the modal $\mu$-calculus. Via correspondence results between fixed point modal propositional logic and the bisimulation-invariant fragment of monadic second-order logic, a precise translation can then be provided between the notion of 'intuition-of', i.e., the cognitive phenomenal properties of thoughts, and the modal operators regimenting the (...) notion of 'intuition-that'. I argue that intuition-that can further be shown to entrain conceptual elucidation, by way of figuring as a dynamic-interpretational modality which induces the reinterpretation of both domains of quantification and the intensions and hyperintensions of mathematical concepts that are formalizable in monadic first- and second-order formal languages. Hyperintensionality is countenanced via a topic-sensitive epistemic two-dimensional truthmaker semantics. (shrink)

Cathoristic logic is a multi-modal logic where negation is replaced by a novel operator allowing the expression of incompatible sentences. We present the syntax and semantics of the logic including complete proof rules, and establish a number of results such as compactness, a semantic characterisa- tion of elementary equivalence, the existence of a quadratic-time decision pro- cedure, and Brandom’s incompatibility semantics property. We demonstrate the usefulness of the logic as a language for knowledge representation.

It is often assumed that pluralities are rigid, in the sense of having all and only their actual members necessarily. This assumption is operative in standard approaches to modal plural logic. I argue that a sceptical approach towards the assumption is warranted.

Ontological arguments like those of Gödel (1995) and Pruss (2009; 2012) rely on premises that initially seem plausible, but on closer scrutiny are not. The premises have modal import that is required for the arguments but is not immediately grasped on inspection, and which ultimately undermines the simpler logical intuitions that make the premises seem plausible. Furthermore, the notion of necessity that they involve goes unspecified, and yet must go beyond standard varieties of logical necessity. This leaves us little reason (...) to believe the premises, while their implausible existential import gives us good reason not to. (shrink)

The dogma that the propositional logic of metaphysical modality is S5 is rebutted in related installments (previously published and unpublished essays).

Two definitions of deduction are offered. The first is that deduction is an inference type that is both possibly valid and possibly invalid. No inference can satisfy this definition, because valid inferences are not possibly invalid and invalid inferences are not possibly valid. In the second definition, deduction is understood as an inference that aims for validity. This definition also has unwanted consequences, including the fact that invalid inferences are only deductive when they are thought to be possibly valid. If (...) the only genuine deductions are the valid ones, then our talk about deduction is an indirect and thoughtless way of referring to valid inferences rather than to an inference type. There is simply no deduction to speak off. Only valid inferences. (shrink)

Possible worlds are commonly seen as an interpretation of modal operators such as "possible" and "necessary". Here, we develop possible world semantics (PWS) which can be expressed in basic set theory and first-order logic, thus offering a reductionist account of modality. Specifically, worlds are understood as complete sets of statements and possible worlds are sets whose statements are consistent with a set of conceptual laws. We introduce the construction calculus (CC), a set of axioms and rules for truth, possibility, worldness (...) and consistency. We show that CC allows to prove fundamental theorems about necessity, possibility, impossibility and contigency, thus demonstrating prima-facie plausibility of PWS. Finally, we discuss the explanatory power of our approach and draw connections between our account and established philosophical conceptions of possible worlds. (shrink)

Some central epistemological notions are expressed by sentential operators O that entail the possibility of knowledge in the sense that 'Op' entails 'It is possible to know that p'. We call these modal-epistemological notions. Using apriority and being in a position to know as case studies, we argue that the logics of modal epistemological notions are extremely weak. In particular, their logics are not normal and do not include any closure principles.

These lecture notes were composed while teaching a class at Stanford and studying the work of Brian Chellas (Modal Logic: An Introduction, Cambridge: Cambridge University Press, 1980), Robert Goldblatt (Logics of Time and Computation, Stanford: CSLI, 1987), George Hughes and Max Cresswell (An Introduction to Modal Logic, London: Methuen, 1968; A Companion to Modal Logic, London: Methuen, 1984), and E. J. Lemmon (An Introduction to Modal Logic, Oxford: Blackwell, 1977). The Chellas text influenced me the most, though the order of (...) presentation is inspired more by Goldblatt.2 My goal was to write a text for dedicated undergraduates with no previous experience in modal logic. The text had to meet the following desiderata: (1) the level of difficulty should depend on how much the student tries to prove on his or her own—it should be an easy text for those who look up all the proofs in the appendix, yet more difficult for those who try to prove everything themselves; (2) philosophers (i.e., colleagues) with a basic training in logic should be able to work through the text on their own; (3) graduate students should find it useful in preparing for a graduate course in modal logic; (4) the text should prepare people for reading advanced texts in modal logic, such as Goldblatt, Chellas, Hughes and Cresswell, and van Benthem, and in particular, it should help the student to see what motivated the choices in these texts; (5) it should link the two conceptions of logic, namely, the conception of a logic as an axiom system (in which the set of theorems is constructed from the bottom up through proof sequences) and the conception of a logic as a set containing initial ‘axioms’ and closed under ‘rules of inference’ (in which the set of theorems is constructed from the top down, by carving out the logic from the set of all formulas as the smallest set closed under the rules); finally, (6) the pace for the presentation of the completeness theorems should be moderate—the text should be intermediate between Goldblatt and Chellas in this regard (in Goldblatt, the completeness proofs come too quickly for the undergraduate, whereas in Chellas, too many unrelated.... (shrink)

This paper is a study of a distinctively chemical notion of possibility. This is the notion of possibility that occurs in chemical discourses when chemists speak of the possibility or impossibility of achieving a given result through chemical means. This notion pertains to the possibility of processes, not of compounds, so it differs from the kind of chemical possibility mentioned in Wittgenstein's Philosophical Investigations or the kinds discussed in the literature on Putnam's Twin Earth argument. I argue that this process-oriented (...) notion of possibility cannot be reduced in a simple way to physical possibility, and that standard possible worlds semantics does not allow a natural analysis of this notion. I suggest an extension of possible worlds semantics that may overcome this limitation. I finish by pointing out some open questions about chemical possibility. (shrink)

We consider a modal language over crisp frames and formulas evaluated on a finite MTL-chain (a linearly ordered commutative integral residuated lattice). We first show that the basic modal abstract logic with constants for the values of the MTL-chain is the maximal abstract logic satisfying Compactness, the Tarski Union Property and strong invariance for bisimulations. Finally, we improve this result by replacing the Tarski Union Property by a relativization property.

We propose a model of unawareness that remains close to the paradigm of Aumann’s model for knowledge [R. J. Aumann, International Journal of Game Theory 28 (1999) 263-300]: just as Aumann uses a correspondence on a state space to define an agent’s knowledge operator on events, we use a correspondence on a state space to define an agent’s awareness operator on events. This is made possible by three ideas. First, like the model of [A. Heifetz, M. Meier, and B. Schipper, (...) Journal of Economic Theory 130 (2006) 78-94], ours is based on a space of partial specifications of the world, partially ordered by a relation of further specification or refinement, and the idea that agents may be aware of some coarser-grained specifications while unaware of some finer-grained specifications; however, our model is based on a different implementation of this idea, related to forcing in set theory. Second, we depart from a tradition in the literature, initiated by [S. Modica and A. Rustichini, Theory and Decision 37 (1994) 107- 124] and adopted by Heifetz et al. and [J. Li, Journal of Economic Theory 144 (2009) 977-993], of taking awareness to be definable in terms of knowledge. Third, we show that the negative conclusion of a well- known impossibility theorem concerning unawareness in [Dekel, Lipman, and Rustichini, Econometrica 66 (1998) 159-173] can be escaped by a slight weakening of a key axiom. Together these points demonstrate that a correspondence on a partial-state space is sufficient to model unawareness of events. Indeed, we prove a representation theorem showing that any abstract Boolean algebra equipped with awareness, knowledge, and belief operators satisfying some plausible axioms is representable as the algebra of events arising from a partial-state space with awareness, knowledge, and belief correspondences. (shrink)

We give a theory of epistemic modals in the framework of possibility semantics and axiomatize the corresponding logic, arguing that it aptly characterizes the ways in which reasoning with epistemic modals does, and does not, diverge from classical modal logic.

Fragmentalism allows incompatible facts to constitute reality in an absolute manner, provided that they fail to obtain together. In recent years, the view has been extensively discussed, with a focus on its formalisation in model-theoretic terms. This paper focuses on three formalisations: Lipman’s approach, the subvaluationist interpretation, and a novel view that has been so far overlooked. The aim of the paper is to explore the application of these formalisations to the alethic modal case. This logical exploration will allow us (...) to study (i) cases of metaphysical incompatibility between modal facts and (ii) cases of modal dialetheias. In turn, this will enrich our understanding of the role of impossibility in the fragmentalist framework. (shrink)

In this work, we illustrate applications of a semantic framework for non-congruential modal logic based on hyperintensional models. We start by discussing some philosophical ideas behind the approach; in particular, the difference between the set of possible worlds in which a formula is true (its intension) and the semantic content of a formula (its hyperintension), which is captured in a rigorous way in hyperintensional models. Next, we rigorously specify the approach and provide a fundamental completeness theorem. Moreover, we analyse examples (...) of non-congruential systems that can be semantically characterized within this framework in an elegant and modular way. Finally, we compare the proposed framework with some alternatives available in the literature. In the light of the results obtained, we argue that hyperintensional models constitute a basic, general and unifying semantic framework for (non-congruential) modal logic. (shrink)

In artificial intelligence (AI), responses generated by machine-learning models (most often large language models) may be unfactual information presented as a fact. For example, a chatbot might state that the Mona Lisa was painted in 1815. Such phenomenon is called AI hallucinations, seeking inspiration from human psychology, with a great difference of AI ones being connected to unjustified beliefs (that is, AI “beliefs”) rather than perceptual failures). -/- AI hallucinations may have their source in the data itself, that is, the (...) source content, or in the training procedure, i.e. the way the knowledge was encoded in the model’s parameters, so that errors in encoding and decoding textual and non-textual representations can cause hallucinations. In this paper, we will observe how such errors come to life and how they might be mitigated. For this purpose, we will analyze the usability of justification logics, to behave as a proof checker for validating the correctness of large language models’ (LLM) responses. Justification logic was developed by S. Artemov, and later on mostly by Artemov and M. Fitting, deriving its main idea from the logic of proofs (LP): knowledge and belief modalities are seen as justification terms, i.e. t:X stands for t is a (proper) justification for X. Justification logic originated from attempts to create semantics for intuitionistic logic where proofs were the most proper justifications, but in further development, justification logic could be applied to different kinds of justifications). With the recent attempts to mitigate incorrect LLM responses, we will analyze various guardrails that are currently used for LLM responses, and see how the logic of justification may provide its benefits as an AI safety layer against false data. (shrink)

In her recent book, Russell (2023) examines various so-called “barriers to entailment,” including Hume’s law, roughly the thesis that an ‘ought’ cannot be derived from an ‘is.’ Hume’s law bears an obvious resemblance to the proscription on fallacies of modality in relevance logic, which has traditionally formally been captured by the so-called Ackermann property. In the context of relevant modal logic, this property might be articulated thus: no conditional whose antecedent is box-free and whose consequent is box-prefixed is valid (for (...) the connection, interpret box deontically). While the deontic significance of Ackermann-like properties has been observed before, Russell’s new book suggests a more broad-scoped formal investigation of the relationship between barrier theses of various kinds and corresponding Ackermann-like properties. In this paper, I undertake such an investigation by elaborating a general relevant bimodal logical framework in which several of the barriers Russell examines can be given formal expression. I then consider various Ackermann-like properties corresponding to these barriers and prove that certain systems satisfy them. Finally, I respond to some objections Russell makes against the use of relevance logic to formulate Hume’s law and related barriers. (shrink)

Logic has pride of place in mathematics and its 20th century offshoot, computer science. Modern symbolic logic was developed, in part, as a way to provide a formal framework for mathematics: Frege, Peano, Whitehead and Russell, as well as Hilbert developed systems of logic to formalize mathematics. These systems were meant to serve either as themselves foundational, or at least as formal analogs of mathematical reasoning amenable to mathematical study, e.g., in Hilbert’s consistency program. Similar efforts continue, but have been (...) expanded by the development of sophisticated methods to study the properties of such systems using proof and model theory. In parallel with this evolution of logical formalisms as tools for articulating mathematical theories (broadly speaking), much progress has been made in the quest for a mechanization of logical inference and the investigation of its theoretical limits, culminating recently in the development of new foundational frameworks for mathematics with sophisticated computer-assisted proof systems. In addition, logical formalisms developed by logicians in mathematical and philosophical contexts have proved immensely useful in describing theories and systems of interest to computer scientists, and to some degree, vice versa. Three examples of the influence of logic in computer science are automated reasoning, computer verification, and type systems for programming languages. (shrink)

Lampert and Waldrop have recently presented a puzzle about moral responsibility and logical truth, in which they derive a contradiction from three apparently plausible principles: (A) no one is responsible for any logical truth; (B) if no one is responsible for something, then no one is responsible for what it strictly implies; and (C) someone is responsible for something. They argue that, in response, we must give up (B)—a principle that plays a key role in arguments for incompatibilism. In this (...) paper, I argue that this response is mistaken, and that the lesson to be drawn lies elsewhere. For the puzzle also rests on a conception of logical truth according to which there are contingent logical truths. And, given this conception, (A) is false—for reasons independent of (B). So the import here concerns, not a connection between responsibility and the debate over incompatibilism, but a connection between responsibility and the debate over the correct conception of logical truth: one can hold on to (A), or hold on to the relevant conception of logical truth, but not both. (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)

Prior to Kripke’s seminal work on the semantics of modal logic, McKinsey offered an alternative interpretation of the necessity operator, inspired by the Bolzano–Tarski notion of logical truth. According to this interpretation, ‘it is necessary that A’ is true just in case every sentence with the same logical form as A is true. In our paper, we investigate this interpretation of the modal operator, resolving some technical questions, and relating it to the logical interpretation of modality and some views in (...) modal metaphysics. In particular, we present an hitherto unpublished solution to problems 41 and 42 from Friedman’s 102 problems, which uses a different method of proof from the solution presented in the paper of Tadeusz Prucnal. (shrink)

Saul Kripke’s work on the semantics of modal logics is well known, unlike his work on Anderson and Belnap’s system E of Entailment (a modal relevance logic), which included his proof of the decidability of its implicational fragment E_>, and also a counterexample to the conjecture of Belnap that E_> is the intersection of the implicational fragments of the relevance logic R and the modal logic S4. This led to Storrs McCall’s suggesting that the “mingle” axiom might be added to (...) E_>, and that this system might be used instead of S4_>. We give a counterexample to this conjecture. We also disprove the conjecture Anderson and Belnap attribute to McCall, in which “restricted mingle” is added to E_>. We use a modal extension of the lattice M_0 and follow ideas of Meyer. In the 1970s, Dunn showed that RM (R with the mingle axiom) can be modeled using a binary accessibility relation, like the accessibility relation in Kripke’s semantics for normal modal logics and his semantics for intuitionistic logic. Dunn also gave a variant interpretation for EM (E with the mingle axiom). We explore some other variations of these binary relational semantics. (shrink)

Since ancient times, philosophers have recognised that truth comes in many 'modes', so that a proposition can be not only true or false, but also, for example, 'necessary' or 'possible'. These ideas led to the modern field of modal logic, a lively area of research at the interface of philosophy, mathematics and computer science. -/- Nowadays, the term 'modal logic' is understood in a broad sense, allowing it to encompass logics for reasoning about seemingly unrelated phenomena such as knowledge, obligations, (...) time, space, and proofs, among many others. Contemporary research in modal logic draws on techniques from many disciplines, including complexity theory, combinatorics, universal algebra, category theory, topology, and proof theory. -/- These proceedings record the papers presented at Advances in Modal Logic 2024, the 15th in a series of biennial conferences that aim to report on important new developments in pure and applied modal logic. Topics in this issue include epistemic modal logic, constructive and many-valued modal logic, unification, alge aic and neighbourhood semantics, proof theory and complexity of modal logics, conditional and quantified modal logic. (shrink)

Some philosophers advance the claim that the phenomena of logical omniscience and of the indiscernibility of metaphysical statements, which arise in (certain) interpretations of normal modal logic, provide strong reasons in favour of impossible world approaches. These two specific lines of argument will be presented and discussed in this paper. Contrary to the recent much-held view that the characteristics of these two phenomena provide us with strong reasons to adopt impossible world approaches, the view defended here is that no such (...) ‘knock-down arguments’ do emanate on those grounds. This is not to rule out that there cannot be any other good reasons for assuming impossible world semantics. However, the discussion of a further argument for impossible worlds will suggest that different attempts to argue for them likely present intertwined problems. (shrink)

Propositional modal logic over relational frames is naturally extended with propositional quantifiers by letting them range over arbitrary sets of worlds of the relevant frame. This is also known as second-order propositional modal logic. The propositionally quantified modal logic of a class of relational frames is often not axiomatizable, although there are known exceptions, most notably the case of frames validating the strong modal logic $\mathrm {S5}$. Here, we develop new general methods with which many of the open questions in (...) this area can be answered. We illustrate the usefulness of these methods by applying them to a range of examples, which provide a detailed picture of which normal modal logics define classes of relational frames whose propositionally quantified modal logic is axiomatizable. We also apply these methods to establish new results in the multimodal case. (shrink)

Propositional quantifiers are quantifiers binding proposition letters, understood as variables. This Element introduces propositional quantifiers and explains why they are especially interesting in the context of propositional modal logics. It surveys the main results on propositionally quantified modal logics which have been obtained in the literature, presents a number of open questions, and provides examples of applications of such logics to philosophical problems.

We present tableau proof systems for the annotated version of propositional justification logics, that is, justification logics which are formulated using annotated application operators. We show that the tableau systems are sound and complete with respect to Mkrtychev models, and some tableau systems are analytic and provide a decision procedure for the annotated justification logics. We further show Craig’s interpolation property and Beth’s definability theorem for some annotated justification logics.

Divers argued that there are modal truths that are inconvenient for the canonical Lewisian theory of modality. Noonan and Jago proposed an answer to the challenge, by invoking a duplicate interpretation of the modal truths. Here, I present a slightly different kind of modal truth that would prove inconvenient even for a Lewisian who accepts Noonan and Jago's proposal.

Non-classical generalizations of classical modal logic have been developed in the contexts of constructive mathematics and natural language semantics. In this paper, we discuss a general approach to the semantics of non-classical modal logics via algebraic representation theorems. We begin with complete lattices L equipped with an antitone operation ¬ sending 1 to 0, a completely multiplicative operation ◻, and a completely additive operation ◊. Such lattice expansions can be represented by means of a set X together with binary relations (...) ⊲, R, and Q, satisfying some first-order conditions, used to represent (L,¬), ◻, and ◊, respectively. Indeed, any lattice L equipped with such a ¬, a multiplicative ◻, and an additive ◊ embeds into the lattice of propositions of a frame (X,⊲,R,Q). Building on our recent study of "fundamental logic", we focus on the case where ¬ is dually self-adjoint (a≤¬b implies b≤¬a) and ◊¬a≤¬◻a. In this case, the representations can be constrained so that R=Q, i.e., we need only add a single relation to (X,⊲) to represent both ◻ and ◊. Using these results, we prove that a system of fundamental modal logic is sound and complete with respect to an elementary class of bi-relational structures (X,⊲,R). (shrink)

Rumfitt has given two arguments that in unilateralist verificationist theories of meaning, truth collapses into correct assertibility. In the present paper I give similar arguments that show that in unilateral falsificationist theories of meaning, falsehood collapses into correct deniability. According to bilateralism, meanings are determined by assertion and denial conditions, so the question arises whether it succumbs to similar arguments. I show that this is not the case. The final section considers the question whether a principle central to Rumfitt's first (...) argument, ‘It is assertible that if and only if it is assertible that it is assertible that ’, is one that bilateralists can reject, and concludes that they cannot. It follows that the logic of assertibility and deniability, according to a result by Williamson, is the little known modal logic K4 studied by Sobociński. The paper ends with a plaidoyer for bilateralists to adopt this logic. (shrink)

This paper presents an overview of the methods of nested sequents or tree-hypersequents that were originally introduced to provide a comprehensive proof theory for modal logic. The paper retraces the history of how these methods have developed. Its aim is also to present, in an unified and harmonious way, the most recent results that have been obtained in this framework. These results encompass several technical achievements, such as the interpolation theorem and the construction of countermodels. Special emphasis is also given (...) to the application to logics other than the standard modal ones as well as to relations to other proof theoretic formalisms. (shrink)

In Kantian philosophy, the term “condition of possibility” is central, but carries the following ambiguity. According to one reading, “condition of possibility” merely means “necessary condition”. However, it is demonstrated that a deeper interpretation of the term “possibility” proves to be more fruitful. This reading allows us to reconstruct an important background assumption of Kant: Every condition of the possibility of experience holds necessarily, provided that experience is possible. Or more generally: All conditions of the possibility hold necessarily as long (...) as the conditioned is actually possible. -/- This conclusion is understood through the axiomatic system S5. Therefore I argue by referencing the schematism chapter that Kant’s notion of modal terms can be formalized through S5. (shrink)

Ever since antiquity, attempts have been made at defining knowledge through belief augmented by additional properties such as truth and justification. These characterizations have been challenged by Gettier counterexamples and their variants. A modern proposal, what is known as defeasibility theory, characterizes knowledge through stability under revision of beliefs on the basis of true or arbitrary information. A formal investigation of such a proposal calls for the methods of dynamic epistemic logic: well developed semantic approaches to dynamic epistemic logic have (...) been given through the plausibility models, but a corresponding proof theory is still in its infancy. We shall recast plausibility models in terms of more general neighbourhood models and develop on their basis complete proof systems. An inferential treatment of epistemic and doxastic notions such as safe belief will give a new way to study their relationships; among these, the characterization of knowledge as belief stable under arbitrary revision will be grounded through formal labelled sequent calculus derivations. (shrink)

A consequence relation is strongly classical if it has all the theorems and entailments of classical logic as well as the usual meta-rules (such as Conditional Proof). A consequence relation is weakly classical if it has all the theorems and entailments of classical logic but lacks the usual meta-rules. The most familiar example of a weakly classical consequence relation comes from a simple supervaluational approach to modelling vague language. This approach is formally equivalent to an account of logical consequence according (...) to which α1, ..., αn entails β just in case □α1, ..., □αn entails □β in the modal logic S5. This raises a natural question: If we start with a different underlying modal logic, can we generate a strongly classical logic? This paper explores this question. In particular, it discusses four related technical issues: (1) Which base modal logics generate strongly classical logics and which generate weakly classical logics? (2) Which base logics generate themselves? (3) How can we directly characterize the logic generated from a given base logic? (4) Given a logic that can be generated, which base logics generate it? The answers to these questions have philosophical interest. They can help us to determine whether there is a plausible supervaluational approach to modelling vague language that yields the usual meta-rules. They can also help us to determine the feasibility of other philosophical projects that rely on an analogous formalism, such as the project of defining logical consequence in terms of the preservation of an epistemic status. (shrink)

Charles Peirce developed Existential Graphs as a diagrammatic syntax for representing and reasoning about propositions, with three parts: Alpha for propositional logic, Beta for first-order predicate logic, and Gamma for aspects of modal logic, second-order logic, and metalanguage. He made several adjustments between 1909 and 1911 that merit further consideration: using heavy lines to denote possible states of things in which attached propositions would be true, drawing a red line just inside the edge of a page and writing postulates in (...) the resulting margin, shading oddly enclosed areas instead of drawing thin lines as their boundaries, and using multiple sheets of paper to represent different subjects within the overall universe of discourse. These modifications can be combined to constitute a plausible candidate for Delta, a fourth part that Peirce intended to add but never spelled out. It implements modern formal systems of modal propositional logic in accordance with a version of possible worlds semantics in which the laws for the actual state of things are facts in every possible state of things. (shrink)

Este artigo explora o uso de metodologias lúdicas, como gamificação e narrativas, para tornar o ensino de Lógica mais dinâmico e acessível no Ensino Médio. Através de enigmas como os do tipo Cavaleiros e Patifes, abordam-se tanto a lógica proposicional clássica quanto as não-clássicas (notadamente, as lógicas paraconsistentes e modal),proporcionando um aprendizado ativo e colaborativo. O artigo oferece ferramentas práticas para educadores, com ênfase no desenvolvimento de competências críticas e na criação de um ambiente inclusivo, acessível a todos os alunos.

In this chapter, I present a systematic study of theories of entailment as developed in relevant modal logics of varying strength. I consider several relevant normal modal logics and the properties of entailment, as defined as necessitated relevant implication, in these systems. Fine-Urquhart style semantics are provided for these relevant modal logics and proofs of soundness and completeness are given. The semantics is used to prove admissibility results for certain weak relevant modal theories. Connections between some of these relevant modal (...) logics and preexisting theories of entailment are pointed out. (shrink)

In this short intellectual biography, we chronicle Saul Kripke’s involvement in the development of modal logic, focusing on the decade beginning in 1953 and ending in 1963, during which time he ranged in age from 12 to 23. We also describe the state of modal logic before Kripke, Kripke’s correspondence with other modal logicians, and Kripke’s early influential publications on the semantics of modal logic as well as several later and lesser known contributions.

This edited volume brings together papers by both eminent and rising scholars to celebrate Saul Kripke’s singular contributions to modal logic. Kripke’s work on modal logic helped usher in a new semantic epoch for the field and made facility with modal logic indispensable not only to technically oriented philosophers but to theoretical computer scientists and others as well. This volume features previously unpublished work of Kripke’s as well as a brief intellectual biography recounting the story of how Kripke became interested (...) in, and made his first contributions to, modal logic. However, the majority of the volume’s contributions are forward-looking, and produce new philosophical and technical insights by engaging with ideas tracing back to Kripke. (shrink)

We present a simplification and a modification of a method introduced by Herzig to prove the decidability of Quine’s ordered fragment of first-order logic. The method consists in an interpretation of quantifiers as modal operators. We show that our modification yields the decidability of two new ordered fragments of first-order logic, called the grooved fragment and the loosely grooved fragment, whose expressive power lies between Quine’s ordered fragment and the fluted fragment.

A fundamental question asked in modal logic is whether a given theory is consistent. But consistent with what? A typical way to address this question identifies a choice of background knowledge axioms (say, S4, D, etc.) and then shows the assumptions codified by the theory in question to be consistent with those background axioms. But determining the specific choice and division of background axioms is, at least sometimes, little more than tradition. This paper introduces generic theories for propositional modal logic (...) to address consistency results in a more robust way. As building blocks for background knowledge, generic theories provide a standard for categorical determinations of consistency. We argue that the results and methods of this paper help to elucidate problems in epistemology and enjoy sufficient scope and power to have purchase on problems bearing on modalities in judgement, inference, and decision making. (shrink)

Classical theists hold that God is omnipotent. But now suppose a critical atheologian were to ask: Can God create a stone so heavy that even he cannot lift it? This is the dilemma of the stone paradox. God either can or cannot create such a stone. Suppose that God can create it. Then there's something he cannot do – namely, lift the stone. Suppose that God cannot create the stone. Then, again, there's something he cannot do – namely, create it. (...) Either way, God cannot be omnipotent. Among the variety of known theological paradoxes, the paradox of the stone is especially troubling because of its logical purity. It purports to show that one cannot believe in both God and the laws of logic. In the face of the stone paradox, how should the contemporary analytic theist respond? Ought they to revise their belief in theology or their belief in logic? Ought they to lose their religion or lose their mind? (shrink)

Havstad (2022) argues that the argument from inductive risk for the claim that non-epistemic values have a legitimate role to play in the internal stages of science is deductively valid. She also defends its premises and thus soundness. This is, as far as we are aware, the best reconstruction of the argument from inductive risk in the existing literature. However, there is a small flaw in this reconstruction of the argument from inductive risk which appears to render the argument invalid. (...) This flaw is superficial, and a small amendment to it rescues the claim of validity. (shrink)

O problema lógico do mal é a alegação de que a existência de Deus e a existência de mal no mundo são logicamente inconsistentes. Neste artigo, descrevemos o sistema N3, baseado em partes na contribuição de Nieznański (2007, 2008), que oferece uma resposta ao problema lógico do mal através da refutação de uma versão do determinismo religioso. Argumentamos especificamente que, dados os resultados de N3, a existência de Deus não é contraditória com a do mal, e portanto, o teísmo clássico (...) não pode ser considerado irracional com base no problema lógico do mal. Nossa abordagem pode ser considerada um caso de lógica da religião, ou seja, de lógica aplicada ao discurso religioso. (shrink)