1,830 research outputs found
Induction, minimization and collection for Δ n+1 (T)–formulas
For a theory T, we study relationships among IΔ n +1 (T), LΔ n+1 (T) and B * Δ n+1 (T). These theories are obtained restricting the schemes of induction, minimization and (a version of) collection to Δ n+1 (T) formulas. We obtain conditions on T (T is an extension of B * Δ n+1 (T) or Δ n+1 (T) is closed (in T) under bounded quantification) under which IΔ n+1 (T) and LΔ n+1 (T) are equivalent. These conditions depend on Th Πn +2 (T), the Π n+2 –consequences of T. The first condition is connected with descriptions of Th Πn +2 (T) as IΣ n plus a class of nondecreasing total Π n –functions, and the second one is related with the equivalence between Δ n+1 (T)–formulas and bounded formulas (of a language extending the language of Arithmetic). This last property is closely tied to a general version of a well known theorem of R. Parikh. Using what we call Π n –envelopes we give uniform descriptions of the previous classes of nondecreasing total Π n –functions. Π n –envelopes are a generalization of envelopes (see [10]) and are closely related to indicators (see [12]). Finally, we study the hierarchy of theories IΔ n+1 (IΣ m ), m≥n, and prove a hierarchy theorem.Ministerio de Educación y Cultura DGES PB96-134
Constructing regular ultrafilters from a model-theoretic point of view
This paper contributes to the set-theoretic side of understanding Keisler's
order. We consider properties of ultrafilters which affect saturation of
unstable theories: the lower cofinality \lcf(\aleph_0, \de) of
modulo \de, saturation of the minimum unstable theory (the random graph),
flexibility, goodness, goodness for equality, and realization of symmetric
cuts. We work in ZFC except when noted, as several constructions appeal to
complete ultrafilters thus assume a measurable cardinal. The main results are
as follows. First, we investigate the strength of flexibility, detected by
non-low theories. Assuming is measurable, we construct a
regular ultrafilter on which is flexible (thus: ok) but
not good, and which moreover has large \lcf(\aleph_0) but does not even
saturate models of the random graph. We prove that there is a loss of
saturation in regular ultrapowers of unstable theories, and give a new proof
that there is a loss of saturation in ultrapowers of non-simple theories.
Finally, we investigate realization and omission of symmetric cuts, significant
both because of the maximality of the strict order property in Keisler's order,
and by recent work of the authors on . We prove that for any , assuming the existence of measurable cardinals below ,
there is a regular ultrafilter on such that any -ultrapower of
a model of linear order will have alternations of cuts, as defined below.
Moreover, will -saturate all stable theories but will not
-saturate any unstable theory, where is the smallest
measurable cardinal used in the construction.Comment: 31 page
Workshop on Verification and Theorem Proving for Continuous Systems (NetCA Workshop 2005)
Oxford, UK, 26 August 200
- …