Skip Navigation


Logic Journal of IGPL Advance Access originally published online on August 8, 2009
Logic Journal of IGPL 2009 17(5):489-497; doi:10.1093/jigpal/jzp022
This Article
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
17/5/489    most recent
jzp022v1
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Dowek, G.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2009. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

This article appears in the following Logic Journal of the IGPL issue: Special Issue: Logical and Semantical Frameworks with Applications [View the issue table of contents]

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

Gilles Dowek

École polytechnique and INRIA, LIX, École polytechnique, 91128 Palaiseau Cedex, France.
E-mail: gilles.dowek{at}polytechnique.edu


  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.

Key Words: Cut elimination • reducibility candidates • models • truth values algebras

Received for publication 14 May 2008.
Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.