We prove a number of results about countable Borel equivalence relations with forcing constructions and arguments. These results reveal hidden regularity properties of Borel complete sections on certain orbits. As consequences they imply the nonexistence of Borel complete sections with certain features.

]]>Descriptive set theory and computability theory are closely-related fields of logic; both are oriented around a notion of descriptive complexity. However, the two fields typically consider objects of very different sizes; computability theory is principally concerned with subsets of the naturals, while descriptive set theory is interested primarily in subsets of the reals. In this paper, we apply a generalization of computability theory, admissible recursion theory, to consider the relative complexity of notions that are of interest in descriptive set theory. In particular, we examine the perfect set property, determinacy, the Baire property, and Lebesgue measurability. We demonstrate that there is a separation of descriptive complexity between the perfect set property and determinacy for analytic sets of reals; we also show that the Baire property and Lebesgue measurability are both equivalent in complexity to the property of simply being a Borel set, for sets of reals.

]]>In [20] Krajíček and Pudlák discovered connections between problems in computational complexity and the lengths of first-order proofs of finite consistency statements. Later Pudlák [25] studied more statements that connect provability with computational complexity and conjectured that they are true. All these conjectures are at least as strong as [23–25].One of the problems concerning these conjectures is to find out how tightly they are connected with statements about computational complexity classes. Results of this kind had been proved in [20, 22].In this paper, we generalize and strengthen these results. Another question that we address concerns the dependence between these conjectures. We construct two oracles that enable us to answer questions about relativized separations asked in [19, 25] (i.e., for the pairs of conjectures mentioned in the questions, we construct oracles such that one conjecture from the pair is true in the relativized world and the other is false and vice versa). We also show several new connections between the studied conjectures. In particular, we show that the relation between the finite reflection principle and proof systems for existentially quantified Boolean formulas is similar to the one for finite consistency statements and proof systems for non-quantified propositional tautologies.

]]>We study the following natural strong variant of destroying Borel ideals: -destroys if adds an -positive set which has finite intersection with every . Also, we discuss the associated variants

of the star-uniformity and the star-covering numbers of these ideals.

Among other results, (1) we give a simple combinatorial characterisation when a real forcing can -destroy a Borel ideal ; (2) we discuss many classical examples of Borel ideals, their -destructibility, and cardinal invariants; (3) we show that the Mathias–Prikry, -generic real -destroys iff -destroys iff can be -destroyed iff ; (4) we characterise when the Laver–Prikry, -generic real -destroys , and in the case of P-ideals, when exactly -destroys ; and (5) we briefly discuss an even stronger form of destroying ideals closely related to the additivity of the null ideal.

]]>Let be a regular uncountable cardinal, and a cardinal greater than or equal to . Revisiting a celebrated result of Shelah, we show that if is close to and (= the least size of a cofinal subset of ) is greater than , then can be represented (in the sense of pcf theory) as a pseudopower. This can be used to obtain optimal results concerning the splitting problem. For example we show that if and , then no -complete ideal on is weakly -saturated.

]]>The language of linear temporal logic can be interpreted on the class of dynamic topological systems, giving rise to the intuitionistic temporal logic , recently shown to be decidable by Fernández-Duque. In this article we axiomatize this logic, some fragments, and prove completeness for several familiar spaces.

]]>A Cantor series expansion for a real number x with respect to a basic sequence , where , is a generalization of the base b expansion to an infinite sequence of bases. Ki and Linton in 1994 showed that for ordinary base b expansions the set of normal numbers is a -complete set, establishing the exact complexity of this set. In the case of Cantor series there are three natural notions of normality: normality, ratio normality, and distribution normality. These notions are equivalent for base b expansions, but not for more general Cantor series expansions. We show that for any basic sequence the set of distribution normal numbers is -complete, and if Q is -divergent then the sets of normal and ratio normal numbers are -complete. We further show that all five non-trivial differences of these sets are -complete if and Q is -divergent. This shows that except for the trivial containment that every normal number is ratio normal, these three notions are as independent as possible.

]]>By the Galvin–Mycielski–Solovay theorem, a subset X of the line has Borel’s strong measure zero if and only if for each meager set M.

A set is meager-additive if is meager for each meager set M. Recently a theorem on meager-additive sets that perfectly parallels the Galvin–Mycielski–Solovay theorem was proven: A set is meager-additive if and only if it has sharp measure zero, a notion akin to strong measure zero.

We investigate the validity of this result in Polish groups. We prove, e.g., that a set in a locally compact Polish group admitting an invariant metric is meager-additive if and only if it has sharp measure zero. We derive some consequences and calculate some cardinal invariants.

]]>Let be an ideal on . For we write if for all with some . Moreover, we denote (in particular, denotes the family of all finite-to-one functions).

We examine cardinal numbers and describing the smallest sizes of unbounded from below with respect to the order sets in and , respectively. For a maximal ideal , these cardinals were investigated by M. Canjar in connection with coinitial and cofinal subsets of the ultrapowers.

