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.

Other Versions

unknown Avigad, Jeremy (unknown) "Eliminating definitions and Skolem functions in first-order logic".

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,297

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

Analytics

Added to PP
2009-01-28

Downloads
86 (#245,076)

6 months
6 (#879,768)

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