Access the full text.
Sign up today, get DeepDyve free for 14 days.
L. Beklemishev, Y. Gurevich (2014)
Propositional primal logic with disjunctionJ. Log. Comput., 24
A. Avron (1993)
Gentzen-type systems, resolution and tableauxJournal of Automated Reasoning, 10
Ryo Ishigaki, Ryo Kashima (2007)
Sequent Calculi for Some Strict Implication LogicsLog. J. IGPL, 16
A. Avron (2004)
Non-deterministic Semantics for Families of Paraconsistent Logics
A. Avron, O. Lahav (2010)
On Constructive Connectives and SystemsLog. Methods Comput. Sci., 6
J. Girard (1989)
Proof Theory and Logical ComplexityAnnals of Pure and Applied Logic, 53
(1997)
Modal Logic. Oxford Logic Guides
A. Avron, A. Zamansky (2011)
NON-DETERMINISTIC SEMANTICS FOR LOGICAL SYSTEMS
A. Ciabattoni, K. Terui (2006)
Towards a Semantic Characterization of Cut-EliminationStudia Logica, 82
A. Avron (1984)
On modal systems having arithmetical interpretationsJournal of Symbolic Logic, 49
R. Lavendhomme, T. Lucas (2000)
Sequent Calculi and Decision Procedures for Weak Modal SystemsStudia Logica, 66
(1975)
Proof Theory. Studies in Logic and the Foundations of Mathematics
D. Leivant (1981)
On the proof theory of the modal logic for arithmetic provabilityJournal of Symbolic Logic, 46
(2013)
ACM Transactions on Computational Logic
(2012)
Received February
K. Schütte (1960)
Syntactical and semantical properties of simple type theoryJournal of Symbolic Logic, 25
(1964)
Investigations into logical deduction
Article ?, Publication date: ?
A. Avron, I. Lev (2005)
Non-deterministic Multiple-valued StructuresJ. Log. Comput., 15
A. Avron, O. Lahav (2011)
Kripke Semantics for Basic Sequent Systems
Brigitte Hösli, Gerhard Jäger (1994)
About some symmetries of negationJournal of Symbolic Logic, 59
R. Goré, Linda Postniece (2010)
Combining Derivations and Refutations for Cut-free Completeness in Bi-intuitionistic LogicJ. Log. Comput., 20
F. Poggiolesi (2010)
Gentzen Calculi for Modal Propositional Logic
T. Bennett, Coskun Bayrak (1994)
Bridging the data integration gap: from theory to implementationACM SIGSOFT Softw. Eng. Notes, 36
H. Ono (1977)
On Some Intuitionistic Modal LogicsPublications of The Research Institute for Mathematical Sciences, 13
G. Sambin, S. Valentini (1982)
The modal logic of provability. The sequential approachJournal of Philosophical Logic, 11
V. Svejdar (1999)
On provability logicNordic Journal of Philosophical Logic, 4
A. Troelstra, H. Schwichtenberg (1996)
Basic proof theory, 43
L. Pinto, Tarmo Uustalu (2009)
Proof Search and Counter-Model Construction for Bi-intuitionistic Propositional Logic with Labelled Sequents
W. Carnielli, M. Coniglio, João Marcos (2007)
Logics of Formal Inconsistency
R. Dyckhoff (1992)
Contraction-free sequent calculi for intuitionistic logicJournal of Symbolic Logic, 57
H. Wansing (2002)
Sequent Systems for Modal Logics
A Semantic Framework for Structural Propositional Sequent Systems
A. Ciabattoni (2001)
Hypersequent Calculi for some Intermediate Logics with Bounded Kripke ModelsJ. Log. Comput., 11
A Unified Semantic Framework for Fully Structural Propositional Sequent Systems ORI LAHAV and ARNON AVRON, Tel Aviv University We identify a large family of fully structural propositional sequent systems, which we call basic systems. We present a general uniform method for providing (potentially, nondeterministic) strongly sound and complete Kripke-style semantics, which is applicable for every system of this family. In addition, this method can also be applied when: (i) some formulas are not allowed to appear in derivations, (ii) some formulas are not allowed to serve as cut formulas, and (iii) some instances of the identity axiom are not allowed to be used. This naturally leads to new semantic characterizations of analyticity (global subformula property), cut admissibility and axiom expansion in basic systems. We provide a large variety of examples showing that many soundness and completeness theorems for different sequent systems, as well as analyticity, cut admissibility, and axiom expansion results, easily follow using the general method of this article. Categories and Subject Descriptors: F.4.1 [Mathematical Logic]: Proof Theory General Terms: Theory Additional Key Words and Phrases: Analyticity, axiom expansion, cut admissibility, Kripke semantics, logic, nondeterministic semantics, proof theory, semantic characterization, sequent calculi ACM Reference Format: Lahav, O.
ACM Transactions on Computational Logic (TOCL) – Association for Computing Machinery
Published: Nov 1, 2013
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.