Page 1

Displaying 1 – 14 of 14

Showing per page

A note on Δ₁ induction and Σ₁ collection

Neil Thapen (2005)

Fundamenta Mathematicae

Slaman recently proved that Σₙ collection is provable from Δₙ induction plus exponentiation, partially answering a question of Paris. We give a new version of this proof for the case n = 1, which only requires the following very weak form of exponentiation: " x y exists for some y sufficiently large that x is smaller than some primitive recursive function of y".

Arithmetization of the field of reals with exponentiation extended abstract

Sedki Boughattas, Jean-Pierre Ressayre (2008)

RAIRO - Theoretical Informatics and Applications


 (1) Shepherdson proved that a discrete unitary commutative semi-ring A+ satisfies IE0 (induction scheme restricted to quantifier free formulas) iff A is integral part of a real closed field; and Berarducci asked about extensions of this criterion when exponentiation is added to the language of rings. Let T range over axiom systems for ordered fields with exponentiation; for three values of T we provide a theory T in the language of rings plus exponentiation such that the ...

Currently displaying 1 – 14 of 14

Page 1