Proofs and countermodels in non-classical logics
From MaRDI portal
Publication:2254557
DOI10.1007/s11787-014-0097-1zbMath1339.03046OpenAlexW2014812345MaRDI QIDQ2254557
Publication date: 5 February 2015
Published in: Logica Universalis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11787-014-0097-1
completenessintuitionistic logicprovability logiccorrespondenceproof searchnon-classical logicsgeometric ruleslabelled sequent calculicountermodelsmulti-modal logicsSahlqvist
Modal logic (including the logic of norms) (03B45) Proof theory in general (including proof-theoretic semantics) (03F03) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45) Intermediate logics (03B55)
Related Items
Cut-elimination for provability logic by terminating proof-search: formalised and deconstructed using Coq, A Sequent Calculus for Preferential Conditional Logic Based on Neighbourhood Semantics, Intuitionistic games: determinacy, completeness, and normalization, Mechanising Gödel-Löb provability logic in HOL light, The intensional side of algebraic-topological representation theorems, Intuitionistic Decision Procedures Since Gentzen, A conservative negation extension of positive semilattice logic without the finite model property, GEOMETRISATION OF FIRST-ORDER LOGIC, PROOF ANALYSIS FOR LEWIS COUNTERFACTUALS, Proof-theoretic analysis of the logics of agency: the deliberative STIT, CUT AND GAMMA I: PROPOSITIONAL AND CONSTANT DOMAIN R, Geometric Rules in Infinitary Logic, Modular sequent calculi for classical modal logics
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
- Unnamed Item
- Labeled sequent calculi for modal logics and implicit contractions
- Does the deduction theorem fail for modal logic?
- Prefixed tableaus and nested sequents
- Reasoning about collectively accepted group beliefs
- Proof analysis in intermediate logics
- Dual tableaux. Foundations, methodology, case studies
- Sequent calculi and decidability for intuitionistic hybrid logic
- Proof analysis in modal logic
- Deep sequent systems for modal logic
- Gentzen calculi for modal propositional logic
- Proof theory. 2nd ed
- TABLEAUX: A general theorem prover for modal logics
- Cut-free sequent calculi for some tense logics
- Refutation systems in modal logic
- Propositional lax logic
- Indexed systems of sequents and cut-elimination
- Contraction-free sequent calculi for geometric theories with an application to Barr's theorem
- Natural deduction for non-classical logics
- Single step tableaux for modal logics. Computational properties, complexity and methodology
- Proof-theoretic semantics, self-contradiction, and the format of deductive reasoning
- Contraction-free linear depth sequent calculi for intuitionistic propositional logic with the subformula property and minimal depth counter-models
- The Church-Fitch knowability paradox in the light of structural proof theory
- A general filtration method for modal logics
- A cut-free sequent system for Grzegorczyk logic, with an application to the Gödel–McKinsey–Tarski embedding
- New Essays on the Knowability Paradox
- Countermodels from Sequent Calculi in Multi-Modal Logics
- Proof Analysis
- Ein System des Verknüpfenden Schliessens
- Clausal Tableaux for Multimodal Logics of Belief
- Combining Derivations and Refutations for Cut-free Completeness in Bi-intuitionistic Logic
- Decidability for Priorean Linear Time Using a Fixed-Point Labelled Calculus
- Contraction-free sequent calculi for intuitionistic logic
- Translation of hypersequents into display sequents
- Cut Elimination in the Presence of Axioms
- A proof-theoretic study of the correspondence of classical logic and modal logic
- Hypersequent Calculi for Godel Logics -- a Survey
- Internalizing labelled deduction
- Modal Logics Between S 4 and S 5
- Proof analysis beyond geometric theories: from rule systems to systems of rules
- Some theorems about the sentential calculi of Lewis and Heyting
- A PURELY SYNTACTIC AND CUT-FREE SEQUENT CALCULUS FOR THE MODAL LOGIC OF PROVABILITY
