Modal and Intensional Logic

In this Dissertation, we examine a handful of related themes in the philosophy of logic and mathematics. We take as a starting point the deeply philosophical, and—as we argue, deeply Kantian—views of L.E.J. Brouwer, the founder of intuitionism. We examine his famous first act of intuitionism. Therein, he put forth both a critical and a constructive idea. This critical idea involved digging a philosophical rift between what he thought of himself as doing and what he thought of his contemporaries, specifically (...) Hilbert, as doing. He sought to completely separate mathematics from mathematical language, and thereby logic. In chapter 3, we examine the philosophical foundations for this separation. Artemov Artemov (2001) articulates what we might think of as constructive propositional reasoning in a formal system that augments classical propositional logic with a theory of proofs. In doing this, instead of using just one type of object to characterize constructive reasoning, he uses two; propositions and proofs. In chapter 4, we explore the extent to which it might make sense to think of classical propositional reasoning as instead a theory that has two types of objects in the Artemov style. In chapters 5 and 6, we examine two specific case studies; we look at two philosophical phenomena that admit of formal characterizations and then propose those. In both cases, we focus on predicate style treatments of modality. (shrink)

(Goodsell, Journal of Philosophical Logic, 51(1), 127-150 2022) establishes the noncontingency of sentences of first-order arithmetic, in a plausible higher-order modal logic. Here, the same result is derived using significantly weaker assumptions. Most notably, the assumption of rigid comprehension—that every property is coextensive with a modally rigid one—is weakened to the assumption that the Boolean algebra of properties under necessitation is countably complete. The results are generalized to extensions of the language of arithmetic, and are applied to answer a question (...) posed by Bacon and Dorr (2024). (shrink)

Brauer (2022) has recently argued that if it is possible that there is nothing, then the correct modal logic for metaphysical modality cannot include D. Here, I argue that Brauer’s argument is unsuccessful; or at the very least significantly weaker than presented. First, I outline a simple argument for why it is not possible that there is nothing. I note that this argument has a well-known solution involving the distinction between truth in and truth at a possible world. However, I (...) then argue that once the semantics presupposed by Brauer’s argument is reformulated in terms of truth at a world, we have good reasons to think that a crucial semantic premise in Brauer’s argument should be rejected in favour of an alternative. Brauer’s argument is, however, no longer valid with this alternative premise. Thus, plausibly Brauer’s argument against D is only valid, if it is not sound. (shrink)

Hyperlogic is a hyperintensional system designed to regiment metalogical claims (e.g., “Intuitionistic logic is correct” or “The law of excluded middle holds”) into the object language, including within embedded environments such as attitude reports and counterfactuals. This paper is the first of a two-part series exploring the logic of hyperlogic. This part presents a minimal logic of hyperlogic and proves its completeness. It consists of two interdefined axiomatic systems: one for classical consequence (truth preservation under a classical interpretation of the (...) connectives) and one for “universal” consequence (truth preservation under any interpretation). The sequel to this paper explores stronger logics that are sound and complete over various restricted classes of models as well as languages with hyperintensional operators. (shrink)

We introduce a modal expansion of paraconsistent Nelson logic that is also as a generalization of the Belnapian modal logic recently introduced by Odintsov and Wansing. We prove algebraic completeness theorems for both logics, defining and axiomatizing the corresponding algebraic semantics. We provide a representation for these algebras in terms of twiststructures, generalizing a known result on the representation of the algebraic counterpart of paraconsistent Nelson logic.

In proof-theoretic semantics, meaning is based on inference. It may be seen as the mathematical expression of the inferentialist interpretation of logic. Much recent work has focused on base-extension semantics, in which the validity of formulas is given by an inductive definition generated by provability in a ‘base’ of atomic rules. Base-extension semantics for classical and intuitionistic propositional logic have been explored by several authors. In this paper, we develop base-extension semantics for the classical propositional modal systems K, KT , (...) K4, and S4, with □ as the primary modal operator. We establish appropriate soundness and completeness theorems and establish the duality between □ and a natural presentation of ♢. We also show that our semantics is in its current form not complete with respect to euclidean modal logics. Our formulation makes essential use of relational structures on bases. (shrink)

