Assume T is a superstable theory with < 2ℵ0 countable models. We prove that any *- algebraic type of -rank > 0 is m-nonorthogonal to a *-algebraic type of -rank 1. We study the geometry induced by m-dependence on a *-algebraic type p* of -rank 1. We prove that after some localization this geometry becomes projective over a division ring . Associated with p* is a meager type p. We prove that p is determined by p* up to nonorthogonality and that underlies also the geometry induced by forking dependence on any stationarization of p. Also we study some *-algebraic *-groups of -rank 1 and prove that any *-algebraic *-group of -rank 1 is abelian-by-finite.

A positive answer to a question of M. van Lambalgen and D. Zambella whether there exist nonrecursive sets that are low for the class of random sets is obtained. Here a set A is low for the class RAND of random sets if RAND = RANDA.

Let {We}e∈ω be a standard enumeration of the recursively enumerable (r.e.) subsets of ω = {0,1,2,…}. The lattice of recursively enumerable sets, , is the structure ({We}e∈ω,∪,∩). ≡ is a congruence relation on if ≡ is an equivalence relation on and if for all U, U′ ∈ and V, V′ ∈ , if U ≡ U′ and V ≡ V′, then U ∪ V ≡ U′ ∪ V′ and U ∩ V ≡ U′ ∩ V′. [U] = {V ∈ | V ≡ U} is the equivalence class of U. If ≡ is a congruence relation on , the elements of the quotient lattice / ≡ are the equivalence classes of ≡. [U] ∪ [V] is defined as [U ∪ V], and [U] ∩ [V] is defined as [U ∩ V]. We say that a congruence relation ≡ on is if {(i, j)| Wi ≡ Wj} is . Define =* by putting Wi, =* Wj if and only if (Wi − Wj)∪ (Wj − Wi) is finite. Then =* is a congruence relation. If D is any set, then we can define a congruence relation by putting Wi Wj if and only if Wi ∩ D =* Wj ∩D. By Hammond [2], a congruence relation ≡ ⊇ =* is if and only if ≡ is equal to for some set D.

The Friedberg splitting theorem [1] asserts that if A is any recursively enumerable set, then there exist disjoint recursively enumerable sets A0 and A1 such that A = A0∪ A1 and such that for any recursively enumerable set B

We investigate the modal logic of interpretability over Peano arithmetic. Our main result is a compactness theorem that extends the arithmetical completeness theorem for the interpretability logic ILMω. This extension concerns recursively enumerable sets of formulas of interpretability logic (rather than single formulas). As corollaries we obtain a uniform arithmetical completeness theorem for the interpretability logic ILM and a partial answer to a question of Orey from 1961. After some simplifications, we also obtain Shavrukov's embedding theorem for Magari algebras (a.k.a. diagonalizable algebras).

D'après Lascar et Poizat [10], la déviation pour une théorie stable est associée à un préordre partiel sur l'ensemble des types. L'ordre induit a été nommé par Poizat ordre fondamental. Il mesure combien un type est loin d'être réalisé et il donne un certain nombre d'informations sur la théorie. Une question naturelle, est de décrire completément tous les ordres fondamentaux [13]. Il semble que cela soit difficile. Un problème moins ambitieux est de trouver des conditions pour qu'un ordre soit l'ordre fondamental d'une théorie, ou bien de trouver des exemples.

Le but de cet article est de trouver de nouveaux exemples d'ordres fondamentaux. Nous nous concentrons principalement sur les théories stables et 1-basées car, comme nous allons voir dans la Section 2, avec cette hypothèse, il y a une représentation simple de l'ordre fondamental grâce aux ensembles algébriquement clos d'éléments des modèles de la thé;orie considégrée. Dans la Section 3, nous généralisons une idée de Baldwin et Berman [2] pour construire de “nouveaux” exemples d'ordres fondamentaux. En combinant cette construction avec les résultats de la Section 2, on caractérise de manière complete les ordres fondamentaux de theories triviales et 1-basées: les blocs des ordres fondamentaux d'une théorie triviale et 1-basée sont les inverses des posets de la forme I(L)/G où L est un treillis distributif borné et G un groupe compact d'automorphismes localement fini de L. De plus, tout ordre partiel de cette forme est l'ordre fondamental d'une théorie triviale et 1-basá. En particulier, l'ordre fondamental n'est pas toujours un treillis.

