Results 201 to 210 of about 168,343 (247)

Sequent Calculus in the Topos of Trees

Foundations of Software Science and Computation Structure, 2015
Nakano’s “later” modality, inspired by Godel-Lob provability logic, has been applied in type systems and program logics to capture guarded recursion. Birkedal et al modelled this modality via the internal logic of the topos of trees.
Ranald Clouston, R. Goré
semanticscholar   +1 more source

The Protological Sequent Calculus

1998
Protologic 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

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

Dual-Context Sequent Calculus and Strict Implication

MLQ, 2002
Summary: We introduce a dual-context style sequent calculus which is complete with respect to Kripke semantics where implication is interpreted as strict implication in the modal logic K. The cut-elimination theorem for this calculus is proved by a variant of Gentzen's method.
openaire   +2 more sources

Herzberger’s Limit Rule with Labelled Sequent Calculus

Studia Logica, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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