Results 251 to 260 of about 14,982 (276)

Analytic Sequent Calculus for CPL

2020
This chapter introduces a simplified, analytic version of sequent calculus K for classical propositional logic CPL. Sections 1.2–1.7 contain the basic material, including a presentation of essential features and techniques of K. In particular, we discuss the construction of proofs and derivations, the problem of derivable and admissible rules, decision
openaire   +1 more source

A sequent calculus for circumscription

1997
In 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   +2 more sources

Sequent calculus in natural deduction style

Journal of Symbolic Logic, 2001
Abstract.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.
Negri, Sara, von Plato, Jan
openaire   +2 more sources

A sequent calculus for skeptical Default Logic

1997
In 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

Natural Deduction and Sequent Calculus

2002
The propositional rules of predicate BI are not merely copies of their counterparts in propositional BI. Each proposition, φ, occurring in a sequent in an inference must be well-formed, i.e., the sequent must include the variables X such that X \({ \vdash _{\Sigma ,\Xi }}\phi \) :Prop as determined by the calculus of well-formed propositions.
openaire   +1 more source

Gentzen sequent calculus for possibilistic reasoning

1994
Possibilistic logic is an important uncertainty reasoning mechanism based on Zadeh's possibility theory and classical logic. Its inference rules are derived from the classical resolution rule by attaching possibility or necessity weights to ordinary clauses.
Churn Jung Liau, Bertrand I -Peng Lin
openaire   +1 more source

What Is a Good Sequent Calculus?

2010
In his doctoral thesis of 1935, the young and brilliant student Gerhard Gentzen introduced what is today known as the sequent calculus. Over the last eighty years the sequent calculus has been the central interest of several illustrious proof theorists. This has given rise to a broad literature and numerous results.
openaire   +1 more source

Sequent Calculus

1981
openaire   +1 more source

A formal framework for specifying sequent calculus proof systems

Theoretical Computer Science, 2013
Dale Miller, Elaine Pimentel
exaly  

Sequent Calculus

2019
openaire   +1 more source