Several philosophers including Kripke have contended that fictional entities do exist as abstract objects, and fictional names refer to such abstract entities. Kripke and Thomasson compare fictional entities to existing social entities. Kripke also reflects on fictions inside fictions to support his view. Many philosophers appeal to the apparent fact that we quantify over fictional entities. Such arguments in favor of the existence of fictional entities are critically scrutinized. It is argued that they are much less compelling than their proponents (...) suggest and involve various obscurities. (shrink)

In the substitutional framework, validity is truth under all substitutions of the nonlogical vocabulary. I develop a theory where □ is interpreted as substitutional validity. I show how to prove soundness and completeness for common modal calculi using this definition.

Some tools introduced by Linnebo to show that mathematical entities are thin objects can also be applied to non-mathematical entities, which have been thought to be thin as well for a variety of reasons. In this paper, I discuss some difficulties and opportunities concerning the application of abstraction and interpretational modalities to mereological sums. In particular, I show that on one hand some prima facie attractive candidates for the role of an explanatory plural abstraction principle for mereological sums (in terms (...) of pluralities of summed entities) are not really explanatory; on the other hand, singular abstraction principles (in terms of single summed entities) are materially inadequate. Nonetheless, explanatory criteria of identity and conditions of existence for mereological sums are provided by classical extensional mereology independent of abstraction principles. Thus, given classical extensional mereology, the reasons why, according to Linnebo, mathematical abstracted entities are thin also hold for mereological sums. Finally, I contend that interpretational modalities can be used to characterise the process by which a subject adds sums of previously admitted entities to the domain of quantification. (shrink)

Is a logicist bound to the claim that as a matter of analytic truth there is an actual infinity of objects? If Hume’s Principle is analytic then in the standard setting the answer appears to be yes. Hodes’s work pointed to a way out by offering a modal picture in which only a potential infinity was posited. However, this project was abandoned due to apparent failures of cross-world predication. We re-explore this idea and discover that in the setting of the (...) potential infinite one can interpret first-order Peano arithmetic, but not second-order Peano arithmetic. We conclude that in order for the logicist to weaken the metaphysically loaded claim of necessary actual infinities, they must also weaken the mathematics they recover. (shrink)

Tomis Kapitan’s work on Peirce’s conception of abduction was instrumental for our coming to see how Peircean abduction both relates to and is importantly different from inference to the best explanation (IBE). However, he ultimately concluded that Peirce’s conception of abduction was a muddle. Despite the deeply problematic nature of Peirce’s theory of abduction in these respects, Kapitan’s work on Peircean abduction offers insight into the nature of abductive inquiry that is importantly relevant to the task of making sense of (...) explanatory inquiry in the sciences in general. The view developed here stems from his work and involves disambiguating three forms of inference involved in Peircean abduction in terms of Reichenbach’s and Laudan’s context models of inquiry. Importantly, this includes understanding that abduction involves the context of pursuit. (shrink)

This is the second part of a two-part series on the logic of hyperlogic, a formal system for regimenting metalogical claims in the object language (even within embedded environments). Part A provided a minimal logic for hyperlogic that is sound and complete over the class of all models. In this part, we extend these completeness results to stronger logics that are sound and complete over restricted classes of models. We also investigate the logic of hyperlogic when the language is enriched (...) with hyperintensional operators such as counterfactual conditionals and belief operators. (shrink)

