On the convergence of reduction-based and model-based methods in proof theory
From MaRDI portal
Publication:3644841
DOI10.1093/JIGPAL/JZP022zbMATH Open1183.03061OpenAlexW2032560163MaRDI QIDQ3644841FDOQ3644841
Publication date: 12 November 2009
Published in: Logic Journal of the IGPL (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/jigpal/jzp022
Recommendations
- On the convergence of reduction-based and model-based methods in proof theory
- scientific article; zbMATH DE number 7204561
- Confluence and convergence modulo equivalence in probabilistically terminating reduction systems
- scientific article; zbMATH DE number 1696761
- On Relating Theories: Proof-Theoretical Reduction
- A proof theory for model checking: an extended abstract
- Reduction of provability logics to \(\Sigma_1\)-provability logics
- An Implementation of the Model Elimination Proof Procedure
- A finite-model-theoretic view on propositional proof complexity
- REDUCTION TECHNIQUES FOR PROVING DECIDABILITY IN LOGICS AND THEIR MEET–COMBINATION
Other model constructions (03C30) Proof theory in general (including proof-theoretic semantics) (03F03) Cut-elimination and normal-form theorems (03F05) Mechanization of proofs and logical operations (03B35)
Cited In (7)
- Cut elimination for the unified logic
- Title not available (Why is that?)
- About folding-unfolding cuts and cuts modulo
- Truth Values Algebras and Proof Normalization
- A content semantics for quantified relevant logics. II
- Introduction to proof theory
- A Simple Proof That Super-Consistency Implies Cut Elimination
This page was built for publication: On the convergence of reduction-based and model-based methods in proof theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3644841)