We show that for all ideals with the Baire property and that for all coanalytic weak P-ideals (this class contains all ideals). What is more, we give examples of Borel (even ) ideals with as well as with .

We also study cardinals describing the smallest sizes of sets in not bounded from below with respect to the preorder by any member of . Our research is partially motivated by the study of ideal-QN-spaces: those cardinals describe the smallest size of a space which is not ideal-QN.

]]>In set theory without the Axiom of Choice (), we investigate the open problem of the deductive strength of statements which concern the existence of almost disjoint and maximal almost disjoint (MAD) families of infinite-dimensional subspaces of a given infinite-dimensional vector space, as well as the extension of almost disjoint families in infinite-dimensional vector spaces to MAD families.

]]>We provide a model theoretical and tree property-like characterization of --subcompactness and supercompactness. We explore the behavior of these combinatorial principles at accessible cardinals.

]]>We show that if a countable structure M in a finite relational language is not cellular, then there is an age-preserving such that many structures are bi-embeddable with N. The proof proceeds by a case division based on mutual algebraicity.

]]>All known structural extensions of the substructural logic , the Full Lambek calculus with exchange/commutativity (corresponding to subvarieties of commutative residuated lattices axiomatized by -equations), have decidable theoremhood; in particular all the ones defined by knotted axioms enjoy strong decidability properties (such as the finite embeddability property). We provide infinitely many such extensions that have undecidable theoremhood, by encoding machines with undecidable halting problem. An even bigger class of extensions is shown to have undecidable deducibility problem (the corresponding varieties of residuated lattices have undecidable word problem); actually with very few exceptions, such as the knotted axioms and the other prespinal axioms, we prove that undecidability is ubiquitous. Known undecidability results for non-commutative extensions use an encoding that fails in the presence of commutativity, so and-branching counter machines are employed. Even these machines provide encodings that fail to capture proper extensions of commutativity, therefore we introduce a new variant that works on an exponential scale. The correctness of the encoding is established by employing the theory of residuated frames.

]]>We ask when, for a pair of structures , there is a uniform effective procedure that, given copies of the two structures, unlabeled, always produces a copy of . We give some conditions guaranteeing that there is such a procedure. The conditions might suggest that for the pair of orderings of type and of Harrison type, there should not be any such procedure, but, in fact, there is one. We construct an example for which there is no such procedure. The construction involves forcing. On the way to constructing our example, we prove a general result on modifying Cohen generics.

]]>We improve on and generalize a 1960 result of Maltsev. For a field F, we denote by the Heisenberg group with entries in F. Maltsev showed that there is a copy of F defined in , using existential formulas with an arbitrary non-commuting pair of elements as parameters. We show that F is interpreted in using computable formulas with no parameters. We give two proofs. The first is an existence proof, relying on a result of Harrison-Trainor, Melnikov, R. Miller, and Montalbán. This proof allows the possibility that the elements of F are represented by tuples in of no fixed arity. The second proof is direct, giving explicit finitary existential formulas that define the interpretation, with elements of F represented by triples in . Looking at what was used to arrive at this parameter-free interpretation of F in , we give general conditions sufficient to eliminate parameters from interpretations.

]]>A subset of the Cantor cube is null-additive if its algebraic sum with any null set is null. We construct a set of cardinality continuum such that: all continuous images of the set into the Cantor cube are null-additive, it contains a homeomorphic copy of a set that is not null-additive, and it has the property , a strong combinatorial covering property. We also construct a nontrivial subset of the Cantor cube with the property that is not null additive. Set-theoretic assumptions used in our constructions are far milder than used earlier by Galvin–Miller and Bartoszyński–Recław, to obtain sets with analogous properties. We also consider products of Sierpiński sets in the context of combinatorial covering properties.

]]>We initiate an investigation of structures on the set of real numbers having the property that path components of definable sets are definable. All o-minimal structures on have the property, as do all expansions of . Our main analytic-geometric result is that any such expansion of by Boolean combinations of open sets (of any arities) either is o-minimal or defines an isomorph of . We also show that any given expansion of by subsets of (n allowed to vary) has the property if and only if it defines all arithmetic sets. Variations arise by considering connected components or quasicomponents instead of path components.

]]>It is known that every non-universal self-full degree in the structure of the degrees of computably enumerable equivalence relations (ceers) under computable reducibility has exactly one strong minimal cover. This leaves little room for embedding wide partial orders as initial segments using self-full degrees. We show that considerably more can be done by staying entirely inside the collection of non-self-full degrees. We show that the poset can be embedded as an initial segment of the degrees of ceers with infinitely many classes. A further refinement of the proof shows that one can also embed the free distributive lattice generated by the lower semilattice as an initial segment of the degrees of ceers with infinitely many classes.

]]>Using a variation of the rainbow construction and various pebble and colouring games, we prove that RRA, the class of all representable relation algebras, cannot be axiomatised by any first-order relation algebra theory of bounded quantifier depth. We also prove that the class At(RRA) of atom structures of representable, atomic relation algebras cannot be defined by any set of sentences in the language of RA atom structures that uses only a finite number of variables.

]]>