Rather than answering the question "What are possible worlds?", I wish to discuss what I think is a more tractable question, namely, "What what theoretical roles are possible worlds supposed to play, and are they cut out to play those roles?" The question is tractable because we can simply look and see to what purposes possible worlds have been put and whether possible worlds analyses have survived the test of time, or whether they have been succeeded by superior analyses which (...) either do away with worlds altogether or else demote them to a lesser role. In giving a partial answer to the question, we will begin by looking at traditional possible worlds analyses of intensional and modal concepts (§2). We will then look at three possible worlds analyses that have played an important role in their perceived success, viz. the analyses of (i) modality and possibilities in counterpart theory (§3), (ii) belief contents (§4), and (iii) conditionals (§5). (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.

What is the relation between metaphysical necessity and essence? This paper defends the view that the relation is one of identity: metaphysical necessity is a special case of essence. My argument consists in showing that the best joint theory of essence and metaphysical necessity is one in which metaphysical necessity is just a special case of essence. The argument is made against the backdrop of a novel, higher-order logic of essence, whose core features are introduced in the first part of (...) the paper. The second part investigates the relation between metaphysical necessity and essence in the context of HLE. Reductive hypotheses are among the most natural hypotheses to be explored in the context of HLE. But they also have to be weighed against their non-reductive rivals. I investigate three different reductive hypotheses and argue that two of them fare better than their non-reductive rivals: they are simpler, more natural, and more systematic. Specifically, I argue that one candidate reduction, according to which metaphysical necessity is truth in virtue of the nature of all propositions, is superior to the others, including one proposed by Kit Fine, according to which metaphysical necessity is truth in virtue of the nature of all objects. The paper concludes by offering some reasons to think that the best joint theory of essence and metaphysical necessity is one in which the logic of metaphysical necessity includes S4, but not S5. (shrink)

In classically based modal logic, there are three common conceptions of necessity, the universal conception, the equivalence relation conception, and the axiomatic conception. They provide distinct presentations of the modal logic S5, all of which coincide in the basic modal language. We explore these different conceptions in the context of the relevant logic R, demonstrating where they come apart. This reveals that there are many options for being an S5-ish extension of R. It further reveals a divide between the universal (...) conception of necessity on the one hand, and the axiomatic conception on the other: The latter is consistent with motivations for relevant logics while the former is not. For the committed relevant logician, necessity cannot be the truth in all possible worlds. (shrink)

Potentialists think that the concept of set is importantly modal. Using tensed language as an heuristic, the following bar-bones story introduces the idea of a potential hierarchy of sets: 'Always: for any sets that existed, there is a set whose members are exactly those sets; there are no other sets.' Surprisingly, this story already guarantees well-foundedness and persistence. Moreover, if we assume that time is linear, the ensuing modal set theory is almost definitionally equivalent with non-modal set theories; specifically, with (...) Level Theory, as developed in Part 1. (shrink)

Orthodoxy holds that there is a determinate fact of the matter about every arithmetical claim. Little argument has been supplied in favour of orthodoxy, and work of Field, Warren and Waxman, and others suggests that the presumption in its favour is unjustified. This paper supports orthodoxy by establishing the determinacy of arithmetic in a well-motivated modal plural logic. Recasting this result in higher-order logic reveals that even the nominalist who thinks that there are only finitely many things should think that (...) there is some sense in which arithmetic is true and determinate. (shrink)

There are many different ways to talk about the world. Some ways of talking are more expressive than others—that is, they enable us to say more things about the world. But what exactly does this mean? When is one language able to express more about the world than another? In my dissertation, I systematically investigate different ways of answering this question and develop a formal theory of expressive power, translation, and notational variance. In doing so, I show how these investigations (...) help to clarify the role that expressive power plays within debates in metaphysics, logic, and the philosophy of language. (shrink)

This essay is part of a larger project aimed at making sense of rational thought and agency as part of the natural world. It provides a semantic framework for thinking about the contents of: 1) descriptive thoughts and sentences having a representational or mind-to-world direction of fit, and which manifest our capacity for theoretical rationality; and 2) prescriptive and intentional sentences having an expressive or world-to-mind direction of fit, and which manifest our capacity for practical rationality. I use a modified (...) version of Allan Gibbard’s hyperstate semantics, employing both maximally determinate possible worlds and maximally determinate plans of action, as a basis for providing a unified understanding of moral judgments and expressions of individual and collective intentionality – they one and all give voice to our ability as rational agents to adopt the perspectives of various individuals within a community and consider how we would behave were we in their positions. In the course of spelling out the view I draw on and criticize ideas that Wilfrid Sellars advanced in the middle of the 20th century, while employing the tools of contemporary modal logic and model-theoretic semantics to give perspicuous formulation to his thought that the moral judgment ‘one ought to do A’ should be understood in terms of the collective intention ‘we shall do A’, where the pronoun denotes the unrestricted class of rational agents and the ‘ought’ is in some sense unconditionally binding. (shrink)

