Eliminating definitions and Skolem functions in first-order logic

Abstract

From proofs in any classical first-order theory that proves the existence of at least two elements, one can eliminate definitions in polynomial time. From proofs in any classical first-order theory strong enough to code finite functions, including sequential theories, one can also eliminate Skolem functions in polynomial time.

Links

PhilArchive



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

External links

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

Through your library

  • Only published works are available at libraries.

Similar books and articles

A feasible theory for analysis.Fernando Ferreira - 1994 - Journal of Symbolic Logic 59 (3):1001-1011.
Truth definitions, Skolem functions and axiomatic set theory.Jaakko Hintikka - 1998 - Bulletin of Symbolic Logic 4 (3):303-337.
Polynomial time operations in explicit mathematics.Thomas Strahm - 1997 - Journal of Symbolic Logic 62 (2):575-594.
A compact representation of proofs.Dale A. Miller - 1987 - Studia Logica 46 (4):347 - 370.
Higher Order Modal Logic.Reinhard Muskens - 2006 - In Patrick Blackburn, Johan Van Benthem & Frank Wolter (eds.), Handbook of Modal Logic. Elsevier. pp. 621-653.

Analytics

Added to PP
2009-01-28

Downloads
79 (#210,413)

6 months
6 (#510,793)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Jeremy Avigad
Carnegie Mellon University

Citations of this work

Number theory and elementary arithmetic.Jeremy Avigad - 2003 - Philosophia Mathematica 11 (3):257-284.
On lengths of proofs in non-classical logics.Pavel Hrubeš - 2009 - Annals of Pure and Applied Logic 157 (2-3):194-205.
Non‐elementary speed‐ups in logic calculi.Toshiyasu Arai - 2008 - Mathematical Logic Quarterly 54 (6):629-640.

Add more citations

References found in this work

Mathematical logic.Joseph R. Shoenfield - 1967 - Reading, Mass.,: Addison-Wesley.
Grundlagen der Mathematik.S. C. Kleene - 1940 - Journal of Symbolic Logic 5 (1):16-20.
Formalizing forcing arguments in subsystems of second-order arithmetic.Jeremy Avigad - 1996 - Annals of Pure and Applied Logic 82 (2):165-191.

View all 9 references / Add more references