Results 251 to 260 of about 25,817 (283)

Loop-Type Sequent Calculi for Temporal Logic

Journal of Automated Reasoning, 2020
Loop-type sequent calculi were first considered in [\textit{P. Wolper}, Log. Anal., Nouv. Sér. 28, 119--136 (1985; Zbl 0585.03008)]. observing that some global constraints (\textit{loops}) must be detected on branches to identify a tree as a proof.
Romas Alonderis, Regimantas Pliuskevicius, Aida Pliuskeviciene, Haroldas Giedra   +3 more
exaly   +3 more sources

Sequent Calculi for Normal Update Logics

2019
Normal update logic is the temporalization of normal conditional logic. Sequent calculi for the least normal update logic \(\mathbf {UCK}\) by Andreas Herzig (1998) and some of its extensions are developed. The subformula property of these sequent calculi is shown by Takano’s semantic method.
Katsuhiko Sano, Minghui Ma
openaire   +1 more source

Sequent Calculi for Global Modal Consequence Relations

Studia Logica, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Minghui Ma, Jinsheng Chen
openaire   +2 more sources

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

MODULAR SEQUENT CALCULI FOR INTERPRETABILITY LOGICS

The Review of Symbolic Logic
Abstract An original family of labelled sequent calculi $\mathsf {G3IL}^{\star }$ for classical interpretability logics is presented, modularly designed on ...
Perini Brogi C., Negri S., Olivetti N.
openaire   +2 more sources

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

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   +3 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