Update Procedures and the 1-Consistency of Arithmetic
| Abstract | The 1-consistency of arithmetic is shown to be equivalent to the existence of fixed points of a certain type of update procedure, which is implicit in the epsilon-substitution method | |||||||||
| 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,709 |
| External links |
  Try with proxy. Try with proxy. Try with proxy. |
| Through your library | Only published papers are available at libraries |
Similar books and articlesLeszek Aleksander Kołodziejczyk (2006). On the Herbrand Notion of Consistency for Finitely Axiomatizable Fragments of Bounded Arithmetic Theories. Journal of Symbolic Logic 71 (2):624 - 638.
Dan E. Willard (2006). On the Available Partial Respects in Which an Axiomatization for Real Valued Arithmetic Can Recognize Its Consistency. Journal of Symbolic Logic 71 (4):1189 - 1199.
P. Garavaso (forthcoming). Hilary Putnam's Consistency Objection Against Wittgenstein's Conventionalism in Mathematics. Philosophia Mathematica.
Arnold Beckmann (2002). Proving Consistency of Equational Theories in Bounded Arithmetic. Journal of Symbolic Logic 67 (1):279-296.
Franz Huber (2007). The Consistency Argument for Ranking Functions. Studia Logica 86 (2):299-329.
Jessica M. Wilson (2000). Could Experience Disconfirm the Propositions of Arithmetic? Canadian Journal of Philosophy 30 (1):55-84.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2010-09-14Total downloads1 ( #275,053 of 550,967 )Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
