Switch to: References

Add citations

You must login to add citations.
  1. Syntactic Cut-Elimination for Intuitionistic Fuzzy Logic Via Linear Nested Sequents.Tim Lyon - 2020 - In Sergei Artemov & Anil Nerode (eds.), Logical Foundations of Computer Science. Cham: pp. 156-176.
    This paper employs the linear nested sequent framework to design a new cut-free calculus (LNIF) for intuitionistic fuzzy logic---the first-order Goedel logic characterized by linear relational frames with constant domains. Linear nested sequents---which are nested sequents restricted to linear structures---prove to be a well-suited proof-theoretic formalism for intuitionistic fuzzy logic. We show that the calculus LNIF possesses highly desirable proof-theoretic properties such as invertibility of all rules, admissibility of structural rules, and syntactic cut-elimination.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  • Modal Sequent Calculi Labelled with Truth Values: Completeness, Duality and Analyticity.Paulo Mateus, Amílcar Sernadas, Cristina Sernadas & Luca Viganò - 2004 - Logic Journal of the IGPL 12 (3):227-274.
    Labelled sequent calculi are provided for a wide class of normal modal systems using truth values as labels. The rules for formula constructors are common to all modal systems. For each modal system, specific rules for truth values are provided that reflect the envisaged properties of the accessibility relation. Both local and global reasoning are supported. Strong completeness is proved for a natural two-sorted algebraic semantics. As a corollary, strong completeness is also obtained over general Kripke semantics. A duality result (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • A Focused Framework for Emulating Modal Proof Systems.Sonia Marin, Dale Miller & Marco Volpe - 2016 - In Lev Beklemishev, Stéphane Demri & András Máté (eds.), Advances in Modal Logic, Volume 11. CSLI Publications. pp. 469-488.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  • Causality, Modality, and Explanation.Graham White - 2008 - Notre Dame Journal of Formal Logic 49 (3):313-343.
    We start with Fodor's critique of cognitive science in "The mind doesn't work that way: The scope and limits of computational psychology": he argues that much mental activity cannot be handled by the current methods of cognitive science because it is nonmonotonic and, therefore, is global in nature, is not context-free, and is thus not capable of being formalized by a Turing-like mental architecture. We look at the use of nonmonotonic logic in the artificial intelligence community, particularly with the discussion (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark  
  • A Proof-Theoretic Investigation of a Logic of Positions.Stefano Baratella & Andrea Masini - 2003 - Annals of Pure and Applied Logic 123 (1-3):135-162.
    We introduce an extension of natural deduction that is suitable for dealing with modal operators and induction. We provide a proof reduction system and we prove a strong normalization theorem for an intuitionistic calculus. As a consequence we obtain a purely syntactic proof of consistency. We also present a classical calculus and we relate provability in the two calculi by means of an adequate formula translation.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  • Proof Theory for Functional Modal Logic.Shawn Standefer - 2018 - Studia Logica 106 (1):49-84.
    We present some proof-theoretic results for the normal modal logic whose characteristic axiom is \. We present a sequent system for this logic and a hypersequent system for its first-order form and show that these are equivalent to Hilbert-style axiomatizations. We show that the question of validity for these logics reduces to that of classical tautologyhood and first-order logical truth, respectively. We close by proving equivalences with a Fitch-style proof system for revision theory.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Temporal Gödel-Gentzen and Girard Translations.Norihiro Kamide - 2013 - Mathematical Logic Quarterly 59 (1-2):66-83.
    A theorem for embedding a first-order linear- time temporal logic LTL into its intuitionistic counterpart ILTL is proved using Baratella-Masini's temporal extension of the Gödel-Gentzen negative translation of classical logic into intuitionistic logic. A substructural counterpart LLTL of ILTL is introduced, and a theorem for embedding ILTL into LLTL is proved using a temporal extension of the Girard translation of intuitionistic logic into intuitionistic linear logic. These embedding theorems are proved syntactically based on Gentzen-type sequent calculi.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  • An Approach to Infinitary Temporal Proof Theory.Stefano Baratella & Andrea Masini - 2004 - Archive for Mathematical Logic 43 (8):965-990.
    Aim of this work is to investigate from a proof-theoretic viewpoint a propositional and a predicate sequent calculus with an ω–type schema of inference that naturally interpret the propositional and the predicate until–free fragments of Linear Time Logic LTL respectively. The two calculi are based on a natural extension of ordinary sequents and of standard modal rules. We examine the pure propositional case (no extralogical axioms), the propositional and the first order predicate cases (both with a possibly infinite set of (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations