On the convergence of reduction-based and model-based methods in proof theory
From MaRDI portal
Publication:3644841
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
Cited in
(11)- On the convergence of reduction-based and model-based methods in proof theory
- The possibility of analysis: convergence and proofs of convergence
- Semantic A-translations and super-consistency entail classical cut elimination
- A content semantics for quantified relevant logics. II
- About folding-unfolding cuts and cuts modulo
- A simple proof that super-consistency implies cut elimination
- Cut elimination for the unified logic
- scientific article; zbMATH DE number 4066873 (Why is no real title available?)
- Truth Values Algebras and Proof Normalization
- A Simple Proof That Super-Consistency Implies Cut Elimination
- Introduction to proof theory
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)