Sentences about logic are often used to show that certain embedding expressions are hyperintensional. Yet it is not clear how to regiment “logic talk” in the object language so that it can be compositionally embedded under such expressions. In this paper, I develop a formal system called hyperlogic that is designed to do just that. I provide a hyperintensional semantics for hyperlogic that doesn’t appeal to logically impossible worlds, as traditionally understood, but instead uses a shiftable parameter that determines the (...) interpretation of the logical connectives. I argue this semantics compares favorably to the more common impossible worlds semantics, which faces difficulties interpreting propositionally quantified logic talk. (shrink)

Part 1 [Hodes, 2021] “looked under the hood” of the familiar versions of the classical propositional modal logic K and its intuitionistic counterpart. This paper continues that project, addressing some familiar classical strengthenings of K and GL), and their intuitionistic counterparts. Section 9 associates two intuitionistic one-step proof-theoretic systems to each of the just mentioned intuitionistic logics, this by adding for each a new rule to those which generated IK in Part 1. For the systems associated with the intuitionistic counterparts (...) of D and T, these rules are “pure one-step”: their schematic formulations does not use □ or ♢. For the systems associated with the intuitionistic counterparts of K4, etc., these rules meet these conditions: neither □ nor ♢ is iterated; none use both □ and ♢. The join of the two systems associated with each of these familiar logics is the full one-step system for that intuitionistic logic. And further “blended” intuitionistic systems arise from joining these systems in various ways. Adding the 0-version of Excluded Middle to their intuitionistic counterparts yields the one-step systems corresponding to the familiar classical logics. Each proof-theoretic system defines a consequence relation in the obvious way. Section 10 examines inclusions between these consequence relations. Section 11 associates each of the above consequence relations with an appropriate class of models, and proves them sound with respect to their appropriate class. This allows proofs of some failures of inclusion between consequence relations. Section 12 proves that the each consequence relation is complete or weakly complete, that relative to its appropriate class of models. The Appendix presents three further results about some of the intuitionistic consequence relations discussed in the body of the paper. For Keywords, see Part 1. (shrink)

The terms “model” and “model-building” have been used to characterize the field of formal philosophy, to evaluate philosophy’s and philosophical logic’s progress and to define philosophical logic itself. A model is an idealization, in the sense of being a deliberate simplification of something relatively complex in which several important aspects are left aside, but also in the sense of being a view too perfect or excellent, not found in reality, of this thing. Paraconsistent logic is a branch of philosophical logic. (...) It is however not clear how paraconsistent logic can be seen as model-building. What exactly is modeled? In this paper I adopt the perspective of looking at a particular instance of paraconsistent logic—paranormal modal logic—which might be seen as a model of a specific kind of agent: inductive agents. After ntroducing what I call the highlevel and low-level models of inductive agents, I analyze the extent to which the above-mentioned idealizing features of model-building appear in paranormal modal logic and how they affect its philosophical significance. (shrink)

