Results 241 to 250 of about 136,655 (280)
Some of the next articles are maybe not open access.
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
openaire +1 more source
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
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 +3 more sources
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 +3 more sources
A sequent calculus for circumscription
1997In this paper, we introduce a sequent calculus CIRC for propositional Circumscription. This work is part of a larger project, aiming at a uniform proof-theoretic reconstruction of the major families of non-monotonic logics. Among the novelties of the calculus, we mention that CIRC is analytic and comprises an axiomatic rejection method, which allows ...
BONATTI, PIERO ANDREA, Nicola Olivetti
openaire +3 more sources
A Sequent Calculus for Counterfactual Reasoning
Proceedings of the 2017 Workshop on Programming Languages and Analysis for Security, 2017Counterfactual conditions such as "if A were not true, then C would not have been true" have been formally studied by philosophers for causal claims for decades. Counterfactuals are often used informally in practice for diagnosing systems and identifying errors or misconfigurations.
McKenna McCall +2 more
openaire +2 more sources
Sequent calculus and data fusion
Fuzzy Sets and Systems, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sossai C, Bison P, Chemello G
openaire +2 more sources
1994
In Chapter I we discussed the way a mathematician proceeds to develop a particular mathematical theory: In order to obtain an overview of the theory, he tries to find out which propositions follow from its axioms. To show that a proposition follows from the axioms, he supplies a proof.
Heinz-Dieter Ebbinghaus +2 more
openaire +1 more source
In Chapter I we discussed the way a mathematician proceeds to develop a particular mathematical theory: In order to obtain an overview of the theory, he tries to find out which propositions follow from its axioms. To show that a proposition follows from the axioms, he supplies a proof.
Heinz-Dieter Ebbinghaus +2 more
openaire +1 more source
A Sequent Calculus for Type Theory
2006Based on natural deduction, Pure Type Systems (PTS) can express a wide range of type theories. In order to express proof-search in such theories, we introduce the Pure Type Sequent Calculi (PTSC) by enriching a sequent calculus due to Herbelin, adapted to proof-search and strongly related to natural deduction.
Lengrand, Stéphane +2 more
openaire +3 more sources