We show that in the language of { ≤ }. the Π3-fragment of the first order theory of the -enumeration degrees is undecidable. We then extend this result to show that the Π3-theory of any substructure of the enumeration degrees which contains the -degrees is undecidable.

Let be the category of all reduced compact complex spaces, viewed as a multi-sorted first order structure, in the standard way. Let be a sub-category of . which is closed under the taking of products and analytic subsets, and whose morphisms include the projections. Under the assumption that Th() is unidimensional. we show that Morley rank is equal to Noetherian dimension, in any elementary extension of . As a result, we are able to show that Morley degree is definable in Th(). when Th() is unidimensional.

It is shown that coherence conditions for monoidal categories concerning associativity are analogous to coherence conditions for symmetric strictly monoidal categories, where associativity arrows are identities. Mac Lane's pentagonal coherence condition for associativity is decomposed into conditions concerning commutativity, among which we have a condition analogous to naturality and a degenerate case of Mac Lane's hexagonal condition for commutativity. This decomposition is analogous to the derivation of the Yang-Baxter equation from Mac Lane's hexagon and the naturality of commutativity. The pentagon is reduced to an inductive definition of a kind of commutativity.

Most Gentzen systems arising in logic contain few axiom schemata and many rule schemata. Hilbert systems, on the other hand, usually contain few proper inference rules and possibly many axioms. Because of this, the two notions tend to serve different purposes. It is common for a logic to be specified in the first instance by means of a Gentzen calculus, whereupon a Hilbert-style presentation ‘for’ the logic may be sought—or vice versa. Where this has occurred, the word ‘for’ has taken on several different meanings, partly because the Gentzen separator ⇒ can be interpreted intuitively in a number of ways. Here ⇒ will be denoted less evocatively by ⊲.

In this paper we aim to discuss some of the useful ways in which Gentzen and Hilbert systems may correspond to each other. Actually, we shall be concerned with the deducibility relations of the formal systems, as it is these that are susceptible to transformation in useful ways. To avoid potential confusion, we shall speak of Hilbert and Gentzen relations. By a Hilbert relation we mean any substitution-invariant consequence relation on formulas—this comes to the same thing as the deducibility relation of a set of Hilbert-style axioms and rules. By a Gentzen relation we mean the fully fledged generalization of this notion in which sequents take the place of single formulas. In the literature, Hilbert relations are often referred to as sentential logics. Gentzen relations as defined here are their exact sequential counterparts.

We prove several trichotomy results for ideals of compact sets. Typically, we show that a “sufficiently rich” universally Baire ideal is either Π30-hard. or Σ30-hard. or else a σ-ideal.

It is shown that, according to NF, many of the assertions of ordinal arithmetic involving the T-function which is peculiar to NF turn out to be equivalent to the truth-in-certain-permutation-models of assertions which have perfectly sensible ZF-style meanings, such as: the existence of wellfounded sets of great size or rank, or the nonexistence of small counterexamples to the wellfoundedness of ∈. Everything here holds also for NFU if the permutations are taken to fix all urelemente.

