Browsing Artículos (Ciencias de la Computación e Inteligencia Artificial) by Subject "Fragments of Peano arithmetic"
Now showing items 1-3 of 3
(The Association for Symbolic Logic, 2016)
We prove that the standard cut is definable in each existentially closed model of IΔ0 + exp by a (parameter free) П1–formula. This definition is optimal with respect to quantifier complexity and allows us to improve some ...
On axiom schemes for T-provably Δ1 formulas [Article](Springer, 2014)
This paper investigates the status of the fragments of Peano Arithmetic obtained by restricting induction, collection and least number axiom schemes to formulas which are Δ1 provably in an arithmetic theory T. In ...
Some Results on LΔ n+1 [Article](Wiley, 2001)
We study the quantifier complexity and the relative strength of some fragments of arithmetic axiomatized by induction and minimization schemes for Δn+1 formulas.