Results 281 to 290 of about 5,727 (317)

Sequent calculi and abstract machines

ACM Transactions on Programming Languages and Systems, 2009
We propose a sequent calculus derived from the λ―μμ˜-calculus of Curien and Herbelin that is expressive enough to directly represent the fine details of program evaluation using typical abstract machines. Not only does the calculus easily encode the usual components of abstract machines such as environments and stacks, but it can also ...
Zena M. Ariola, Aaron Bohannon, Amr Sabry   +2 more
openaire   +1 more source

A NOTE ON THE SEQUENT CALCULI

The Review of Symbolic Logic, 2020
AbstractWe show that the replacement rule of the sequent calculi ${\bf G3[mic]}^= $ in [8] can be replaced by the simpler rule in which one of the principal formulae is not repeated in the premiss.
FRANCO PARLAMENTO, FLAVIO PREVIALE
openaire   +1 more source

Sequent Calculi for Global Modal Consequence Relations

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

Sequent Calculi

1997
Abstract Let us think, in a general way, about what happens in a natural deduction proof. As a whole the proof is an array of formulae, which we say establishes some sequent (namely the sequent which has on its left all the formulae which are undischarged assumptions in the proof, and on its right the single formula proved at the bottom ...
openaire   +1 more source

Sequent calculi for propositional nonmonotonic logics

ACM Transactions on Computational Logic, 2002
A uniform proof-theoretic reconstruction of the major nonmonotonic logics is introduced. It consists of analytic sequent calculi where the details of nonmonotonic assumption making are modelled by an axiomatic rejection method. Another distinctive feature of the calculi is the use of provability constraints that make reasoning largely independent of ...
BONATTI, PIERO ANDREA, OLIVETTI N.
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

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

L-domains as locally continuous sequent calculi

Archive for Mathematical Logic
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Longchun Wang, Qingguo Li
openaire   +1 more source

Proof Search in Nested Sequent Calculi

2015
We propose a notion of focusing for nested sequent calculi for modal logics which brings down the complexity of proof search to that of the corresponding sequent calculi. The resulting systems are amenable to specifications in linear logic. Examples include modal logic $$\mathsf {K}$$, a simply dependent bimodal logic and the standard non-normal modal ...
Lellmann, Björn, Pimentel, Elaine
openaire   +1 more source

Metainferential Sequent Calculi

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