Proof analysis in intermediate logics
From MaRDI portal
Publication:661286
DOI10.1007/s00153-011-0254-7zbMath1241.03068OpenAlexW1968581827MaRDI QIDQ661286
Publication date: 10 February 2012
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00153-011-0254-7
Modal logic (including the logic of norms) (03B45) Cut-elimination and normal-form theorems (03F05) Proof theory in general (including proof-theoretic semantics) (03F03) Subsystems of classical logic (including intuitionistic logic) (03B20) Intermediate logics (03B55)
Related Items
Invited Talk: Coherentisation of First-Order Logic, A Sequent Calculus for Preferential Conditional Logic Based on Neighbourhood Semantics, Labeled sequent calculus for justification logics, CONDITIONAL BELIEFS: FROM NEIGHBOURHOOD SEMANTICS TO SEQUENT CALCULUS, Labeled sequent calculi for modal logics and implicit contractions, A comparison between monoidal and substructural logics, An ecumenical notion of entailment, Disentangling structural connectives or life without display property, Intermediate logics admitting a structural hypersequent calculus, Labelled calculi for lattice-based modal logics, The Gödel-McKinsey-Tarski embedding for infinitary intuitionistic logic and its extensions, Nested sequents for intermediate logics: the case of Gödel-Dummett logics, The intensional side of algebraic-topological representation theorems, The Church-Fitch knowability paradox in the light of structural proof theory, Monoidal logics: completeness and classical systems, Eliminability of cut in hypersequent calculi for some modal logics of linear frames, Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 8--14, 2020 (hybrid meeting), Intuitionistic Decision Procedures Since Gentzen, Through an Inference Rule, Darkly, Labelled sequent calculi for Lewis' non-normal propositional modal logics, Proofs and countermodels in non-classical logics, Unnamed Item, GEOMETRISATION OF FIRST-ORDER LOGIC, PROOF ANALYSIS FOR LEWIS COUNTERFACTUALS, Stoic Sequent Logic and Proof Theory, Meaning in Use, Constructive Embedding from Extensions of Logics of Strict Implication into Modal Logics, Inducing Syntactic Cut-Elimination for Indexed Nested Sequents, CUT AND GAMMA I: PROPOSITIONAL AND CONSTANT DOMAIN R, Geometric Rules in Infinitary Logic
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proof-theoretical analysis of order relations
- Proof analysis in modal logic
- Proof methods for modal and intuitionistic logics
- Interpolation properties of superintuitionistic logics
- Contraction-free sequent calculi for geometric theories with an application to Barr's theorem
- Proof theory of modal logic. Proceedings of a workshop, Hamburg, Germany, November 19--20, 1993
- Displaying modal logic
- Decision methods for linearly ordered Heyting algebras
- On the rules of intermediate logics
- A cut-free sequent system for Grzegorczyk logic, with an application to the Gödel–McKinsey–Tarski embedding
- Proof Analysis
- A completeness theorem in modal logic
- On Skolemization in constructive theories
- Expanding the Realm of Systematic Proof Theory
- Proof Search and Counter-Model Construction for Bi-intuitionistic Propositional Logic with Labelled Sequents
- Cut Elimination in the Presence of Axioms
- A deterministic terminating sequent calculus for Godel-Dummett logic
- Counting the maximal intermediate constructive logics
- Duplication-free tableau calculi and related cut-free sequent calculi for the interpolable propositional intermediate logics
- Proof systems for lattice theory
- A sequent calculus and a theorem prover for standard conditional logics
- Modal Logics Between S 4 and S 5
- THE CALCULUS OF THE WEAK "LAW OF EXCLUDED MIDDLE"
- Some theorems about the sentential calculi of Lewis and Heyting
