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

Logic Journal of the IGPL 17 (5):489-497 (2009)
  Copy   BIBTEX

Abstract

In the recent past, the reduction-based and the model-based methods to prove cut elimination have converged, so that they now appear just as two sides of the same coin. This paper details some of the steps of this transformation.

Categories

Keywords

Reprint years

DOI

10.1093/jigpal/jzp022

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,610

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Identity-Based Reduction and Reductive Explanation.Raphael van Riel - 2010 - Philosophia Naturalis 47 (1-2):183-219.
Nagelian Reduction Beyond the Nagel Model.Raphael van Riel - 2011 - Philosophy of Science 78 (3):353-375.
Developmental issues in model-based reasoning during childhood.Patricia H. Miller - 2001 - Mind and Society 2 (2):49-58.
Approaches to reduction.Kenneth F. Schaffner - 1967 - Philosophy of Science 34 (2):137-147.
Efficient, Feature-based, Conditional Random Field Parsing.Christopher D. Manning - unknown
Regressive Merging in Model Elimination Tableau-Based Theorem Provers.Kevin Wallace & Graham Wrightson - 1995 - Logic Journal of the IGPL 3 (6):921-937.
Cut-Elimination: Syntax and Semantics.M. Baaz & A. Leitsch - 2014 - Studia Logica 102 (6):1217-1244.
Theorienreduktion in den sozialwissenschaften. Eine fallstudie am beispiel der balancetheorien.Klaus Manhart - 1998 - Journal for General Philosophy of Science / Zeitschrift für Allgemeine Wissenschaftstheorie 29 (2):301-326.
Analytic proof systems for λ-calculus: the elimination of transitivity, and why it matters. [REVIEW]Pierluigi Minari - 2007 - Archive for Mathematical Logic 46 (5-6):385-424.
Some Connections between Topological and Modal Logic.Kurt Engesser - 1995 - Mathematical Logic Quarterly 41 (1):49-64.
On distance-based inconsistency reduction algorithms for pairwise comparisons.W. W. Koczkodaj & S. J. Szarek - 2010 - Logic Journal of the IGPL 18 (6):859-869.
On Reduction Rules, Meaning-as-Use, and Proof-Theoretic Semantics.Ruy J. G. B. de Queiroz - 2008 - Studia Logica 90 (2):211 - 247.
On reduction rules, meaning-as-use, and proof-theoretic semantics.Ruy J. G. B. de Queiroz - 2008 - Studia Logica 90 (2):211-247.
Model-Based Reasoning in Scientific Discovery.L. Magnani, Nancy Nersessian & Paul Thagard (eds.) - 1999 - Kluwer/Plenum.
Identity of proofs based on normalization and generality.Kosta Došen - 2003 - Bulletin of Symbolic Logic 9 (4):477-503.

Analytics

Added to PP
2015-02-04

Downloads
9 (#1,247,499)

6 months
3 (#962,966)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Intensional interpretations of functionals of finite type I.W. W. Tait - 1967 - Journal of Symbolic Logic 32 (2):198-212.
Resolution in type theory.Peter B. Andrews - 1971 - Journal of Symbolic Logic 36 (3):414-432.
Hauptsatz for higher order logic.Dag Prawitz - 1968 - Journal of Symbolic Logic 33 (3):452-457.
Proof normalization modulo.Gilles Dowek & Benjamin Werner - 2003 - Journal of Symbolic Logic 68 (4):1289-1316.
Stratification and cut-elimination.Marcel Crabbé - 1991 - Journal of Symbolic Logic 56 (1):213-226.

Add more references