§1. Introduction. This paper considers several complexity questions regarding Borel automorphisms of a Polish space. Recall that a Borel automorphism is a bijection of the space with itself whose graph is a Borel set (equivalently, the inverse image of any Borel set is Borel). Since the inverse of a Borel automorphism is another Borel automorphism, as is the composition of two Borel automorphisms, the set of Borel automorphisms of a given Polish space forms a group under the operation of composition. We can also consider the class of automorphisms of all Polish spaces. We will be primarily concerned here with the following notion of equivalence:

Definition 1.1. Two Borel automorphisms f and g of the Polish spaces X and Y are said to be Borel isomorphic, f ≅ g, if they are conjugate, i.e. there is a Borel bijection φ: X → Y such that φ ∘ f = g ∘ φ.

We restrict ourselves to automorphisms of uncountable Polish spaces, as the Borel automorphisms of a countable space are simply the permutations of the space. Since any two uncountable Polish spaces are Borel isomorphic, any Borel automorphism is Borel isomorphic to some automorphism of a fixed space. Hence, up to Borel isomorphism we can fix a Polish space and represent any Borel automorphism as an automorphism of this space. We will use the Cantor space 2ω (with the product topology) as our representative space.

We give an application of the extender based Radin forcing to cardinal arithmetic. Assuming κ is a large enough cardinal we construct a model satisfying 2κ = κ+n together with 2λ = λ+n for each cardinal λ < κ, where 0 < n < ω. The cofinality of κ can be set arbitrarily or κ can remain inaccessible.

When κ remains an inaccessible, Vκ is a model of ZFC satisfying 2λ = λ+n for all cardinals λ.

We introduce and discuss a concept of approximation of a topological algebraic system A by finite algebraic systems from a given class . If A is discrete, this concept agrees with the familiar notion of a local embedding of A in a class of algebraic systems. One characterization of this concept states that A is locally embedded in iff it is a subsystem of an ultraproduct of systems from . In this paper we obtain a similar characterization of approximability of a locally compact system A by systems from using the language of nonstandard analysis.

In the signature of A we introduce positive bounded formulas and their approximations; these are similar to those introduced by Henson [14] for Banach space structures (see also [15, 16]). We prove that a positive bounded formula φ holds in A if and only if all precise enough approximations of φ hold in all precise enough approximations of A.

We also prove that a locally compact field cannot be approximated arbitrarily closely by finite (associative) rings (even if the rings are allowed to be non-commutative). Finite approximations of the field ℝ can be considered as possible computer systems for real arithmetic. Thus, our results show that there do not exist arbitrarily accurate computer arithmetics for the reals that are associative rings.

The full-background-extender Kc -construction of [2] has the property that, if it does not break down and produces a final model , then

Ή is Woodin in V ⇒ Ή is Woodin in ,

for all Ή. It is natural to ask whether

κ is strong in V ⇒ κ is λ-strong in ,

for all κ, or even better,

κ is λ-strong in V ⇒ κ is λ-strong in .

As one might suspect, the more useful answer would be “yes”.

For the Kc-construction of [2], this question is open. The problem is that the construction of [2] is not local: because of the full-background-extender demand, it may produce mice projecting to ρ at stages much greater than ρ. Because of this, there is no reason to believe that if E is a λ-strong extender of V, then The natural proof only gives that if κ is Σ2-strong, then Σ, is strong in .

We do not know how to get started on this question, and suspect that in fact strong cardinals in V may fail to be strong in , if is the output of the construction of [2]. Therefore, we shall look for a modification of the construction of [2]. One might ask for a construction with output such that

(1) iteration trees on can be lifted to iteration trees on V,

(2) ∀δ(δ is Woodin ⇒ δ is Woodin in ), and

(3) (a) ↾κ(κ is a strong cardinal ⇒ κ is strong in ), and (b) ↾κ↾λ(Lim(λ) Λ κ is λ-strong ⇒ κ is λ-strong in ).

