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. | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | No categories specified (fix it) | |||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,679 |
| External links |
  Try with proxy. |
| Through your library | Only published papers are available at libraries |
Similar books and articlesShmuel Lifsches & Saharon Shelah (1998). Uniformization and Skolem Functions in the Class of Trees. Journal of Symbolic Logic 63 (1):103-127.
Jaakko Hintikka (1998). Truth Definitions, Skolem Functions and Axiomatic Set Theory. Bulletin of Symbolic Logic 4 (3):303-337.
Thomas Strahm (1997). Polynomial Time Operations in Explicit Mathematics. Journal of Symbolic Logic 62 (2):575-594.
Yuri Gurevich & Saharon Shelah (1989). Time Polynomial in Input or Output. Journal of Symbolic Logic 54 (3):1083-1088.
Toshiyasu Arai (1998). Variations on a Theme by Weiermann. Journal of Symbolic Logic 63 (3):897-925.
Paulo A. S. Veloso & Sheila R. M. Veloso (2004). On Ultrafilter Logic and Special Functions. Studia Logica 78 (3):459 - 477.
Zlatan Damnjanovic (1995). Minimal Realizability of Intuitionistic Arithmetic and Elementary Analysis. Journal of Symbolic Logic 60 (4):1208-1241.
Jan Von Plato (2007). In the Shadows of the Löwenheim-Skolem Theorem: Early Combinatorial Analyses of Mathematical Proofs. Bulletin of Symbolic Logic 13 (2):189-225.
Lou van den Dries (1984). Algebraic Theories with Definable Skolem Functions. Journal of Symbolic Logic 49 (2):625-629.
Lou van Den Dries (1984). Algebraic Theories with Definable Skolem Functions. Journal of Symbolic Logic 49 (2):625 - 629.
Alexander George (1985). Skolem and the Löwenheim-Skolem Theorem: A Case Study of the Philosophical Significance of Mathematical Results. History and Philosophy of Logic 6 (1):75-89.
Erik Ellentuck (1970). Almost Combinatorial Skolem Functions. Journal of Symbolic Logic 35 (1):65-72.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2010-12-22Total downloads0Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
