Results 261 to 270 of about 1,739 (283)

Sequent calculi for default and autoepistemic logics

1996
Two sequent calculi, for default logic and autoepistemic logic, will be introduced in this paper. The main goal is improving our prooftheoretic understanding of non-monotonic formalisms. Credulous reasoning will be axiomatized for the first time, and a link will be established between non-monotonic reasoning and the branch of logic devoted to axiomatic
openaire   +2 more sources

Sequent Calculi for Indexed Epistemic Logics. [PDF]

, 2016
Indexed epistemic logics constitute a well-structured class of quantified epistemic logics with great expressive power and a well-behaved semantics based on the notion of epistemic transition model. It follows that they generalize term-modal logics. As to proof theory, the only axiomatic system for which we have a completeness theorem is the minimal ...
CORSI, GIOVANNA, ORLANDELLI, EUGENIO
openaire   +1 more source

Interpolation Method for Multicomponent Sequent Calculi

2015
The proof-theoretic method of proving the Craig interpolation property was recently extended from sequents to nested sequents and hypersequents. There the notations were formalism-specific, obscuring the underlying common idea, which is presented here in a general form applicable also to other similar formalisms, e.g., prefixed tableaus.
openaire   +1 more source

Sequent Calculi for Normal Modal Propositional Logics

Journal of Logic and Computation, 1994
This is a streamlined exposition of \textit{N. Belnap}'s display logic DL [J. Philos. Logic 11, 375-417 (1982; Zbl 0509.03008)]. DL can be seen as an encoding of a formalization introduced by \textit{S. Kripke} [Z. Math. Logik Grundlagen Math. 9, 67-96 (1963; Zbl 0118.013)] where finite systems of sequents \(S; \sigma_ 1 S_ 1; \sigma_ 2 S_ 2;\dots ...
openaire   +2 more sources

Sequent Calculi for Modal Logics

2020
In this chapter we focus on standard and generalised sequent calculi for some modal logics. In general, the application of SC apparatus to non-classical logics showed several limitations of the Gentzen’s approach. In sections 4.2 - 4.4 we describe extensions of LK and G3 to modal logics. In particular, we provide proofs of cut elimination/admissibility
openaire   +1 more source

Metainferential Sequent Calculi

2023
Federico Pailos, Bruno Da Ré
openaire   +1 more source

Two-sided Sequent Calculi for FDE-like Four-valued Logics

Journal of Philosophical Logic, 2022
Barteld Kooi, Allard Tamminga, Kooi Barteld   +2 more
exaly  

Falsification-Aware Semantics and Sequent Calculi for Classical Logic

Journal of Philosophical Logic, 2021
Norihiro Kamide, Kamide Norihiro
exaly  

Labeled sequent calculi for modal logics and implicit contractions

Archive for Mathematical Logic, 2013
Pierluigi Minari
exaly  

Sequent Calculi for $${\mathsf {SCI}}$$ SCI

Studia Logica, 2017
Szymon Chlebowski
exaly