A unified semantic framework for fully structural propositional sequent systems

DOI10.1145/2528930zbMath1354.03084OpenAlexW1990123412MaRDI QIDQ2946716

Arnon Avron, Ori Lahav

Publication date: 17 September 2015

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2528930

zbMATH Keywords

analyticityproof theoryKripke semanticssequent calculinondeterministic semanticscut admissibilitysemantic characterizationaxiom expansion

Mathematics Subject Classification ID

Proof theory in general (including proof-theoretic semantics) (03F03)

Related Items (12)

Negative modalities, consistency and determinedness ⋮ Compositional meaning in logic ⋮ Sequent systems for negative modalities ⋮ Completeness and cut-elimination for first-order ideal paraconsistent four-valued logic ⋮ Cut elimination, identity elimination, and interpolation in super-Belnap logics ⋮ Disentangling structural connectives or life without display property ⋮ BOUNDED-ANALYTIC SEQUENT CALCULI AND EMBEDDINGS FOR HYPERSEQUENT LOGICS ⋮ Algebraic proof theory: hypersequents and hypercompletions ⋮ The bounded proof property via step algebras and step frames ⋮ An extended paradefinite logic combining conflation, paraconsistent negation, classical negation, and classical implication: how to construct Nice Gentzen-type sequent calculi ⋮ Effective semantics for the modal logics K and KT via non-deterministic matrices ⋮ ANALYTIC CUT AND INTERPOLATION FOR BI-INTUITIONISTIC LOGIC

This page was built for publication: A unified semantic framework for fully structural propositional sequent systems