Results 11 to 20 of about 715 (255)
Cut Elimination for Extended Sequent Calculi
Bulletin of the Section of Logic, 2023 We present a syntactical cut-elimination proof for an extended sequent calculus covering the classical modal logics in the \(\mathsf{K}\), \(\mathsf{D}\), \(\mathsf{T}\), \(\mathsf{K4}\), \(\mathsf{D4}\) and \(\mathsf{S4}\) spectrum.
Simone Martini +2 more
doaj +4 more sources
Sequent Calculi for Orthologic with Strict Implication
Bulletin of the Section of Logic, 2022 In this study, new sequent calculi for a minimal quantum logic (\(\bf MQL\)) are discussed that involve an implication. The sequent calculus \(\bf GO\) for \(\bf MQL\) was established by Nishimura, and it is complete with respect to ortho-models (O ...
Tomoaki Kawano
doaj +3 more sources
Graphical Sequent Calculi for Modal Logics [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 The syntax of modal graphs is defined in terms of the continuous cut and broken cut following Charles Peirce's notation in the gamma part of his graphical logic of existential graphs.
Minghui Ma, Ahti-Veikko Pietarinen
doaj +4 more sources
Sequent Calculi for Choice Logics
Journal of Automated Reasoning, 2022 AbstractChoice logics constitute a family of propositional logics and are used for the representation of preferences, with especiallyqualitative choice logic(QCL) being an established formalism with numerous applications in artificial intelligence. While computational properties and applications of choice logics have been studied in the literature ...
Michael Bernreiter +3 more
openaire +2 more sources
Inducing syntactic cut-elimination for indexed nested sequents [PDF]
Logical Methods in Computer Science, 2018 The key to the proof-theoretic study of a logic is a proof calculus with a subformula property. Many different proof formalisms have been introduced (e.g. sequent, nested sequent, labelled sequent formalisms) in order to provide such calculi for the many
Revantha Ramanayake
doaj +1 more source
On the Correspondence between Display Postulates and Deep Inference in Nested Sequent Calculi for Tense Logics [PDF]
Logical Methods in Computer Science, 2011 We consider two styles of proof calculi for a family of tense logics, presented in a formalism based on nested sequents. A nested sequent can be seen as a tree of traditional single-sided sequents.
Rajeev Gore +2 more
doaj +1 more source
Sequent Calculi for the classical fragment of Bochvar and Halldén's Nonsense Logics [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 In this paper sequent calculi for the classical fragment (that is, the conjunction-disjunction-implication-negation fragment) of the nonsense logics B3, introduced by Bochvar, and H3, introduced by Halldén, are presented.
Marcelo E. Coniglio, María I. Corbalán
doaj +1 more source
Relating Sequent Calculi for Bi-intuitionistic Propositional Logic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 Bi-intuitionistic logic is the conservative extension of intuitionistic logic with a connective dual to implication. It is sometimes presented as a symmetric constructive subsystem of classical logic.
Luís Pinto, Tarmo Uustalu
doaj +1 more source
Cut-Free Gentzen Sequent Calculi for Tense Logics
Axioms, 2023 The cut-free single-succedent Gentzen sequent calculus GKt for the minimal tense logic Kt is introduced. This sequent calculus satisfies the displaying property.
Zhe Lin, Minghui Ma
doaj +1 more source
Sequent Calculi for the Propositional Logic of HYPE [PDF]
Studia Logica, 2021 AbstractIn this paper we discuss sequent calculi for the propositional fragment of the logic of HYPE. The logic of HYPE was recently suggested by Leitgeb (Journal of Philosophical Logic 48:305–405, 2019) as a logic for hyperintensional contexts. On the one hand we introduce a simple $$\mathbf{G1}$$ G
openaire +3 more sources