Eliminating definitions and Skolem functions

Abstract

two elements, one can eliminate definitions with a polynomial bound on the increase in proof length. In any classical first-order theory strong enough to code finite functions, including sequential theories, one can also eliminate Skolem functions with a polynomial bound on the increase in proof length.

Categories

Keywords

Reprint years

Links

PhilArchive



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

External links

  • This entry has no external links. Add one.
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.

My notes

Similar books and articles

Eliminating definitions and Skolem functions in first-order logic.Jeremy Avigad - manuscript
Eliminating definitions and Skolem functions in first-order logic.Jeremy Avigad - unknown
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.
Time polynomial in input or output.Yuri Gurevich & Saharon Shelah - 1989 - Journal of Symbolic Logic 54 (3):1083-1088.
Variations on a theme by Weiermann.Toshiyasu Arai - 1998 - Journal of Symbolic Logic 63 (3):897-925.
Minimal realizability of intuitionistic arithmetic and elementary analysis.Zlatan Damnjanovic - 1995 - Journal of Symbolic Logic 60 (4):1208-1241.
In the shadows of the löwenheim-Skolem theorem: Early combinatorial analyses of mathematical proofs.Jan von Plato - 2007 - Bulletin of Symbolic Logic 13 (2):189-225.
Algebraic theories with definable Skolem functions.Lou van den Dries - 1984 - Journal of Symbolic Logic 49 (2):625-629.
Algebraic Theories with Definable Skolem Functions.Lou van Den Dries - 1984 - Journal of Symbolic Logic 49 (2):625 - 629.
Skolem and the löwenheim-skolem theorem: a case study of the philosophical significance of mathematical results.Alexander George - 1985 - History and Philosophy of Logic 6 (1):75-89.
Almost combinatorial Skolem functions.Erik Ellentuck - 1970 - Journal of Symbolic Logic 35 (1):65-72.
A Language for Mathematical Knowledge Management.Steven Kieffer, Jeremy Avigad & Harvey Friedman - 2009 - Studies in Logic, Grammar and Rhetoric 18 (31).

Analytics

Added to PP
2010-12-22

Downloads
8 (#1,313,626)

6 months
1 (#1,464,097)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Jeremy Avigad
Carnegie Mellon University

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references