Results 261 to 270 of about 28,623 (311)
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
[1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science, 2002
An axiomatic approach that accounts for examples that come up in logic programming, symbolic computation, affine geometry, and elsewhere is presented. It is shown that if disjunction behaves in an intuitionistic fashion, notions of canonical form for positive constraints can be systematically extended to include negative constraints.
Jean-Louis Lassez, Ken McAloon
openaire +1 more source
An axiomatic approach that accounts for examples that come up in logic programming, symbolic computation, affine geometry, and elsewhere is presented. It is shown that if disjunction behaves in an intuitionistic fashion, notions of canonical form for positive constraints can be systematically extended to include negative constraints.
Jean-Louis Lassez, Ken McAloon
openaire +1 more source
Computation with classical sequents
Mathematical Structures in Computer Science, 2008$\X$is an untyped continuation-style formal language with a typed subset that provides a Curry–Howard isomorphism for a sequent calculus for implicative classical logic.$\X$can also be viewed as a language for describing nets by composition of basic components connected by wires.
Steffen van Bakel, Pierre Lescanne
openaire +2 more sources
A Survey of Nonstandard Sequent Calculi [PDF]
Studia Logica, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Andrzej Indrzejczak +1 more
exaly +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
Mathematical Logic Quarterly, 1996
AbstractWe develop cut‐free calculi of sequents for normal modal logics by using treesequents, which are trees of sequences of formulas. We introduce modal operators corresponding to the ways we move formulas along the branches of such trees, only considering fixed distance movements.
openaire +2 more sources
AbstractWe develop cut‐free calculi of sequents for normal modal logics by using treesequents, which are trees of sequences of formulas. We introduce modal operators corresponding to the ways we move formulas along the branches of such trees, only considering fixed distance movements.
openaire +2 more sources
2021
AbstractIn addition to natural deduction, Gentzen developed a different calculus, called the sequent calculus. A sequent is a configuration presenting an arrow symbol (⇒) flanked on the left and on the right by finite sequences of formulas, possibly empty.
Paolo Mancosu +2 more
exaly +2 more sources
AbstractIn addition to natural deduction, Gentzen developed a different calculus, called the sequent calculus. A sequent is a configuration presenting an arrow symbol (⇒) flanked on the left and on the right by finite sequences of formulas, possibly empty.
Paolo Mancosu +2 more
exaly +2 more sources
ACM SIGART Bulletin, 1991
This paper describes a general theoretical framework for constructing intelligent knowledge bases. The framework arises from the desire to construct powerful and efficient systems. Powerful in the sense that they drawn "deep" conclusions from the knowledge base, and efficient in that they give quick responses ...
openaire +1 more source
This paper describes a general theoretical framework for constructing intelligent knowledge bases. The framework arises from the desire to construct powerful and efficient systems. Powerful in the sense that they drawn "deep" conclusions from the knowledge base, and efficient in that they give quick responses ...
openaire +1 more source