Results 241 to 250 of about 25,817 (283)
Some of the next articles are maybe not open access.
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 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
exaly +4 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 +2 more sources
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 0001, Yoni Zohar
openaire +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 0001, Yoni Zohar
openaire +2 more sources
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 +3 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 +3 more sources
Nested Sequent Calculi for Conditional Logics
2012Nested sequent calculi are a useful generalization of ordinary sequent calculi, where sequents are allowed to occur within sequents. Nested sequent calculi have been profitably employed in the area of (multi)-modal logic to obtain analytic and modular proof systems for these logics.
R. Alenda +2 more
openaire +1 more source
Intuitive minimal abduction in sequent calculi
Journal of Computer Science and Technology, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bo Yi +3 more
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
SEQUENT CALCULI FOR SOME TRILATTICE LOGICS
The Review of Symbolic Logic, 2009The trilattice SIXTEEN3 introduced in Shramko & Wansing (2005) is a natural generalization of the famous bilattice FOUR2. Some Hilbert-style proof systems for trilattice logics related to SIXTEEN3 have recently been studied (Odintsov, 2009; Shramko & Wansing, 2005). In this paper, three sequent calculi G B , F B , and Q
Norihiro Kamide, Heinrich Wansing
openaire +2 more sources
Proof Search in Nested Sequent Calculi
2015We propose a notion of focusing for nested sequent calculi for modal logics which brings down the complexity of proof search to that of the corresponding sequent calculi. The resulting systems are amenable to specifications in linear logic. Examples include modal logic $$\mathsf {K}$$, a simply dependent bimodal logic and the standard non-normal modal ...
Björn Lellmann, Elaine Pimentel
openaire +2 more sources