In a 1969 paper, Quine coined the term ‘limits of decision”. This term evidently refers to limits on the logical vocabulary of a logic, beyond which satisfiability is no longer decidable. In the same paper, Quine showed that not only monadic formulas, but homogeneous k -adic formulas for arbitrary k lie on the decidable side of the limits of decision. But the precise location of the limits of decision has remained an open question. The present paper answers that question. It addresses the question of decidability of those sublogics of first-order logic that are defined in terms of their logical vocabularies. A complete answer is obtained, thus locating exactly Quine's limits of decision.

We will prove that there exists a model of ZFC+“c =” in which every M ⊆ ℝ of cardinality less than continuum c is meager, and such that for every X ⊆ ℝ of cardinality c there exists a continuous function f : ℝ → ℝ with f[X] = [0, 1].

In particular in this model there is no magic set, i.e., a set M ⊆ ℝ such that the equation f[M] = g[M] implies f = g for every continuous nowhere constant functions f,g: ℝ → ℝ.

In [15], [16] G. Kreisel introduced the no-counterexample interpretation (n.c.i.) of Peano arithmetic. In particular he proved, using a complicated ε-substitution method (due to W. Ackermann), that for every theorem A (A prenex) of first-order Peano arithmetic PA one can find ordinal recursive functionals of order type < ε0 which realize the Herbrand normal form AH of A.

Subsequently more perspicuous proofs of this fact via functional interpretation (combined with normalization) and cut-elimination were found. These proofs however do not carry out the no-counterexample interpretation as a local proof interpretation and don't respect the modus ponens on the level of the nocounterexample interpretation of formulas A and A → B. Closely related to this phenomenon is the fact that both proofs do not establish the condition (δ) and—at least not constructively—(γ) which are part of the definition of an ‘interpretation of a formal system’ as formulated in [15].

We calculate the Cantor-Bendixson rank of the Ziegler spectrum over a commutative valuation domain R proving that it is equal to the double Krull dimension of R.

First we prove that the set of countable linear orders of the form I + I form a complete analytic set. As a consequence of this we improve a result of Humke and Laczkovich, who showed in [HL] that the set of functions of the form f º f form a true analytic set in C[0,1]. We show that these functions form a complete analytic set, solving a problem mentioned on p. 215 of [Kl] and on p. 4 of [B]

We give some general criteria, when κ-complete forcing preserves largeness properties—like κ-presaturation of normal ideals on λ (even when they concentrate on small cofinalities). Then we quite accurately obtain the consistency strength “NSλ is αi-preserving”, for λ > α2.

Call a family of subsets of a set E inductive if and is closed under unions with disjoint singletons, that is, if

A Frege structure is a pair (E, ν) with ν a map to E whose domain dom(ν) is an inductive family of subsets of E such that

In [2] it is shown in a constructive setting that each Frege structure determines a subset which is the domain of a model of Peano's axioms. In this note we establish, within the same constructive setting, three facts. First, we show that the least inductive family of subsets of a set E is precisely the family of decidable Kuratowski finite subsets of E. Secondly, we establish that the procedure presented in [2] can be reversed, that is, any set containing the domain of a model of Peano's axioms determines a map which turns the set into a minimal Frege structure: here by a minimal Frege structure is meant one in which dom(ν) is the least inductive family of subsets of E. And finally, we show that the procedures leading from minimal Frege structures to models of Peano's axioms and vice-versa are mutually inverse. It follows that the postulation of a (minimal) Frege structure is constructively equivalent to the postulation of a model of Peano's axioms.

All arguments will be formulated within constructive (intuitionistic) set theory.

We answer a question of Cassidy and Kolchin about the universality of the constrained closure of a differential field by working in a larger category of models.

The aim of this paper is to give a new proof for the decidability and finite model property of first-order logic with two variables (without function symbols), using a combinatorial theorem due to Herwig. The results are proved in the framework of polyadic equality set algebras of dimension two (Pse2). The new proof also shows the known results that the universal theory of Pse2 is decidable and that every finite Pse2 can be represented on a finite base. Since the class Cs2 of cylindric set algebras of dimension 2 forms a reduct of Pse2, these results extend to Cs2 as well.

