On the convergence of reduction-based and model-based methods in proof theory

DOI10.1093/JIGPAL/JZP022zbMATH Open1183.03061OpenAlexW2032560163MaRDI QIDQ3644841FDOQ3644841

Gilles Dowek

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

zbMATH Keywords

cut eliminationdeduction modulotruth values algebra

Mathematics Subject Classification ID

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 (4)

• Cut elimination for the unified logic
• Title not available (Why is that?)
• About folding-unfolding cuts and cuts modulo
• A content semantics for quantified relevant logics. II

   Recommendations

• On the convergence of reduction-based and model-based methods in proof theory 👍 👎
• Title not available (Why is that?) 👍 👎
• Confluence and convergence modulo equivalence in probabilistically terminating reduction systems 👍 👎
• Title not available (Why is that?) 👍 👎
• On Relating Theories: Proof-Theoretical Reduction 👍 👎
• Title not available (Why is that?) 👍 👎
• Reduction of provability logics to Σ₁-provability logics 👍 👎
• An Implementation of the Model Elimination Proof Procedure 👍 👎
• Title not available (Why is that?) 👍 👎
• REDUCTION TECHNIQUES FOR PROVING DECIDABILITY IN LOGICS AND THEIR MEET–COMBINATION 👍 👎

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)