Inductively defined structures are ubiquitous in mathematics; their specification is unambiguous and their properties are powerful. All fields of mathematical logic feature these structures prominently: the formula of a language, the set of theorems, the natural numbers, the primitive recursive functions, the constructive number classes and segments of the cumulative hierarchy of sets. -/- This dissertation gives a mathematical characterization of a species of inductively defined structures, called accessible domains, which include all of the above examples except the set of (...) theorems. The concept of an accessible domain comes from Wilfried Sieg's analysis of proof-theoretic practices, starting with his dissertation. In particular, he noticed the special epistemological character of elements of an accessible domain: they can always be uniquely identified with their build-up. Generally, the unique build-up of elements justifies the principles of induction and recursion. -/- I use category theory to give an abstract characterization of accessible domains. I claim that accessible domains are all instances of initial algebras for endofunctors. Grounded in the historical roots of Sieg's discussions, this dissertation shows how the properties of initial algebras for endofunctors and accessible domains coincide in a satisfying and natural way. -/- Filling out this characterization, I show how important examples of accessible domains fit into this broad characterization. I first characterize some accessible domains by relatively simple functors (e.g. finite, polynomial, those that preserve certain colimits) where we can see how iterating the functor can produce the accessible domain. Then I describe accessible domains that result from more involved specifications (e.g. ordinals and segments of the cumulative hierarchies associated with CZF, IZF, and ZF) by relying heavily on algebraic set theory. I end with a discussion of some of the methodological features of category theory in particular that helped characterize accessible domains. (shrink)

This paper studies the relationship between labelled and nested calculi for propositional intuitionistic logic, first-order intuitionistic logic with non-constant domains and first-order intuitionistic logic with constant domains. It is shown that Fitting’s nested calculi naturally arise from their corresponding labelled calculi—for each of the aforementioned logics—via the elimination of structural rules in labelled derivations. The translational correspondence between the two types of systems is leveraged to show that the nested calculi inherit proof-theoretic properties from their associated labelled calculi, such as (...) completeness, invertibility of rules and cut admissibility. Since labelled calculi are easily obtained via a logic’s semantics, the method presented in this paper can be seen as one whereby refined versions of labelled calculi (containing nested calculi as fragments) with favourable properties are derived directly from a logic’s semantics. (shrink)

CAT4 is proposed as a general method for representing information, enabling a powerful programming method for large-scale information systems. It enables generalised machine learning, software automation and novel AI capabilities. This is Part 3 of a five-part introduction. The focus here is on explaining the semantic model for CAT4. Points in CAT4 graphs represent facts. We introduce all the formal (data) elements used in the classic semantic model: sense or intension (1st and 2nd joins), reference (3rd join), functions (4th join), (...) time and truth (logical fields), and symbolic content (name/value fields). Concepts are introduced through examples alternating with theoretical discussion. Some concepts are assumed from Part 1 and 2, but key ideas are re-introduced. The purpose is to explain the CAT4 interpretation, and why the data structure and CAT4 axioms have been chosen: to make the semantic model consistent and complete. We start with methods to translate information from database tables into graph DBs and into CAT4. We conclude with a method for translating natural language into CAT4. We conclude with a comparison of the system with an advanced semantic logic, the hyper-intensional logic TIL, which also aims to translate NL into a logical calculus. The CAT4 Natural Language Translator is discussed in further detail in Part 4, when we introduce functions more formally. Part 5 discusses software design considerations. (shrink)

The Free Choice effect—whereby \\) seems to entail both \ and \—has traditionally been characterized as a phenomenon affecting the deontic modal ‘may’. This paper presents an extension of the semantic account of free choice defended by Fusco to the agentive modal ‘can’, the ‘can’ which, intuitively, describes an agent’s powers. On this account, free choice is a nonspecific de re phenomenon that—unlike typical cases—affects disjunction. I begin by sketching a model of inexact ability, which grounds a modal approach to (...) agency in a Williamson -style margin of error. A classical propositional semantics combined with this framework can reflect the intuitions highlighted by Kenny ’s dartboard cases, as well as the counterexamples to simple conditional views recently discussed by Mandelkern et al.. In Section 3, I turn to an independently motivated actual-world-sensitive account of disjunction, and show how it extends free choice inferences into an object language for propositional modal logic. (shrink)

