Hypersequents, logical consequence and intermediate logics for concurrency
From MaRDI portal
Publication:1354077
DOI10.1007/BF01531058zbMath0865.03042MaRDI QIDQ1354077
Publication date: 13 May 1997
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
parallel computationdecidabilityalgebraic semanticsintermediate logicshypersequentscut-free systemsDummett's LCGentzen-type systems
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Proof theory in general (including proof-theoretic semantics) (03F03) Intermediate logics (03B55)
Related Items
A Co-inductive Language and Truth Degrees ⋮ From truth degree comparison games to sequents-of-relations calculi for Gödel logic ⋮ Tools for the Investigation of Substructural and Paraconsistent Logics ⋮ A cut-free calculus for second-order Gödel logic ⋮ Prior’s OIC nonconservativity example revisited ⋮ Fuzzy logics based on \([0,1)\)-continuous uninorms ⋮ LINEAR TIME IN HYPERSEQUENT FRAMEWORK ⋮ An ecumenical notion of entailment ⋮ A note on standard completeness for some extensions of uninorm logic ⋮ Mathematical Fuzzy Logics ⋮ Algebraic proof theory for substructural logics: cut-elimination and completions ⋮ Separating Sessions Smoothly ⋮ FRACTIONAL-VALUED MODAL LOGIC ⋮ Nested sequents for intermediate logics: the case of Gödel-Dummett logics ⋮ Choreographies, logically ⋮ Density revisited ⋮ Fractional-Valued Modal Logic and Soft Bilateralism ⋮ Hypersequent calculi for intuitionistic logic with classical atoms ⋮ Cut Elimination Theorem for Non-Commutative Hypersequent Calculus ⋮ On Natural Deduction for Herbrand Constructive Logics I: Curry-Howard Correspondence for Dummett's Logic LC ⋮ Unnamed Item ⋮ Hypersequent Calculi for S5: The Methods of Cut Elimination ⋮ Eliminability of cut in hypersequent calculi for some modal logics of linear frames ⋮ Density elimination ⋮ A Multiple-Conclusion Calculus for First-Order Gödel Logic ⋮ A Hypersequent System for Gödel-Dummett Logic with Non-constant Domains ⋮ On the concurrent computational content of intermediate logics ⋮ BOUNDED-ANALYTIC SEQUENT CALCULI AND EMBEDDINGS FOR HYPERSEQUENT LOGICS ⋮ Hyperformulae, Parallel Deductions and Intersection Types ⋮ The Hidden Structural Rules of the Discontinuous Lambek Calculus ⋮ Uninorm logic with the \(n\)-potency axiom ⋮ Analytic calculi for product logics ⋮ Hypersequent and display calculi -- a unified perspective ⋮ A framework for proof systems ⋮ A proof-theoretical investigation of global intuitionistic (fuzzy) logic ⋮ A generalized proof-theoretic approach to logical argumentation based on hypersequents ⋮ Unnamed Item ⋮ Fast decision procedure for propositional Dummett logic based on a multiple premise tableau calculus ⋮ Algebraic proof theory: hypersequents and hypercompletions ⋮ Dialogue games for many-valued logics -- an overview ⋮ Fuzzy Logic and the Linz Seminar: Themes and Some Personal Reminiscences ⋮ Uniform proofs of standard completeness for extensions of first-order MTL ⋮ CUT ELIMINATION IN HYPERSEQUENT CALCULUS FOR SOME LOGICS OF LINEAR TIME ⋮ Expanding the Realm of Systematic Proof Theory ⋮ Models for the Displacement Calculus ⋮ A proof of the standard completeness for the involutive uninorm logic ⋮ Introduction: Non-classical Logics—Between Semantics and Proof Theory (In Relation to Arnon Avron’s Work) ⋮ Interpretations of Weak Positive Modal Logics ⋮ From semantic games to provability: the case of Gödel logic
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Linear logic
- On an implication connective of RM
- The semantics and proof theory of linear logic
- Gentzen-type systems, resolution and tableaux
- A propositional calculus with denumerable matrix
- A constructive analysis of RM
- Natural 3-valued logics—characterization and proof theory
- The correspondence between cut-elimination and normalization
- On the completenes principle: A study of provability in heyting's arithmetic and extensions
- Algebraic Completeness Results for Dummett's LC and Its Extensions
This page was built for publication: Hypersequents, logical consequence and intermediate logics for concurrency
