Classical descriptive set theory as a refinement of effective descriptive set theory

The (effective) Suslin–Kleene Theorem is obtained as a corollary of a standard proof of the classical Suslin Theorem, by noticing that it is mostly constructive and applying to it a naive realizability interpretation.     

Some descriptive set theory and core models

We analyse the trees given by sharps for Π¹₂ sets via inner core models to give a canonical decomposition of such sets when a core model is Σ¹₃ absolute. This is by way of analogy with Solovay's analysis of Π¹₁ sets into ω₁ Borel sets — Borel in codes for wellorders. We find that Π¹₂ sets are also unions of ω₁ Borel sets — but in codes for mice and wellorders. We give an application of this technique in showing that if a core model, K, is Σ¹₃ absolute thenTheorem. Every real is in K iff every Π¹₃ set of reals contains a Π¹₃ singleton.     

Generalizing realizability and Heyting models for constructive set theory

This article presents a common generalization of the two main methods for obtaining class models of constructive set theory. Heyting models are a generalization of the Boolean models for classical set theory which are a variant of forcing, while realizability is a decidedly constructive method that has first been developed for number theory by Kleene and was later very fruitfully adapted to constructive set theory. In order to achieve the generalization, a new kind of structure (applicative topologies) is introduced, which contains both elements of formal topology and applicative structures. This approach not only deepens the understanding of class models and leads to more efficiency in proofs about these kinds of models, but also makes it possible to prove new results about the two special cases that were not known before and to construct new models.     

Interpretations of the alternative set theory

Summary We show an axiom A such that there is no nontrivial interpretation of the alternative set theory (AST) inAST+A keeping , sets and the class of all standard natural numbers. Furthermore, there is no interpretation ofAST inAST without the prolongation axiom, but there is an interpretation ofAST in the theory having the prolongation axiom and the basic set-theoretical axioms only.     

New basic result in classical descriptive set theory: Preservation of completeness

The aim of this note is to prove the following result:Assume that f is a continuous function from the space of irrationals ωω onto Y such that the image f(U) of every set U which is open and closed in ωω is the union of one open and one closed set. Then Y is a completely metrizable space.     

Turing cones and set theory of the reals

We investigate Turing cones as sets of reals, and look at the relationship between Turing cones, measures, Baire category and special sets of reals, using these methods to show that Martin's proof of Turing Determinacy (every determined Turing closed set contains a Turing cone or is disjoint from one) does not work when you replace “determined” with “Blackwell determined”. This answers a question of Tony Martin. Received: 6 December 1999 / Revised version: 28 June 2000 Published online: 3 October 2001     

Some measure theoretic results in effective descriptive set theory

Assuming projective determinacy when it is needed, we prove some structure theorems in the measure theory and the category theory of the analytical hierarchy.     

Calculus of variations and descriptive set theory

If X is a locally compact Polish space, then LSC(X, ?) denotes the compact Polish space of lower semi‐continuous real‐valued functions on X equipped with the topology of epi‐convergence. Our purpose in this article is to prove the following: if –∞ < α < β < ∞ and –∞ < a < b < ∞, while r ∈ ? \ {0}, then the set CV of all f ∈ LSC([α, β ] × [a, b ] × ?, ?) for which there is u ∈ C^r ([α, β ], [a, b ]) such that for any v ∈ C^r ([α, β ], [a, b ]) we have that ∫_α^β f (x, u (x), v ′(x))dx ≥ ∫_α^β f (x, v (x), v (x))dx is not Borel (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

On a positive set theory with inequality

We introduce a quite natural Frege‐style set theory, which we call Strong‐Frege‐2 $(\mathsf {SF}_2)$, a sort of simplification of the theory considered in 13 (under the name Strong‐Frege‐3) and 1 (under the name F2). We give a model of a weaker variant of $\mathsf {SF}_2$, called $\mathsf {SF}_2\mathsf {AC}$, where atoms and coatoms are allowed. To construct the model we use an enumeration “almost without repetitions” of the Π¹₁ sets of natural numbers; such an enumeration can be obtained via a classical priority argument much in the style of 5 and 15 . © 2011 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim     

Complexity of the decidability of the unquantified set theory with a rank operator

The unquantified set theory MLSR containing the symbols ∪, ∖, ≠, ∈,R (R(x) is interpreted as a rank ofx) is considered. It is proved that there exists an algorithm which for any formulaQ of the MLSR theory decides whetherQ is true or not using the spacec|Q|³ (|Q| is the length ofQ).     

No Escape from Vardanyan's theorem

Vardanyan's theorem states that the set of PA-valid principles of Quantified Modal Logic, QML, is complete Π⁰₂. We generalize this result to a wide class of theories. The crucial step in the generalization is avoiding the use of Tennenbaum's Theorem.     

Galois theory for comatrix corings: Descent theory, Morita theory, Frobenius and separability properties

El Kaoutit and Gómez-Torrecillas introduced comatrix corings, generalizing Sweedler's canonical coring, and proved a new version of the Faithfully Flat Descent Theorem. They also introduced Galois corings as corings isomorphic to a comatrix coring. In this paper, we further investigate this theory. We prove a new version of the Joyal-Tierney Descent Theorem, and generalize the Galois Coring Structure Theorem. We associate a Morita context to a coring with a fixed comodule, and relate it to Galois-type properties of the coring. An affineness criterion is proved in the situation where the coring is coseparable. Further properties of the Morita context are studied in the situation where the coring is (co)Frobenius.

     

Minimal elementary extensions of models of set theory and arithmetic

We discuss minimal elementary extensions of models of set theory and contrast the behavior of models of set theory and arithmetic as regarding such extensions. Our main result, proved using a Boolean ultrapower argument, is:Theorem Every model of ZFChas a conservative elementary extension which possesses a cofinal minimal elementary extension.An application of Boolean ultrapowers to models of full arithmetic is also presented.The results of this paper were presented at the spring meeting of the Association for Symbolic Logic held at Pennsylvania State University during April 7 and 8, 1990     

Rothberger bounded groups and Ramsey theory

We show that:

(1)

Rothberger bounded subgroups of σ-compact groups are characterized by Ramseyan partition relations (Corollary 4).

(2)

For each uncountable cardinal κ there is a T₀ topological group of cardinality κ such that ONE has a winning strategy in the point-open game on the group and the group is not a closed subspace of any σ-compact space (Theorem 8).

(3)

For each uncountable cardinal κ there is a T₀ topological group of cardinality κ such that ONE has a winning strategy in the point-open game on the group and the group is σ-compact (Corollary 17).

     

Axiomatizing first-order consequences in dependence logic

Dependence logic, introduced in Väänänen (2007) [11], cannot be axiomatized. However, first-order consequences of dependence logic sentences can be axiomatized, and this is what we shall do in this paper. We give an explicit axiomatization and prove the respective Completeness Theorem.