One’s involvement with the world seems limited merely to things as they are; hence, modal knowledge—knowledge of what could be or must be simpliciter—should be perplexing. Traditionally, the notion of conceivability has been regarded as crucial to an account of modal knowledge. I believe one has a good deal of such knowledge (though perhaps less than others presume one has). I maintain, however, that conceiving is utterly idle in acquiring modal knowledge: the conceivability of a proposition can provide no evidence (...) whatsoever that what it represents is possible. To show this, I first examine the basis of modal knowledge. I consider what conceivability in general is supposed to be and argue, in light of the preceding considerations, that conceivability is not epistemically efficacious, in the sense of providing evidence, on any proposed specific account. I then maintain that there could be no account of conceivability on which it is epistemically efficacious, that the very idea of the conceivability of a proposition being evidential is misguided. I conclude with some brief recommendations for pursuing a satisfactory modal epistemology. (shrink)

Why do we use epistemic modals like 'might'? According to Factualism, the function of 'might' is to exchange information about state-of-affairs in the modal universe. As an alternative to Factualism, this paper offers a game-theoretic rationale for epistemic possibility operators in a Bayesian setting. The background picture is one whereby communication facilitates coordination, but coordination could fail if there's too much uncertainty, since the players' ability to share a belief is undermined. However, 'might' and related expressions can be used to (...) reveal one's uncertainty, and exploit this to coordinate despite the lack of a common epistemic ground. The final result is a way to articulate a non-Factualist view of epistemic possibility modals that builds on their standard semantics. (shrink)

Scroggs's theorem on the extensions of S5 is an early landmark in the modern mathematical studies of modal logics. From it, we know that the lattice of normal extensions of S5 is isomorphic to the inverse order of the natural numbers with infinity and that all extensions of S5 are in fact normal. In this paper, we consider extending Scroggs's theorem to modal logics with propositional quantifiers governed by the axioms and rules analogous to the usual ones for ordinary quantifiers. (...) We call them Π-logics. Taking S5Π, the smallest normal Π-logic extending S5, as the natural counterpart to S5 in Scroggs's theorem, we show that all normal Π-logics extending S5Π are complete with respect to their complete simple S5 algebras, that they form a lattice that is isomorphic to the lattice of the open sets of the disjoint union of two copies of the one-point compactification of N, that they have arbitrarily high Turing-degrees, and that there are non-normal Π-logics extending S5Π. (shrink)

Weakly Aggregative Modal Logic (WAML) is a collection of disguised polyadic modal logics with n-ary modalities whose arguments are all the same. WAML has some interesting applications on epistemic logic and logic of games, so we study some basic model theoretical aspects of WAML in this paper. Specifically, we give a van Benthem-Rosen characterization theorem of WAML based on an intuitive notion of bisimulation and show that each basic WAML system Kn lacks Craig Interpolation.

