Results 31 to 40 of about 2,868 (293)
Efficient loop-check for multimodal KD45n logic
We introduce sequent calculus for multi-modal logic KD45n which uses efficient loop-check. Efficiency of the used loop-check is obtained by using marked modal operator squarei which is used as an alternative to sequent with histories ([2,3]).We use ...
Adomas Birštunas
doaj +1 more source
A labeled sequent calculus for propositional linear time logic
A labeled sequent calculus LSC for propositional linear discrete time logic PLTL is introduced. Its sub-calculus LSC−TL is proved to be complete for some class of PLTL sequents.
Romas Alonderis
doaj +1 more source
A Proof-Theoretic Interpolation Theorem for Inquisitive Propositional Logic
This paper presents a sequent calculus for Inquisitive Propositional Logic obtained by expanding the sequent calculus g3ip for intuitionistic propositional logic with suitable rules for double negation elimination for atoms and the Split Property.
Andreas Fjellstad
doaj +1 more source
Sequent Calculus Representations for Quantum Circuits [PDF]
When considering a sequent-style proof system for quantum programs, there are certain elements of quantum mechanics that we may wish to capture, such as phase, dynamics of unitary transformations, and measurement probabilities. Traditional quantum logics
Cameron Beebe
doaj +1 more source
A Super-Polynomial Separation Between Resolution and Cut-Free Sequent Calculus [PDF]
We show a quadratic separation between resolution and cut-free sequent calculus width. We use this gap to get, for the first time, first, a super-polynomial separation between resolution and cut-free sequent calculus for refuting CNF formulas, and ...
Papamakarios, Theodoros
core +1 more source
A sequent calculus for propositional temporal logic with time gaps
A sequent calculus with Kripke semantics internalization for a propositional temporal logic with time gaps is introduced. All rules of the calculus are context-free and height-preserving invertible. Structural rules are admissible.
Romas Alonderis
doaj +1 more source
Inducing syntactic cut-elimination for indexed nested sequents [PDF]
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
ABSTRACT Background An internal tandem duplication in the gene encoding Fms‐like tyrosine kinase 3 (FLT3‐ITD) is associated with high relapse risk and poor prognosis in acute myeloid leukemia (AML) and plays a crucial role in treatment decisions. Measurable residual disease (MRD) analysis of FLT3‐ITD during and after treatment has shown prognostic ...
Sofie Johansson Alm +11 more
wiley +1 more source
A Sequent Calculus for Urn Logic [PDF]
Approximately speaking, an urn model for first-order logic is a model where the domain of quantification changes depending on the values of variables which have been bound by quantifiers previously. In this paper we introduce a model-changing semantics for urn-models, and then give a sequent calculus for urn logic by introducing formulas which can be ...
openaire +2 more sources
Comparing Sense and Denotation in Bilateralist Proof Systems for Proofs and Refutations
In this paper a framework to distinguish in a Fregean manner between sense and denotation of \(\lambda\)-term-annotated derivations will be applied to a bilateralist sequent calculus displaying two derivability relations, one for proving and one for ...
Sara Ayhan
doaj +1 more source

