Results 241 to 250 of about 1,739 (283)
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 +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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, Lahavori
exaly +2 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, Lahavori
exaly +2 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 ...
Piero A Bonatti, Nicola Olivetti
exaly +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.
Pliuškevičius R
exaly +2 more sources
MODULAR SEQUENT CALCULI FOR INTERPRETABILITY LOGICS
The Review of Symbolic LogicAbstractAn original family of labelled sequent calculi $\mathsf {G3IL}^{\star }$ for classical interpretability logics is presented, modularly designed on the basis of Verbrugge semantics (a.k.a. generalised Veltman semantics) for those logics.
Perini Brogi C., Negri S., Olivetti N.
openaire +2 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
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