A metaphysical system engendered by a third order quantified modal logic S5 plus impredicative comprehension principles is used to isolate a third order predicate D, and by being able to impredicatively take a second order predicate G to hold of an individual just if the individual necessarily has all second order properties which are D we in Section 2 derive the thesis (40) that all properties are D or some individual is G. In Section 3 theorems 1 to 3 suggest (...) a sufficient kinship to Gödelian ontological arguments so as to think of thesis (40) in terms of divine property and Godly being; divine replaces positive with Gödel and others. Thesis (40), the sacred thesis, supports the ontological argument that God exists because some property is not divine. In Section 4 a fixed point analysis is used as diagnosis so that atheists may settle for the minimal fixed point. Theorem 3 shows it consistent to postulate theistic fixed points, and a monotheistic result follows if one assumes theism and that it is divine to be identical with a deity. Theorem 4 (the Monotheorem) states that if Gg and it is divine to be identical with g, then necessarily all objects which are G are identical with g. The impredicative origin of D suggests weakened Gaunilo-like objections that offer related theses for other second order properties and their associated diverse presumptive individual bearers. Nevertheless, in the last section we finesse these Gaunilo-like objections by adopting what we call an apathiatheistic opinion which suggest that the best concepts `God’ allow thorough indifference as to whether God exists or not. (shrink)

A modal logic for representing analogical proportions is presented. This logic is a modal interpretation of H. Prade and G. Richard's homogeneous analogy. A tableaux system is given with some examples an intuitions.

STIT logic is a prominent framework for the analysis of multi-agent choice-making. In the available deontic extensions of STIT, the principle of Ought-implies-Can (OiC) fulfills a central role. However, in the philosophical literature a variety of alternative OiC interpretations have been proposed and discussed. This paper provides a modular framework for deontic STIT that accounts for a multitude of OiC readings. In particular, we discuss, compare, and formalize ten such readings. We provide sound and complete sequent-style calculi for all of (...) the various STIT logics accommodating these OiC principles. We formally analyze the resulting logics and discuss how the different OiC principles are logically related. In particular, we propose an endorsement principle describing which OiC readings logically commit one to other OiC readings. (shrink)

We present a number of modal logics to reason about group norms. As a preliminary step, we discuss the ontological status of the group to which the norms are applied, by adapting the classification made by Christian List of collective attitudes into aggregated, common, and corporate attitudes. Accordingly, we shall introduce modality to capture aggregated, common, and corporate group norms. We investigate then the principles for reasoning about those types of modalities. Finally, we discuss the relationship between group norms and (...) types of collective responsibility. (shrink)

Currently available systems of action deontic logic are not designed to model procedures to assess the conduct of an agent which take into account the intentions of the agent and the circumstances in which she is acting. Yet, procedures of this kind are essential to determine what counts as culpable not doing. In light of this, we design an action logic, AL, in which it is possible to distinguish actions that are objectively possible for an agent, viz. there are no (...) objective impediments for the agent to do them, and actions that, besides being objectively possible, are compatible with the setting or intentions of the agent. (shrink)

Priest has provided a simple tableau calculus for Chellas's conditional logic Ck. We provide rules which, when added to Priest's system, result in tableau calculi for Chellas's CK and Lewis's VC. Completeness of these tableaux, however, relies on the cut rule.

To the memory of Prof. Grigori Mints, Stanford UniversityBorn: June 7, 1939, St. Petersburg, RussiaDied: May 29, 2014, Palo Alto, California.

I introduce a formalization of probability which takes the concept of 'evidence' as primitive. In parallel to the intuitionistic conception of truth, in which 'proof' is primitive and an assertion A is judged to be true just in case there is a proof witnessing it, here 'evidence' is primitive and A is judged to be probable just in case there is evidence supporting it. I formalize this outlook by representing propositions as types in Martin-Lof type theory (MLTT) and defining a (...) 'probability type' on top of the existing machinery of MLTT, whose inhabitants represent pieces of evidence in favor of a proposition. One upshot of this approach is the potential for a mathematical formalism which treats 'conjectures' as mathematical objects in their own right. Other intuitive properties of evidence occur as theorems in this formalism. (shrink)

This article presents an overview of the basic philosophical motivations for, and some recent work in, modal set theory.

Possible worlds have found many applications in contemporary philosophy: from theories of possibility and necessity, to accounts of conditionals, to theories of mental and linguistic content, to understanding supervenience relationships, to theories of properties and propositions, among many other applications. Almost as soon as possible worlds started to be used in formal theories in logic, philosophy of language, philosophy of mind, metaphysics, and elsewhere, theorists started to wonder whether impossible worlds should be postulated as well. In many applications, possible worlds (...) face limitations that can be dealt with through postulating impossible worlds as well. This chapter examines some of the uses of impossible worlds, and philosophical challenges theories of impossible worlds face. (shrink)

1994.Επιστημολογία της Λογικής. Συγγραφέας Επαμεινώνδας Ξενόπουλος Μοναδική μελέτη και προσέγγιση της θεωρίας της γνώσης, για την παγκόσμια βιβλιογραφία, της διαλεκτικής πορείας της σκέψης από την λογική πλευρά της και της μελλοντικής μορφής που θα πάρουν οι διαλεκτικές δομές της, στην αδιαίρετη ενότητα γνωσιοθεωρίας, λογικής και διαλεκτικής, με την «μέθοδο του διαλεκτικού υλισμού». Έργο βαρύ με θέμα εξαιρετικά δύσκολο διακατέχεται από πρωτοτυπία και ζωντάνια που γοητεύει τον κάθε ανήσυχο στοχαστή από τις πρώτες γραμμές.

A new proof style adequate for modal logics is defined from the polynomial ring calculus. The new semantics not only expresses truth conditions of modal formulas by means of polynomials, but also permits to perform deductions through polynomial handling. This paper also investigates relationships among the PRC here defined, the algebraic semantics for modal logics, equational logics, the Dijkstra???Scholten equational-proof style, and rewriting systems. The method proposed is throughly exemplified for S 5, and can be easily extended to other modal (...) logics. (shrink)

ABSTRACT: This 1974 paper builds on our 1969 paper (Corcoran-Weaver [2]). Here we present three (modal, sentential) logics which may be thought of as partial systematizations of the semantic and deductive properties of a sentence operator which expresses certain kinds of necessity. The logical truths [sc. tautologies] of these three logics coincide with one another and with those of standard formalizations of Lewis's S5. These logics, when regarded as logistic systems (cf. Corcoran [1], p. 154), are seen to be equivalent; (...) but, when regarded as consequence systems (ibid., p. 157), one diverges from the others in a fashion which suggests that two standard measures of semantic complexity may not be as closely linked as previously thought. -/- This 1974 paper uses the linear notation for natural deduction presented in [2]: each two-dimensional deduction is represented by a unique one-dimensional string of characters. Thus obviating need for two-dimensional trees, tableaux, lists, and the like—thereby facilitating electronic communication of natural deductions. The 1969 paper presents a (modal, sentential) logic which may be thought of as a partial systematization of the semantic and deductive properties of a sentence operator which expresses certain kinds of necessity. The logical truths [sc. tautologies] of this logic coincides those of standard formalizations of Lewis’s S4. Among the paper's innovations is its treatment of modal logic in the setting of natural deduction systems--as opposed to axiomatic systems. The author’s apologize for the now obsolete terminology. For example, these papers speak of “a proof of a sentence from a set of premises” where today “a deduction of a sentence from a set of premises” would be preferable. 1. Corcoran, John. 1969. Three Logical Theories, Philosophy of Science 36, 153–77. J P R -/- 2. Corcoran, John and George Weaver. 1969. Logical Consequence in Modal Logic: Natural Deduction in S5 Notre Dame Journal of Formal Logic 10, 370–84. MR0249278 (40 #2524). 3. Weaver, George and John Corcoran. 1974. Logical Consequence in Modal Logic: Some Semantic Systems for S4, Notre Dame Journal of Formal Logic 15, 370–78. MR0351765 (50 #4253). (shrink)

In this work we propose an encoding of Reiter’s Situation Calculus solution to the frame problem into the framework of a simple multimodal logic of actions. In particular we present the modal counterpart of the regression technique. This gives us a theorem proving method for a relevant fragment of our modal logic.

The present text provides a logical theory which originated in the unification of a number of well-known philosophical logics as well as the introduction and study of new operators. Further M-logic contains an object theory. With both the logical part and the object part we achieve a formal calculus that is able to express many metaphysical dogmas.

We study a fragment of Intuitionistic Linear Logic combined with non-normal modal operators. Focusing on the minimal modal logic, we provide a Gentzen-style sequent calculus as well as a semantics in terms of Kripke resource models. We show that the proof theory is sound and complete with respect to the class of minimal Kripke resource models. We also show that the sequent calculus allows cut elimination. We put the logical framework to use by instantiating it as a logic of agency. (...) In particular, we apply it to reason about the resource-sensitive use of artefacts. (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)