Related papers: Set theory without choice: not everything on cofin…

In this note we are concerned with the validity of an uncountable analogue of a combinatorial lemma due to Vlastimil Pt\'ak. We show that the validity of the result for $\omega_1$ can not be decided in ZFC alone. We also provide a…

For a metrizable space $X$ and a finite measure space $(\Omega,\mathfrak{M},\mu)$ let $M_{\mu}(X)$ and $M^f_{\mu}(X)$ be the spaces of all equivalence classes (under the relation of equality almost everywhere mod $\mu$) of…

If ZFC is consistent, then each of the following are consistent with ZFC + 2^{{aleph_0}}= aleph_2 : 1.) X subseteq R is of strong measure zero iff |X| <= aleph_1 + there is a generalized Sierpinski set. 2.) The union of aleph_1 many strong…

Using an iterative tree construction we show that for simple computable subsets of the Cantor space Hausdorff, constructive and computable dimensions might be incomputable.

We give a sufficient condition for the Fourier dimension of a countable union of sets to equal the supremum of the Fourier dimensions of the sets in the union, and show by example that the Fourier dimension is not countably stable in…

We show that for any class of Boolean algebras with an associative operator, if it contains the complex algebra of (P(N), U), its equational theory is undecidable. Equivalently, any associative normal modal logic valid over the frame (P(N),…

We prove the following two results. Theorem A: Let alpha be a limit ordinal. Suppose that 2^{|alpha|}<aleph_alpha and 2^{|alpha|^+}<aleph_{|alpha|^+}, whereas aleph_alpha^{|alpha|}>aleph_{|alpha|^+}. Then for all n< omega and for all…

We show that the following are consistent with ZFC: 1. Strongly meager sets form an ideal with the same additivity as the ideal of meager sets. 2. There exists a strong measure zero set of size > d (dominating number).

We will prove that there exists a model of ZFC+``c= omega_2'' in which every M subseteq R of cardinality less than continuum c is meager, and such that for every X subseteq R of cardinality c there exists a continuous function f:R-> R with…

We introduce a fragment of second-order unification, referred to as \emph{Second-Order Ground Unification (SOGU)}, with the following properties: (i) only one second-order variable is allowed, and (ii) first-order variables do not occur. We…

While routinely used in other areas of dynamics, image sets are ill-defined objects in general non-invertible measurable dynamics. We propose a way of consistently working with image sets of null-preserving (and hence, in particular, of…

According to quantum theory, the outcomes of future measurements cannot (in general) be predicted with certainty. In some cases, even with a complete physical description of the system to be measured and the measurement apparatus, the…

We study a new extension of the weak MSO logic, talking about boundedness. Instead of a previously considered quantifier U, expressing the fact that there exist arbitrarily large finite sets satisfying a given property, we consider a…

We consider a system of weak* closed sets of finite-dimensional distributions. We show that a corresponding system of random variables can be defined on a probability space with a probability measure determined up to some set of measures,…

Let $f:M\to M$ be a homeomorphism over a compact Riemannian manifold, ergodic with respect to a measure $\mu$ defined on the completion of the Borel $\sigma$-algebra and $\mathcal F$ a $f$-invariant one dimensional continuous foliation of…

We generalize a theorem of Bellow and Calder\'on concerning the a.e. convergence of the convolution powers $\ds \mu^nf(x)=\sum_{k}\mu^n(k)f(T^k x)$ where $T$ is a measure preserving transformation of a probability space and $\mu$ is a…

Extending a result of Foreman and Magidor we prove that in the core model for almost linear iterations the following holds. There is a sequence (S^n_\alpha : n<\omega,\alpha>0) such that each individual S^n_\alpha is a stationary subset of…

Generic computability has been studied in group theory and we now study it in the context of classical computability theory. A set A of natural numbers is generically computable if there is a partial computable function f whose domain has…

We generalize some of the central results in automata theory to the abstraction level of coalgebras and thus lay out the foundations of a universal theory of automata operating on infinite objects. Let F be any set functor that preserves…

In this note, we characterize affine and non-affine Coxeter systems among all Coxeter systems in terms of the structure of their reflection orders. For an infinite irreducible system $(W,S)$, we show that affineness can be characterized in…