Related papers: Oscillating subalgebras of the atomless countable …
It is unprovable that every complete subalgebra of a countably closed complete Boolean algebra is countably closed.
We show that the universal homogeneous partial order has finite big Ramsey degrees and discuss several corollaries. Our proof relies on parameter spaces and the Carlson-Simpson theorem rather than on (a strengthening of) the…
We show that it is consistent with ZFC (relative to large cardinals) that every infinite Boolean algebra B has an irredundant subset A such that 2^{|A|} = 2^{|B|}. This implies in particular that B has 2^{|B|} subalgebras. We also discuss…
It is shown that the countably infinite dimensional pointed vector space (the vector space equipped with a constant) over a finite field has infinitely many first order definable reducts. This implies that the countable homogeneous…
Given a complete Heyting algebra we construct an algebraic tensor triangulated category whose Bousfield lattice is the Booleanization of the given Heyting algebra. As a consequence we deduce that any complete Boolean algebra is the…
We show that atomic polyadic algebras of infinite dimensions are completely representable
We consider homogeneity properties of Boolean algebras that have nonprincipal ultrafilters which are countably generated.It is shown that a Boolean algebra B is homogeneous if it is the union of countably generated nonprincipal ultrafilters…
We prove that assuming suitable cardinal arithmetic, if B is a Boolean algebra every homomorphic image of which is isomorphic to a factor, then B has locally small density. We also prove that for an (infinite) Boolean algebra B, the number…
Analogues of Ramsey's Theorem for infinite structures such as the rationals or the Rado graph have been known for some time. In this context, one looks for optimal bounds, called degrees, for the number of colors in an isomorphic…
We prove the result in the title. We infer, that unlike cylindric algebras, there is a first order axiomatization of the class of completely representable polyadic algebras of infinite dimension, though the one we obtain is infinite; in…
We give a necessary and sufficient condition for an atomless Boolean algebra to be countably generated, and use it to give new proofs of some some know facts due to Gaifman-Hales and Solovay and also due to Jech, Kunen and Magidor. We also…
A big Ramsey spectrum of a countable chain (i.e. strict linear order) C is a sequence of big Ramsey degrees of finite chains computed in C. In this paper we consider big Ramsey spectra of countable scattered chains. We prove that countable…
Big Ramsey degrees of Fra\"iss\'e limits of finitely constrained free amalgamation classes in finite binary languages have been recently fully characterised by Balko, Chodounsk\'y, Dobrinen, Hubi\v{c}ka, Kone\v{c}n\'y, Vena, and Zucker. A…
Using Koszmider's strongly unbounded functions, we show the following consistency result: Suppose that $\kappa,\lambda$ are infinite cardinals such that $\kappa^{+++} \leq \lambda$, $\kappa^{<\kappa}=\kappa$ and $2^{\kappa}= \kappa^+$, and…
Oscillation stability is an important concept in Banach space theory which happens to be closely connected to discrete Ramsey theory. For example, Gowers proved oscillation stability for the Banach space $c_0$ using his now famous Ramsey…
We give a unified treatment of the model theory of various enrichments of infinite atomic Boolean algebras, with special attention to quantifier-eliminations, complete axiomatizations and decidability. A classical example is the enrichment…
Building on previous work of the author, for each finite triangle-free graph $\mathbf{G}$, we determine the equivalence relation on the copies of $\mathbf{G}$ inside the universal homogeneous triangle-free graph, $\mathcal{H}_3$, with the…
We classify the Boolean degree $1$ functions of $k$-spaces in a vector space of dimension $n$ (also known as Cameron-Liebler classes) over the field with $q$ elements for $n \geq n_0(k, q)$. This also implies that two-intersecting sets with…
We prove that for any homogeneous structure $\mathbf{K}$ in a language with finitely many relation symbols of arity at most two satisfying SDAP$^+$ (or LSDAP$^+$), there are spaces of subcopies of $\mathbf{K}$, forming subspaces of the…
Ramsey's theorem asserts that every $k$-coloring of $[\omega]^n$ admits an infinite monochromatic set. Whenever $n \geq 3$, there exists a computable $k$-coloring of $[\omega]^n$ whose solutions compute the halting set. On the other hand,…