scholarly journals COMPLETENESS OF SECOND-ORDER PROPOSITIONAL S4 AND H IN TOPOLOGICAL SEMANTICS

2018 ◽  
Vol 11 (3) ◽  
pp. 507-518
Author(s):  
PHILIP KREMER
Keyword(s):  
Modal Logic ◽  
Intuitionistic Logic ◽  
Second Order ◽  
Topological Semantics ◽  
First Order ◽  
Propositional Modal Logic ◽  
Propositional Quantifiers ◽  
Modal Logic S4 ◽  
Natural Way

AbstractWe add propositional quantifiers to the propositional modal logic S4 and to the propositional intuitionistic logic H, introducing axiom schemes that are the natural analogs to axiom schemes typically used for first-order quantifiers in classical and intuitionistic logic. We show that the resulting logics are sound and complete for a topological semantics extending, in a natural way, the topological semantics for S4 and for H.

QUANTIFIED MODAL LOGIC ON THE RATIONAL LINE

2014 ◽  
Vol 7 (3) ◽  
pp. 439-454 ◽  
Author(s):  
PHILIP KREMER
Keyword(s):  
Modal Logic ◽  
Real Line ◽  
Topological Spaces ◽  
Topological Semantics ◽  
Cantor Space ◽  
Quantified Modal Logic ◽  
Propositional Modal Logic ◽  
The Family ◽  
Modal Logic S4 ◽  
Rational Line

AbstractIn the topological semantics for propositional modal logic, S4 is known to be complete for the class of all topological spaces, for the rational line, for Cantor space, and for the real line. In the topological semantics for quantified modal logic, QS4 is known to be complete for the class of all topological spaces, and for the family of subspaces of the irrational line. The main result of the current paper is that QS4 is complete, indeed strongly complete, for the rational line.

Categories and Modalities

2018 ◽  
Author(s):  
Kohei Kishida
Keyword(s):  
Modal Logic ◽  
Category Theory ◽  
Kripke Semantics ◽  
Counterpart Theory ◽  
Stone Duality ◽  
Topological Semantics ◽  
First Order ◽  
Propositional Modal Logic ◽  
First Order Modal Logic

Category theory provides various guiding principles for modal logic and its semantic modeling. In particular, Stone duality, or “syntax-semantics duality”, has been a prominent theme in semantics of modal logic since the early days of modern modal logic. This chapter focuses on duality and a few other categorical principles, and brings to light how they underlie a variety of concepts, constructions, and facts in philosophical applications as well as the model theory of modal logic. In the first half of the chapter, I review the syntax-semantics duality and illustrate some of its functions in Kripke semantics and topological semantics for propositional modal logic. In the second half, taking Kripke’s semantics for quantified modal logic and David Lewis’s counterpart theory as examples, I demonstrate how we can dissect and analyze assumptions behind different semantics for first-order modal logic from a structural and unifying perspective of category theory. (As an example, I give an analysis of the import of the converse Barcan formula that goes farther than just “increasing domains”.) It will be made clear that categorical principles play essential roles behind the interaction between logic, semantics, and ontology, and that category theory provides powerful methods that help us both mathematically and philosophically in the investigation of modal logic.

scholarly journals Higher-Order Illative Combinatory Logic

2013 ◽  
Vol 78 (3) ◽  
pp. 837-872 ◽  
Author(s):  
Łukasz Czajka
Keyword(s):  
Strong Consistency ◽  
Predicate Logic ◽  
Higher Order ◽  
Second Order ◽  
Model Construction ◽  
Partial Answer ◽  
Combinatory Logic ◽  
First Order ◽  
Propositional Quantifiers

AbstractWe show a model construction for a system of higher-order illative combinatory logic thus establishing its strong consistency. We also use a variant of this construction to provide a complete embedding of first-order intuitionistic predicate logic with second-order propositional quantifiers into the system of Barendregt, Bunder and Dekkers, which gives a partial answer to a question posed by these authors.

First-order definability in modal logic

1975 ◽  
Vol 40 (1) ◽  
pp. 35-40 ◽  
Author(s):  
R. I. Goldblatt
Keyword(s):  
Modal Logic ◽  
Binary Relation ◽  
Second Order ◽  
Order Conditions ◽  
Kripke Models ◽  
Order Condition ◽  
First Order ◽  
Axiom Systems ◽  
Set Of Points ◽  
First Order Definability

In the early days of the development of Kripke-style semantics for modal logic a great deal of effort was devoted to showing that particular axiom systems were characterised by a class of models describable by a first-order condition on a binary relation. For a time the approach seemed all encompassing, but recent work by Thomason [6] and Fine [2] has shown it to be somewhat limited—there are logics not determined by any class of Kripke models at all. In fact it now seems that modal logic is basically second-order in nature, in that any system may be analysed in terms of structures having a nominated class of second-order individuals (subsets) that serve as interpretations of propositional variables (cf. [7]). The question has thus arisen as to how much of modal logic can be handled in a first-order way, and precisely which modal sentences are determined by first-order conditions on their models. In this paper we present a model-theoretic characterisation of this class of sentences, and show that it does not include the much discussed LMp → MLp.Definition 1. A modal frame ℱ = 〈W, R〉 consists of a set W on which a binary relation R is defined. A valuation V on ℱ is a function that associates with each propositional variable p a subset V(p) of W (the set of points at which p is “true”).

scholarly journals Arithmetic Formulated Relevantly

2021 ◽  
Vol 18 (5) ◽  
pp. 154-288
Author(s):  
Robert Meyer
Keyword(s):  
Intuitionistic Logic ◽  
Natural Deduction ◽  
Relevant Logic ◽  
Peano Arithmetic ◽  
Critical Problem ◽  
First Order ◽  
Order Form ◽  
Relevant Implication ◽  
Relevant Logics ◽  
Natural Way

The purpose of this paper is to formulate first-order Peano arithmetic within the resources of relevant logic, and to demonstrate certain properties of the system thus formulated. Striking among these properties are the facts that (1) it is trivial that relevant arithmetic is absolutely consistent, but (2) classical first-order Peano arithmetic is straightforwardly contained in relevant arithmetic. Under (1), I shall show in particular that 0 = 1 is a non-theorem of relevant arithmetic; this, of course, is exactly the formula whose unprovability was sought in the Hilbert program for proving arithmetic consistent. Under (2), I shall exhibit the requisite translation, drawing some Goedelian conclusions therefrom. Left open, however, is the critical problem whether Ackermann’s rule γ is admissible for theories of relevant arithmetic. The particular system of relevant Peano arithmetic featured in this paper shall be called R♯. Its logical base shall be the system R of relevant implication, taken in its first-order form RQ. Among other Peano arithmetics we shall consider here in particular the systems C♯, J♯, and RM3♯; these are based respectively on the classical logic C, the intuitionistic logic J, and the Sobocinski-Dunn semi-relevant logic RM3. And another feature of the paper will be the presentation of a system of natural deduction for R♯, along lines valid for first-order relevant theories in general. This formulation of R♯ makes it possible to construct relevantly valid arithmetical deductions in an easy and natural way; it is based on, but is in some respects more convenient than, the natural deduction formulations for relevant logics developed by Anderson and Belnap in Entailment.

COMBINING TERM REWRITING AND TYPE ASSIGNMENT SYSTEMS

1990 ◽  
Vol 01 (03) ◽  
pp. 165-184 ◽  
Author(s):  
FRANCO BARBANERA
Keyword(s):  
Term Rewriting ◽  
Second Order ◽  
Term Rewriting Systems ◽  
Strong Normalization ◽  
First Order ◽  
Rewriting Systems ◽  
Type Assignment ◽  
Natural Way

Recently some attention has been paid to the properties enjoyed by combinations of term rewriting and λ-calculus based systems. In this paper strong normalization and confluence are proved for λ-terms obtained by merging pure λ-terms and first order canonical term rewriting systems, in the framework of a system which extends the Coppo-Dezani intersection type assignment system. On terms of the resulting calculus we can perform ordinary β and η reductions, as well as the reductions induced in a natural way by the term rewriting systems. In some parts of our analysis we follow rather closely the development contained in a recent paper by Val Breazu-Tannen and Jean Gallier. There, the same properties of strong normalization and confluence are proved for systems obtained by combining the second order polymorphic λ-calculus with first order canonical term rewriting systems. The strong normalization result of Breazu-Tannen and Gallier is proved to be implied by the corresponding property of our system.

scholarly journals The Expressive Power of Second-Order Propositional Modal Logic

1996 ◽  
Vol 37 (1) ◽  
pp. 35-43 ◽  
Author(s):  
Michael Kaminski ◽  
Michael Tiomkin
Keyword(s):  
Modal Logic ◽  
Expressive Power ◽  
Second Order ◽  
Propositional Modal Logic

scholarly journals FIRST-ORDER POSSIBILITY MODELS AND FINITARY COMPLETENESS PROOFS

2019 ◽  
Vol 12 (4) ◽  
pp. 637-662
Author(s):  
MATTHEW HARRISON-TRAINOR
Keyword(s):  
Modal Logic ◽  
Possible Worlds ◽  
Canonical Model ◽  
Model Construction ◽  
Completeness Proof ◽  
Quantified Modal Logic ◽  
First Order ◽  
Propositional Modal Logic ◽  
Computable Set ◽  
Order Case

AbstractThis article builds on Humberstone’s idea of defining models of propositional modal logic where total possible worlds are replaced by partial possibilities. We follow a suggestion of Humberstone by introducing possibility models for quantified modal logic. We show that a simple quantified modal logic is sound and complete for our semantics. Although Holliday showed that for many propositional modal logics, it is possible to give a completeness proof using a canonical model construction where every possibility consists of finitely many formulas, we show that this is impossible to do in the first-order case. However, one can still construct a canonical model where every possibility consists of a computable set of formulas and thus still of finitely much information.

Sign in / Sign up

Export Citation Format

Share Document