Results 1 
6 of
6
Improved Bounds on the Weak Pigeonhole Principle and Infinitely Many Primes from Weaker Axioms
, 2001
"... We show that the known boundeddepth proofs of the Weak Pigeonhole Principle PHP 2n n in size n O(log(n)) are not optimal in terms of size. More precisely, we give a sizedepth tradeoff upper bound: there are proofs of size n O(d(log(n)) 2=d ) and depth O(d). This solves an open problem ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
We show that the known boundeddepth proofs of the Weak Pigeonhole Principle PHP 2n n in size n O(log(n)) are not optimal in terms of size. More precisely, we give a sizedepth tradeoff upper bound: there are proofs of size n O(d(log(n)) 2=d ) and depth O(d). This solves an open problem of Maciel, Pitassi and Woods (2000). Our technique requires formalizing the ideas underlying Nepomnjascij's Theorem which might be of independent interest. Moreover, our result implies a proof of the unboundedness of primes in I \Delta 0 with a provably weaker `large number assumption' than previously needed.
Factorization in generalized power series
 Trans. Amer. Math. Soc
"... Abstract. The field of generalized power series with real coefficients and exponents in an ordered abelian divisible group G is a classical tool in the study of real closed fields. We prove the existence of irreducible elements in the ring R((G≤0)) consisting of the generalized power series with non ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract. The field of generalized power series with real coefficients and exponents in an ordered abelian divisible group G is a classical tool in the study of real closed fields. We prove the existence of irreducible elements in the ring R((G≤0)) consisting of the generalized power series with nonpositive exponents. The following candidate for such an irreducible series was given by Conway (1976): � n t−1/n + 1. Gonshor (1986) studied the question of the existence of irreducible elements and obtained necessary conditions for a series to be irreducible. We show that Conway’s series is indeed irreducible. Our results are based on a new kind of valuation taking ordinal numbers as values. If G =(R,+,0,≤) we can give the following test for irreducibility based only on the order type of the support of the series: if the order type is either ω or of the form ωωα and the series is not divisible by any monomial, then it is irreducible. To handle the general case we use a suggestion of M.H. Mourgues, based on an idea of Gonshor, which allows us to reduce to the special case G = R. In the final part of the paper we study the irreducibility of series with finite support. 1.
The Complexity of ResourceBounded Propositional Proofs
, 2001
"... Propositional Proof Complexity is an active area of research whose main focus is the study of the length of proofs in propositional logic. There are several motivations for such a study, the main of which is probably its connection to the P vs NP problem in Computational Complexity. The experience ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Propositional Proof Complexity is an active area of research whose main focus is the study of the length of proofs in propositional logic. There are several motivations for such a study, the main of which is probably its connection to the P vs NP problem in Computational Complexity. The experience
A BottomUp Approach to Foundations of Mathematics
"... this paper is to survey some results which should give an idea to an outsider of what is going on in this eld and explain motivations for the studied problems. We recommend [3, 5, 15, 11, 34] to those who want to learn more about this subject ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
this paper is to survey some results which should give an idea to an outsider of what is going on in this eld and explain motivations for the studied problems. We recommend [3, 5, 15, 11, 34] to those who want to learn more about this subject
Real closures of models of weak arithmetic
, 2011
"... D’Aquino et al. (J. Symb. Log. 75(1)(2010)) have recently shown that every realclosed field with an integer part satisfying the arithmetic theory IΣ4 is recursively saturated, and that this theorem fails if IΣ4 is replaced by I∆0. We prove that the theorem holds if IΣ4 is replaced by weak subtheori ..."
Abstract
 Add to MetaCart
D’Aquino et al. (J. Symb. Log. 75(1)(2010)) have recently shown that every realclosed field with an integer part satisfying the arithmetic theory IΣ4 is recursively saturated, and that this theorem fails if IΣ4 is replaced by I∆0. We prove that the theorem holds if IΣ4 is replaced by weak subtheories of Buss ’ bounded arithmetic: PV or Σ b 1IND xk. It also holds for I∆0 (and even its subtheory IE 2) under a rather mild assumption on cofinality. On the other hand, it fails for the extension of IOpen by an axiom expressing the Bézout property, even under the same assumption on cofinality. A discretely ordered subring A of a realclosed field (henceforth often: rcf) R is an integer part of R if for every r ∈ R there exists a ∈ A such that a ≤ r < a + 1. It is wellknown that every rcf has an integer part [MR93], which is then a model of the weak arithmetic theory IOpen (induction for quantifierfree formulas in the language of ordered rings). On the other hand, every model of IOpen is an integer part of its real closure (or, more precisely, the real closure of its fraction field). Recently, d’Aquino et al. [DKS10] studied the question which rcfs have integer parts satisfying more arithmetic, e.g. Peano Arithmetic. It turns out
Czech Republic Real closures of models of weak arithmetic
, 2011
"... D’Aquino et al. (J. Symb. Log. 75(1)(2010)) have recently shown that every realclosed field with an integer part satisfying the arithmetic theory IΣ4 is recursively saturated, and that this theorem fails if IΣ4 is replaced by I∆0. We prove that the theorem holds if IΣ4 is replaced by weak subtheori ..."
Abstract
 Add to MetaCart
D’Aquino et al. (J. Symb. Log. 75(1)(2010)) have recently shown that every realclosed field with an integer part satisfying the arithmetic theory IΣ4 is recursively saturated, and that this theorem fails if IΣ4 is replaced by I∆0. We prove that the theorem holds if IΣ4 is replaced by weak subtheories of Buss ’ bounded arithmetic: PV or Σ b 1IND xk. It also holds for I∆0 (and even its subtheory IE 2) under a rather mild assumption on cofinality. On the other hand, it fails for the extension of IOpen by an axiom expressing the Bézout property, even under the same assumption on cofinality. A discretely ordered subring A of a realclosed field (henceforth often: rcf) R is an integer part of R if for every r ∈ R there exists a ∈ A such that a ≤ r < a + 1. It is wellknown that every rcf has an integer part [MR93], which is then a model of the weak arithmetic theory IOpen (induction for quantifierfree formulas in the language of ordered rings). On the other hand, every model of IOpen is an integer part of its real closure (or, more precisely, the real closure of its fraction field). Recently, d’Aquino et al. [DKS10] studied the question which rcfs have integer parts satisfying more arithmetic, e.g. Peano Arithmetic. It turns out