We investigate the relation between intermediate predicate logics based on countable linear Kripke frames with constant domains and Gödel logics. We show that for any such Kripke frame there is a Gödel logic which coincides with the logic defined by this Kripke frame on constant domains and vice versa. This allows us to transfer several recent results on Gödel logics to logics based on countable linear Kripke frames with constant domains: We obtain a complete characterisation of axiomatisability of logics based on countable linear Kripke frames with constant domains. Furthermore, we obtain that the total number of logics defined by countable linear Kripke frames on constant domains is countable.

In this paper we consider classes of finite structures where we have good control over the sizes of the definable sets. The motivating example is the class of finite fields: it was shown in [1] that for any formula in the language of rings, there are finitely many pairs (d, μ) ∈ ω × Q>0 so that in any finite field F and for any ā ∈ Fm the size |ø(Fn,ā)| is “approximately” μ|F|d. Essentially this is a generalisation of the classical Lang-Weil estimates from the category of varieties to that of the first-order-definable sets.

Consider a general class of structural inference rules such as exchange, weakening, contraction and their generalizations. Among them, some are harmless but others do harm to cut elimination. Hence it is natural to ask under which condition cut elimination is preserved when a set of structural rules is added to a structure-free logic. The aim of this work is to give such a condition by using algebraic semantics.

We consider full Lambek calculus (FL), i.e., intuitionistic logic without any structural rules, as our basic framework. Residuated lattices are the algebraic structures corresponding to FL. In this setting, we introduce a criterion, called the propagation property, that can be stated both in syntactic and algebraic terminologies. We then show that, for any set ℛ of structural rules, the cut elimination theorem holds for FL enriched with ℛ if and only if ℛ satisfies the propagation property.

As an application, we show that any set ℛ of structural rules can be “completed” into another set ℛ*, so that the cut elimination theorem holds for FL enriched with ℛ*. while the provability remains the same.

Let T be an infinite pseudo-tree. In [2], we showed that the cellularity of the pseudo-tree algebra Treealg(T) was the maximum of four cardinals cT, lT, ϕT, and μT: roughly, cT is the “tallness” of T: lT is the “width” of T, ϕ is the number of “points of finite branching” in T: and μ is the number of “sections of no branching” in T. Here we ask: which inequalities among these four cardinals may be satisfied, in some sense, by a pseudo-tree? We show that the possible inequalities among cT, lT, ϕT, and μT attained by pseudo-trees T are closely related to the existence of generalized Suslin trees.

Let M = 〈M, +, <, 0, {λ}λЄD〉 be an ordered vector space over an ordered division ring D, and G = 〈G, ⊕, eG〉 an n-dimensional group definable in M. We show that if G is definably compact and definably connected with respect to the t-topology, then it is definably isomorphic to a ‘definable quotient group’ U/L, for some convex V-definable subgroup U of 〈Mn, +〉 and a lattice L of rank n. As two consequences, we derive Pillay's conjecture for a saturated M as above and we show that the o-minimal fundamental group of G is isomorphic to L.

The pointwise ergodic theorem is nonconstructive. In this paper, we examine origins of this non-constructivity, and determine the logical strength of the theorem and of the auxiliary statements used to prove it. We discuss properties of integrable functions and of measure preserving transformations and give three proofs of the theorem, though mostly focusing on the one derived from the mean ergodic theorem. All the proofs can be carried out in ACA0; moreover, the pointwise ergodic theorem is equivalent to (ACA) over the base theory RCA0.

Generic automorphisms of certain homogeneous structures are considered, for instance, the rationals as an ordered set, the countable universal homogeneous partial order, and the random graph. Two of these cases were discussed in [7], where it was shown that there is a generic automorphism of the second in the sense introduced in [10], In this paper, I study various possible definitions of ‘generic’ and ‘mutually generic’, and discuss the existence of mutually generic automorphisms in some cases. In addition, generics in the automorphism group of the rational circular order are considered.

The language of the basic logic of proofs extends the usual propositional language by forming sentences of the sort x is a proof of F for any sentence F. In this paper a complete axiomatization for the basic logic of proofs in Heyting Arithmetic HA was found.

We show that each of and proves -Det and that neither nor can be dropped. We also show that neither nor proves -Det. Moreover, we prove that none of and is provable in

