Results 1 to 10 of about 836 (154)

Finite sequent calculi for PLTL

open access: diamondLietuvos 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   +2 more sources

Sequent Calculi for Orthologic with Strict Implication

open access: diamondBulletin 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

Two complete finitary sequent calculi for reflexive common knowledge

open access: diamondLietuvos 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   +2 more sources

From Truth Degree Comparison Games to Sequents-of-Relations Calculi for Gödel Logic [PDF]

open access: greenInformation Processing and Management of Uncertainty in Knowledge-Based Systems18th International Conference, 2020
Fermüller C, Lang T, Pavlova A.
europepmc   +3 more sources

Inducing syntactic cut-elimination for indexed nested sequents [PDF]

open access: yesLogical 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]

open access: yesLogical 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]

open access: yesElectronic 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]

open access: yesElectronic 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

open access: yesAxioms, 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

Home - About - Disclaimer - Privacy