It is shown that the constructive four-valued logic N4 can be faithfully embedded into the modal logic S4. This embedding is used to obtain complete, cut-free display sequent calculi for N4 and C4, the modal logic of consistency over N4. C4 is a natural monotonic base system for semantics-based non-monotonic reasoning.

In 1970, Kenneth Kunen showed that there is no non-trivial elementary embedding of the universe V into itself [2] using the axiom of choice. Kunen remarked in his paper that the result can be formalized in Morse-Kelley theory of sets and classes. In this paper, we will work within ZF, Zermelo-Fraenkel axioms, and deal with embeddings definable with a formula and a parameter.

In ZF, a “class” is usually synonymous with “property”, that is a class definable with a parameter, C = {x: φ(x,p)}, where φ is a formula in the language [∈}. Using this convention, let j be a class. Then “j is an elementary embedding of V into V” is not a single statement but a schema of statements “j preserves ψ” for each formula ψ. We prove that this schema is expressible in the language {∈} by a single formula:

Lemma. An embedding j: V → V is elementary iff j preservesψ.

Here ψ(α, ψ, a) is the property “a is an ordinal, φ is a formula and Vα.”

The lemma is of course a schema of lemmas, one for each formula denning j and for each ψ to be preserved.

Using this we prove our theorem in ZF (again, a schema of theorems.):

Theorem 1.1. There is no nontrivial definable elementary embedding j: V → V.

Many symbols and their definitions follow those used by Drake's book [1]. The formula Sat expresses the satisfaction relation . The formula Fmla(u) expresses that u is the Gödel-set for a formula.

We show that a formula φ(x, y) is stable if and only if φ is the pairing map on the unit ball of E × E*, where E is a reflexive Banach space. The result remains true if the formula φ is replaced by a set of formulas .

For a canonical model of set theory whose projective theory of the real numbers is stable under set forcing extensions, a set of reals of minimal complexity is constructed which fails to be universally Baire. The construction uses a general method for generating non-universally Baire sets via the Levy collapse of a cardinal, as well as core model techniques. Along the way it is shown (extending previous results of Steel) how sufficiently iterable fine structure models recognize themselves as global core models.

Let CH be the class of compacta (i.e., compact Hausdorff spaces), with BS the subclass of Boolean spaces. For each ordinal α and pair (K, L) of subclasses of CH, we define Lev≥α(K, L), the class of maps of level at least α from spaces in K to spaces in L, in such a way that, for finite α, Lev≥α(BS, BS) consists of the Stone duals of Boolean lattice embeddings that preserve all prenex first-order formulas of quantifier rank α. Maps of level ≥ 0 are just the continuous surjections, and the maps of level ≥ 1 are the co-existential maps introduced in [8]. Co-elementary maps are of level ≥ω a for all ordinals α: of course in the Boolean context, the co-elementary maps coincide with the maps of level ≥ ω. The results of this paper include:

(i) every map of level ≥ ωis co-elementary;

(ii) the limit maps of an co-indexed inverse system of maps of level ≥ α are also of level ≥ α; and

(iii) if K is a co-elementary class, k > ω and Lev≥k(K,K) = Lev≥k+1(K,K), then Lev≥1(K,K) = Lev≥(K,K).

A space X ∈ K is co-existentially closed inK if Lev≥0(K, X) = Lev≥1(K,X). Adapting the technique of “adding roots,” by which one builds algebraically closed extensions of fields (and, more generally, existentially closed extensions of models of universal-existential theories), we showed in [8] that every infinite member of a co-inductive co-elementary class (such as CH itself, BS, or the class CON of continua) is a continuous image of a space of the same weight that is co-existentially closed in that class. We show here that every compactum that is co-existentially closed in CON (a co-existentially closed continuum) is both indecomposable and of covering dimension one.

A bounded ultrasheaf is a nonstandard universe constructed from a superstructure in a Boolean valued model of set theory. We consider the bounded elementary embeddings between bounded ultrasheaves. Then the standardization principle is true if and only if the ultrafilters are comparable by the Rudin-Frolik order. The base concept is that the bounded elementary embeddings correspond to the complete Boolean homomorphisms. We represent this by the Rudin-Keisler order of ultrafilters of Boolean algebras.