We characterize the sets of all Π2 and all $\mathcal {B}(\Sigma _{1})$equation image (= Boolean combinations of Σ1) theorems of IΠ−1 in terms of restricted exponentiation, and use these characterizations to prove that both sets are not deductively equivalent. We also discuss how these results generalize to n > 0. As an application, we prove that a conservation theorem of Beklemishev stating that IΠ−n + 1 is conservative over IΣ−n with respect to $\mathcal {B}(\Sigma _{n+1})$equation image sentences cannot be extended to Πn + 2 sentences.Ministerio de Educación y Ciencia MTM2005-08658Ministerio de Educación y Ciencia MTM2008-0643
AbstractWe study a normal ideal on Pκ(λ) that is defined in terms of games (of length ω)
AbstractThe paper deals with the problem of ideals of H∞: describe increasing functions φ⩾0 such tha...
In this article, we present four issues and provide a creative and concise proof for each of them. T...
By a theorem of R. Kaye, J. Paris and C. Dimitracopoulos, the class of the ¦n+1–sentences true in t...
This paper investigates the status of the fragments of Peano Arithmetic obtained by restricting indu...
In this paper we continue the study of the theories IΔ n+1 (T), initiated in [7]. We focus on the qu...
We prove that the standard cut is definable in each existentially closed model of IΔ0 + exp by a (pa...
Let I¦− 2 denote the fragment of Peano Arithmetic obtained by restricting the induction scheme to ...
An important feature of a Poisson limit theorem in [4] is the absence of the traditional assumption ...
Given a fixed number field K, we give non-trivial lower bounds for the distance between the conjugat...
Postprint version; to appear in Algebra and Number TheoryPostprint version; to appear in Algebra and...
AbstractWe prove a lemma that is useful for obtaining upper bounds for the number of partitions with...
Let $s \geq 3$ be a natural number, let $\psi(x)$ be a polynomial with real coefficients and degree ...
We study the complexity of proof systems augmenting resolution with inference rules that allow, give...
We study a generalized version of Terao's famous addition theorem for free arrangements to the categ...
AbstractWe study a normal ideal on Pκ(λ) that is defined in terms of games (of length ω)
AbstractThe paper deals with the problem of ideals of H∞: describe increasing functions φ⩾0 such tha...
In this article, we present four issues and provide a creative and concise proof for each of them. T...
By a theorem of R. Kaye, J. Paris and C. Dimitracopoulos, the class of the ¦n+1–sentences true in t...
This paper investigates the status of the fragments of Peano Arithmetic obtained by restricting indu...
In this paper we continue the study of the theories IΔ n+1 (T), initiated in [7]. We focus on the qu...
We prove that the standard cut is definable in each existentially closed model of IΔ0 + exp by a (pa...
Let I¦− 2 denote the fragment of Peano Arithmetic obtained by restricting the induction scheme to ...
An important feature of a Poisson limit theorem in [4] is the absence of the traditional assumption ...
Given a fixed number field K, we give non-trivial lower bounds for the distance between the conjugat...
Postprint version; to appear in Algebra and Number TheoryPostprint version; to appear in Algebra and...
AbstractWe prove a lemma that is useful for obtaining upper bounds for the number of partitions with...
Let $s \geq 3$ be a natural number, let $\psi(x)$ be a polynomial with real coefficients and degree ...
We study the complexity of proof systems augmenting resolution with inference rules that allow, give...
We study a generalized version of Terao's famous addition theorem for free arrangements to the categ...
AbstractWe study a normal ideal on Pκ(λ) that is defined in terms of games (of length ω)
AbstractThe paper deals with the problem of ideals of H∞: describe increasing functions φ⩾0 such tha...
In this article, we present four issues and provide a creative and concise proof for each of them. T...