We prove that for any locally countable partial order ℙ = (2ε, ≤p, there exists a nonmeasurable antichain in ℙ. Some applications of the result are also presented.

Let λ be a singular cardinal of uncountable cofinality ν. Under various assumptions about the sizes of covering families for cardinals below λ, we prove upper bounds for the covering number COV(λ. λ. ν+. 2). This covering number is closely related to the cofinality of the partial order ([λ]ν. ⊆).

Let N be a transitive model of ZFC such that “N ⊂ N and P(ℝ) ⊂ N. Assume that both V and N satisfy “the core model K exists.” Then KN is an iterate of K, i.e., there exists an iteration tree F on K such that F has successor length and . Moreover, if there exists an elementary embedding π: V → N then the iteration map associated to the main branch of F equals π յ K. (This answers a question of W. H. Woodin, M. Gitik, and others.) The hypothesis that P(ℝ) ⊂ N is not needed if there does not exist a transitive model of ZFC with infinitely many Woodin cardinals.

We prove conjugacy and generic disjointness of generous Carter subgroups in groups of finite Morley rank. We elaborate on groups with a generous Carter subgroup and on a minimal counterexample to the Genericity Conjecture.

We define elementary extension and elementary equivalence in Positive Logic.

In this paper, we show that the predicate logics of consistent extensions of Heyting's Arithmetic plus Church's Thesis with uniqueness condition are complete . Similarly, we show that the predicate logic of HA*. i.e. Heyting's Arithmetic plus the Completeness Principle (for HA*) is complete . These results extend the known results due to Valery Plisko. To prove the results we adapt Plisko's method to use Tennenbaum's Theorem to prove ‘categoricity of interpretations’ under certain assumptions.

Let T be a positive L1-L∞ contraction. We prove that the following statements are equivalent in constructive mathematics.

(1) The projection in L2, on the space of invariant functions exists:

(2) The sequence (Tn)n∈N Cesáro-converges in the L2 norm:

(3) The sequence (Tn)n∈N Cesáro-converges almost everywhere.

Thus, we find necessary and sufficient conditions for the Mean Ergodic Theorem and the Dunford-Schwartz Pointwise Ergodic Theorem.

As a corollary we obtain a constructive ergodic theorem for ergodic measure-preserving transformations.

This answers a question posed by Bishop.

Levin and Schnorr (independently) introduced the monotone complexity, Km (α), of a binary string α. We use monotone complexity to define the relative complexity (or relative randomness) of reals. We define a partial ordering ≤Km on 2ω by α ≤Km β iff there is a constant c such that Km(α | n) ≤ Km(β | n)+ c for all n. The monotone degree of α is the set of all β such that α Km β and β Km α. We show the monotone degrees contain an antichain of size , a countable dense linear ordering (of degrees of cardinality ), and a minimal pair.

Downey, Hirschfeldt, LaForte, Nies and others have studied a similar structure, the K-degrees, where K is the prefix-free Kolmogorov complexity. A minimal pair of K-degrees was constructed by Csima and Montalban. Of particular interest are the noncomputable trivial reals, first constructed by Solovay. We defineareal to be (Km,K)-trivial if for some constant c, Km(α | n) ≤ K(n) + c for all n. It is not known whether there is a Km-minimal real, but we show that any such real must be (Km,K)-trivial.

Finally, we consider the monotone degrees of the computably enumerable (c.e.) and strongly computably enumerable (s.c.e.) reals. We show there is no minimal c.e. monotone degree and that Solovay reducibility does not imply monotone reducibility on the c.e. reals. We also show the s.c.e. monotone degrees contain an infinite antichain and a countable dense linear ordering.

In [9], Yates proved the existence of a Turing degree a such that 0, 0′ are the only c.e. degrees comparable with it. By Slaman and Steel [7], every degree below 0′ has a 1-generic complement, and as a consequence, Yates degrees can be 1-generic, and hence can be low. In this paper, we prove that Yates degrees occur in every jump class.

We produce counterexamples to the unique and cofinal branches hypotheses, assuming (slightly less than) the existence of a cardinal which is strong past a Woodin cardinal.

We show that if κ is a weakly compact cardinal, then

for any ordinals α < κ+ and μ < κ, and any finite ordinals m and n. This polarized partition relation represents the statement that for any partition

of κ × κ+ into m + μ pieces either there are A ∈ [κ]κ, B ∈ [κ]+]α and i < m with A × B ⊆ Ki or there are C ∈ [κ]κ, , and j < μ with C × D ⊆ Lj. Related results for measurable and almost measurable κ are also investigated. Our proofs of these relations involve the use of elementary substructures of set models of large fragments of ZFC.

Modifying the methods of Z. Adamowicz's paper Herbrand consistency and bounded arithmetic [3] we show that there exists a number n such that ⋃mSm (the union of the bounded arithmetic theories Sm) does not prove the Herbrand consistency of the finitely axiomatizable theory S3n

It is known that both S4 and the Intuitionistic prepositional calculus Int are P-SPACE complete. This guarantees that there is a polynomial translation from each system into the other.

However, no sound and faithful polynomial translation from S4 into Int is commonly known. The problem of finding one was suggested by Dana Scott during a very informal gathering of logicians in February 2005 at UCLA. Grigori Mints then brought it to my attention, and in this paper I present a solution. It is based on Kripke semantics and describes model-checking for S4 using formulas of Int.

A simple translation from Int into S4, the Gödel-Tarski translation, is wellknown; given a formula φ of Int, one obtains by prefixing □ to every subformula. For example,

.

That the translation is sound and faithful can be seen by considering topological semantics, which assign open sets both to □-formulas of S4 and arbitrary formulas of Int; the interpretation of φ and turn out to be identical. See Tarski's paper [6] for details. Gödel's original paper can be found in [3].

In [2], Friedman and Flagg present a kind of inverse to Gödel-Tarski. Given a formula φ of S4 and a finite set of formulas Γ of Int, for each ε ∈ Γ one gets an intuitionistic formula given recursively by

In this paper we show that there are “E0 many” orbit inequivalent free actions of the free groups , 2 ≤ n ≤ ∞ by measure preserving transformations on a standard Borel probability space. In particular, there are uncountably many such actions.