Results 241 to 250 of about 5,524 (273)
Some of the next articles are maybe not open access.
ACM Transactions on Computational Logic, 2019
Analyticity, also known as the subformula property, typically guarantees decidability of derivability in propositional sequent calculi. To utilize this fact, two substantial gaps have to be addressed: (i) What makes a sequent calculus analytic?
Ori Lahav, Yoni Zohar
openaire +3 more sources
Analyticity, also known as the subformula property, typically guarantees decidability of derivability in propositional sequent calculi. To utilize this fact, two substantial gaps have to be addressed: (i) What makes a sequent calculus analytic?
Ori Lahav, Yoni Zohar
openaire +3 more sources
Loop-Type Sequent Calculi for Temporal Logic
Journal of Automated Reasoning, 2020Loop-type sequent calculi were first considered in [\textit{P. Wolper}, Log. Anal., Nouv. Sér. 28, 119--136 (1985; Zbl 0585.03008)]. observing that some global constraints (\textit{loops}) must be detected on branches to identify a tree as a proof.
Alonderis, R. +3 more
openaire +3 more sources
Sequent calculi for propositional nonmonotonic logics
ACM Transactions on Computational Logic, 2002A uniform proof-theoretic reconstruction of the major nonmonotonic logics is introduced. It consists of analytic sequent calculi where the details of nonmonotonic assumption making are modelled by an axiomatic rejection method. Another distinctive feature of the calculi is the use of provability constraints that make reasoning largely independent of ...
BONATTI, PIERO ANDREA, OLIVETTI N.
openaire +4 more sources
L-domains as locally continuous sequent calculi
Archive for Mathematical LogiczbMATH Open Web Interface contents unavailable due to conflicting licenses.
Longchun Wang, Qingguo Li
openaire +3 more sources
Sequent-Calculi for Metainferential Logics
Studia Logica, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bruno Da Ré, Federico Pailos
openaire +1 more source
Studia Logica, 1999
In this paper, the relations between natural deductions of D. Prawitz and Gentzen-style deductions are investigated. The latter are also ascribed to \textit{S. Jaśkowski} [Stud. Log. No. 1, 5-32 (1934; Zbl 0011.09702)]. In particular the correspondence of normal deductions in the N-calculus and cutfree deductions in the G-calculus are examined ...
openaire +2 more sources
In this paper, the relations between natural deductions of D. Prawitz and Gentzen-style deductions are investigated. The latter are also ascribed to \textit{S. Jaśkowski} [Stud. Log. No. 1, 5-32 (1934; Zbl 0011.09702)]. In particular the correspondence of normal deductions in the N-calculus and cutfree deductions in the G-calculus are examined ...
openaire +2 more sources
Sequent calculi and abstract machines
ACM Transactions on Programming Languages and Systems, 2009We propose a sequent calculus derived from the λ―μμ˜-calculus of Curien and Herbelin that is expressive enough to directly represent the fine details of program evaluation using typical abstract machines. Not only does the calculus easily encode the usual components of abstract machines such as environments and stacks, but it can also ...
Zena M. Ariola +2 more
openaire +1 more source
The Review of Symbolic Logic, 2020
AbstractWe show that the replacement rule of the sequent calculi ${\bf G3[mic]}^= $ in [8] can be replaced by the simpler rule in which one of the principal formulae is not repeated in the premiss.
FRANCO PARLAMENTO, FLAVIO PREVIALE
openaire +1 more source
AbstractWe show that the replacement rule of the sequent calculi ${\bf G3[mic]}^= $ in [8] can be replaced by the simpler rule in which one of the principal formulae is not repeated in the premiss.
FRANCO PARLAMENTO, FLAVIO PREVIALE
openaire +1 more source
Sequent Calculi for Global Modal Consequence Relations
Studia Logica, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ma, Minghui, Chen, Jinsheng
openaire +2 more sources
1997
Abstract Let us think, in a general way, about what happens in a natural deduction proof. As a whole the proof is an array of formulae, which we say establishes some sequent (namely the sequent which has on its left all the formulae which are undischarged assumptions in the proof, and on its right the single formula proved at the bottom ...
openaire +1 more source
Abstract Let us think, in a general way, about what happens in a natural deduction proof. As a whole the proof is an array of formulae, which we say establishes some sequent (namely the sequent which has on its left all the formulae which are undischarged assumptions in the proof, and on its right the single formula proved at the bottom ...
openaire +1 more source