Results 251 to 260 of about 136,655 (280)
Some of the next articles are maybe not open access.
A sequent calculus for type assignment
Journal of Symbolic Logic, 1977The sequent calculus formulation (L-formulation) of the theory of functionality without the rules allowing for conversion of subjects of [3, §14E6] fails because the (cut) elimination theorem (ET) fails. This can be most easily seen by the fact that it is easy to prove in the systemandbut not (as is obvious if α is an atomic type [an F-simple])The ...
openaire +2 more sources
A sequent calculus for skeptical Default Logic
1997In this paper, we contribute to the proof-theory of Reiter's Default Logic by introducing a sequent calculus for skeptical reasoning. The main features of this calculus are simplicity and regularity, and the fact that proofs can be surprisingly concise and, in many cases, involve only a small part of the default theory.
BONATTI, PIERO ANDREA, Nicola Olivetti
openaire +2 more sources
Sequent calculus in natural deduction style
Journal of Symbolic Logic, 2001Abstract.A sequent calculus is given in which the management of weakening and contraction is organized as in natural deduction. The latter has no explicit weakening or contraction, but vacuous and multiple discharges in rules that discharge assumptions.
Sara Negri, Jan von Plato
openaire +2 more sources
A desk-top sequent calculus machine
1993This paper presents an implementation of a sequent calculus to be used as a flexible tool for automated deduction. The proposed implementation represents a desk-top machine used in interactive mode to solve verification as well as generation and abduction problems.
Cioni G, Colagrossi A, MIOLA, Alfonso
openaire +3 more sources
Tableaux and sequent calculus for minimal entailment
Journal of Automated Reasoning, 1992Using standard deduction methods, it is shown that a formalization of the nonmonotonic (propositional) minimal entailment relation can be given. The idea of minimal entailment plays a significant role in some major approaches to nonmonotonic reasoning as Circumscription and Closed World Assumption reasoning.
openaire +2 more sources
The Protological Sequent Calculus
1998Protologic is a system for elementary reasoning with constructions, as sketched in Chapter 8. See the following chapter for a detailed justification of the axioms and rules.
openaire +1 more source
A sequent calculus for nominal logic
Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004., 2004Murdoch Gabbay, James Cheney
openaire +2 more sources