Results 31 to 40 of about 1,740 (284)
Sequent calculi for induction and infinite descent [PDF]
Journal of Logic and Computation, 2010 The authors develop and compare proof-theoretic foundations for proof by induction and proof by infinite descent in the context of a first-order logic \(\text{FOL}_{\text{ID}}\) containing inductively defined predicates. These two styles of reasoning are formalized as the corresponding sequent calculi. It is shown that the proof system \(\text{LKID}\),
Brotherston, James, Simpson, Alexander
openaire +3 more sources
Two complete finitary sequent calculi for reflexive common knowledge
Lietuvos Matematikos Rinkinys, 2013 This paper discusses the use of complete sequent calculi for reflexive common knowledge logic. Description of language and complete infinitary calculus for RCL is presented.
Aurimas Paulius Girčys +1 more
doaj +1 more source
Sequent Calculi for Visser's Propositional Logics
Notre Dame Journal of Formal Logic, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Katsumasa Ishii +2 more
openaire +2 more sources
Admissibility, compatibility, and deducibility in first-order sequent logics [PDF]
Computer Science Journal of Moldova, 2015 The paper is about the notions of admissibility and compatibility and their significance for deducibility in different sequent logics including first-order classical and intuitionistic ones both without and with equality and, possibly, with modal rules.
Alexander Lyaletski
doaj
Finite sequent calculi for PLTL
Lietuvos Matematikos Rinkinys, 2015 Two sequent calculi for temporal logic of knowledge are presented: one containing invariant-like rule and the other containing looping axioms. Its proved that the calculi are equivalent, sound and complete.
Romas Alonderis +2 more
doaj +1 more source
Sequent calculus for logic of correlated knowledge
Lietuvos Matematikos Rinkinys, 2011 Sound and complete sequent calculi for general epistemic logic and logic of correlated knowledge are presented in this paper.
Haroldas Giedra +1 more
doaj +1 more source
Generic Modal Cut Elimination Applied to Conditional Logics [PDF]
Logical Methods in Computer Science, 2011 We develop a general criterion for cut elimination in sequent calculi for propositional modal logics, which rests on absorption of cut, contraction, weakening and inversion by the purely modal part of the rule system. Our criterion applies also to a wide
Dirk Pattinson, Lutz Schröder
doaj +1 more source
SEQUENT CALCULI FOR FINITE VALUED LUKASIEWICZ LOGICS VIA BOOLEAN DECOMPOSITIONS [PDF]
, 2000 In this paper we define internal cut-free sequent calculi for any n-valued Lukasiewicz logic Ln. These calculi are based on a representation of formulas of Ln, by n - 1 many {0, 1}-valued formulas of Ln. They enjoy the usual properties of sequent systems
CIABATTONI A. +5 more
core +1 more source
On Natural Deduction for Herbrand Constructive Logics III: The Strange Case of the Intuitionistic Logic of Constant Domains [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 The logic of constant domains is intuitionistic logic extended with the so-called forall-shift axiom, a classically valid statement which implies the excluded middle over decidable formulas.
Federico Aschieri
doaj +1 more source
Empirical Negation, Co-Negation and the Contraposition Rule II: Proof-Theoretical Investigations
Bulletin of the Section of Logic, 2020 We continue the investigation of the first paper where we studied logics with various negations including empirical negation and co-negation. We established how such logics can be treated uniformly with R. Sylvan's CCω as the basis.
Satoru Niki
doaj +1 more source