12 research outputs found

    Nested Sequents for Quantified Modal Logics

    Full text link
    This paper studies nested sequents for quantified modal logics. In particular, it considers extensions of the propositional modal logics definable by the axioms D, T, B, 4, and 5 with varying, increasing, decreasing, and constant domains. Each calculus is proved to have good structural properties: weakening and contraction are height-preserving admissible and cut is (syntactically) admissible. Each calculus is shown to be equivalent to the corresponding axiomatic system and, thus, to be sound and complete. Finally, it is argued that the calculi are internal -- i.e., each sequent has a formula interpretation -- whenever the existence predicate is expressible in the language.Comment: accepted to TABLEAUX 202

    Nested Sequents for Quantified Modal Logics

    Get PDF
    This paper studies nested sequents for quantified modal logics. In particular, it considers extensions of the propositional modal logics definable by the axioms D, T, B, 4, and 5 with varying, increasing, decreasing, and constant domains. Each calculus is proved to have good structural properties: weakening and contraction are height-preserving admissible and cut is (syntactically) admissible. Each calculus is shown to be equivalent to the corresponding axiomatic system and, thus, to be sound and complete. Finally, it is argued that the calculi are internal—i.e., each sequent has a formula interpretation—whenever the existence predicate is expressible in the language

    One-Variable Fragments of First-Order Many-Valued Logics

    Get PDF
    In this thesis we study one-variable fragments of first-order logics. Such a one-variable fragment consists of those first-order formulas that contain only unary predicates and a single variable. These fragments can be viewed from a modal perspective by replacing the universal and existential quantifier with a box and diamond modality, respectively, and the unary predicates with corresponding propositional variables. Under this correspondence, the one-variable fragment of first-order classical logic famously corresponds to the modal logic S5. This thesis explores some such correspondences between first-order and modal logics. Firstly, we study first-order intuitionistic logics based on linear intuitionistic Kripke frames. We show that their one-variable fragments correspond to particular modal Gödel logics, defined over many-valued S5-Kripke frames. For a large class of these logics, we prove the validity problem to be decidable, even co-NP-complete. Secondly, we investigate the one-variable fragment of first-order Abelian logic, i.e., the first-order logic based on the ordered additive group of the reals. We provide two completeness results with respect to Hilbert-style axiomatizations: one for the one-variable fragment, and one for the one-variable fragment that does not contain any lattice connectives. Both these fragments are proved to be decidable. Finally, we launch a much broader algebraic investigation into one-variable fragments. We turn to the setting of first-order substructural logics (with the rule of exchange). Inspired by work on, among others, monadic Boolean algebras and monadic Heyting algebras, we define monadic commutative pointed residuated lattices as a first (algebraic) investigation into one-variable fragments of this large class of first-order logics. We prove a number of properties for these newly defined algebras, including a characterization in terms of relatively complete subalgebras as well as a characterization of their congruences

    Proof-theoretic Semantics for Intuitionistic Multiplicative Linear Logic

    Get PDF
    This work is the first exploration of proof-theoretic semantics for a substructural logic. It focuses on the base-extension semantics (B-eS) for intuitionistic multiplicative linear logic (IMLL). The starting point is a review of Sandqvist’s B-eS for intuitionistic propositional logic (IPL), for which we propose an alternative treatment of conjunction that takes the form of the generalized elimination rule for the connective. The resulting semantics is shown to be sound and complete. This motivates our main contribution, a B-eS for IMLL , in which the definitions of the logical constants all take the form of their elimination rule and for which soundness and completeness are established

    Through and beyond classicality: analyticity, embeddings, infinity

    Get PDF
    Structural proof theory deals with formal representation of proofs and with the investigation of their properties. This thesis provides an analysis of various non-classical logical systems using proof-theoretic methods. The approach consists in the formulation of analytic calculi for these logics which are then used in order to study their metalogical properties. A specific attention is devoted to studying the connections between classical and non-classical reasoning. In particular, the use of analytic sequent calculi allows one to regain desirable structural properties which are lost in non-classical contexts. In this sense, proof-theoretic versions of embeddings between non-classical logics - both finitary and infinitary - prove to be a useful tool insofar as they build a bridge between different logical regions

    Cyclic proof systems for modal fixpoint logics

    Get PDF
    This thesis is about cyclic and ill-founded proof systems for modal fixpoint logics, with and without explicit fixpoint quantifiers.Cyclic and ill-founded proof-theory allow proofs with infinite branches or paths, as long as they satisfy some correctness conditions ensuring the validity of the conclusion. In this dissertation we design a few cyclic and ill-founded systems: a cyclic one for the weak Grzegorczyk modal logic K4Grz, based on our explanation of the phenomenon of cyclic companionship; and ill-founded and cyclic ones for the full computation tree logic CTL* and the intuitionistic linear-time temporal logic iLTL. All systems are cut-free, and the cyclic ones for K4Grz and iLTL have fully finitary correctness conditions.Lastly, we use a cyclic system for the modal mu-calculus to obtain a proof of the uniform interpolation property for the logic which differs from the original, automata-based one

    Zero-one laws with respect to models of provability logic and two Grzegorczyk logics

    Get PDF
    It has been shown in the late 1960s that each formula of first-order logic without constants and function symbols obeys a zero-one law: As the number of elements of finite models increases, every formula holds either in almost all or in almost no models of that size. Therefore, many properties of models, such as having an even number of elements, cannot be expressed in the language of first-order logic. Halpern and Kapron proved zero-one laws for classes of models corresponding to the modal logics K, T, S4, and S5 and for frames corresponding to S4 and S5. In this paper, we prove zero-one laws for provability logic and its two siblings Grzegorczyk logic and weak Grzegorczyk logic, with respect to model validity. Moreover, we axiomatize validity in almost all relevant finite models, leading to three different axiom systems

    Paul Lorenzen -- Mathematician and Logician

    Get PDF
    This open access book examines the many contributions of Paul Lorenzen, an outstanding philosopher from the latter half of the 20th century. It features papers focused on integrating Lorenzen's original approach into the history of logic and mathematics. The papers also explore how practitioners can implement Lorenzen’s systematical ideas in today’s debates on proof-theoretic semantics, databank management, and stochastics. Coverage details key contributions of Lorenzen to constructive mathematics, Lorenzen’s work on lattice-groups and divisibility theory, and modern set theory and Lorenzen’s critique of actual infinity. The contributors also look at the main problem of Grundlagenforschung and Lorenzen’s consistency proof and Hilbert’s larger program. In addition, the papers offer a constructive examination of a Russell-style Ramified Type Theory and a way out of the circularity puzzle within the operative justification of logic and mathematics. Paul Lorenzen's name is associated with the Erlangen School of Methodical Constructivism, of which the approach in linguistic philosophy and philosophy of science determined philosophical discussions especially in Germany in the 1960s and 1970s. This volume features 10 papers from a meeting that took place at the University of Konstanz
    corecore