We revisit the foundations of positive model theory, introducing h-inductive sentences. These allow a considerably simplified presentation of positive model theory, as well as a characterisation of Hausdorffcats by an amalgamation property of their h-inductive theory.

The paper uses the formalism of indexed categories to recover the proof of a standard final coalgebra theorem, thus showing existence of final coalgebras for a special class of functors on finitely complete and cocomplete categories. As an instance of this result, we build the final coalgebra for the powerclass functor, in the context of a Heyting pretopos with a class of small maps. This is then proved to provide models for various non-well-founded set theories, depending on the chosen axiomatisation for the class of small maps.

Let M be a big o-minimal structure and G a type-definable group in Mn. We show that G is a type-definable subset of a definable manifold in Mn that induces on G a group topology. If M is an o-minimal expansion of a real closed field, then G with this group topology is even definably isomorphic to a type-definable group in some Mk with the topology induced by Mk. Part of this result holds for the wider class of so-called invariant groups: each invariant group G in Mn has a unique topology making it a topological group and inducing the same topology on a large invariant subset of the group as Mn.

A class is the set of paths through a computable tree. Given classes P and Q, P is Medvedev reducible to Q, P ≤MQ, if there is a computably continuous functional mapping Q into P. We look at the lattice formed by subclasses of 2ω under this reduction. It is known that the degree of a splitting class of c.e. sets is non-branching. We further characterize non-branching degrees, providing two additional properties which guarantee non-branching: inseparable and hyperinseparable. Our main result is to show that non-branching iff inseparable if hyperinseparable if homogeneous and that all unstated implications do not hold. We also show that inseparable and not hyperinseparable degrees are downward dense.

The paper studies how the localic notion of sublocale transfers to formal topology. For any formal topology (not necessarily with positivity predicate) we define a sublocale to be a cover relation that includes that of the formal topology. The family of sublocales has set-indexed joins. For each set of base elements there are corresponding open and closed sublocales, boolean complements of each other. They generate a boolean algebra amongst the sublocales. In the case of an inductively generated formal topology, the collection of inductively generated sublocales has coframe structure.

Overt sublocales and weakly closed sublocales are described, and related via a new notion of “rest closed” sublocale to the binary positivity predicate. Overt, weakly closed sublocales of an inductively generated formal topology are in bijection with “lower powerpoints”, arising from the impredicative theory of the lower powerlocale.

Compact sublocales and fitted sublocales are described. Compact fitted sublocales of an inductively generated formal topology are in bijection with “upper powerpoints”, arising from the impredicative theory of the upper powerlocale.

This paper contains a result on the reconstruction of certain homogeneous transitive ω-categorical structures from their automorphism group. The structures treated are relational. In the proof it is shown that their automorphism group contains a generic pair (in a slightly non-standard sense, coming from Baire category).

Reconstruction results give conditions under which the abstract group structure of the automorphism group Aut() of an ω-categorical structure determines the topology on Aut(), and hence determines up to bi-interpretability, by [1]; they can also give conditions under which the abstract group Aut() determines the permutation group ⟨Aut (), ⟩. so determines up to bi-definability. One such condition has been identified by M. Rubin in [12], and it is related to the definability, in Aut(), of point stabilisers. If the condition holds, the structure is said to have a weak ∀∃ interpretation, and Aut() determines up to bi-interpretability or, in some cases, up to bi-definability.

A better-known approach to reconstruction is via the ‘small index property’: an ω-categorical stucture has the small index property if any subgroup of Aut() of index less than is open. This guarantees that the abstract group structure of Aut() determines the topology, so if is ω-categorical with Aut() ≅ Aut() then and are bi-interpretable.

An amalgamation base p in a simple theory is stably definable if its canonical base is interde-finable with the set of canonical parameters for the ϕ-definitions of p as ϕ ranges through all stable formulae. A necessary condition for stably definability is given and used to produce an example of a supersimple theory with stable forking having types that are not stably definable. This answers negatively a question posed in [8]. A criterion for and example of a stably definable amalgamation base whose restriction to the canonical base is not axiomatised by stable formulae are also given. The examples involve generic relations over non CM-trivial stable theories.