Related papers: Definable ${\mathsf E}_0$ classes at arbitrary pro…
We apply, in the context of semigroups, the main theorem from~\cite{higjac} that an elementary class $\mathcal{C}$ of algebras which is closed under the taking of direct products and homomorphic images is defined by systems of equations. We…
We prove in ZFC, no psi in L_{omega_1,omega}[Q] have unique model of uncountable cardinality, this confirms theBaldwin conjecture. But we analyze this in more general terms. We introduce and investigate a.e.c. and also versions of limit…
We make use of a finite support product of the Jensen minimal $\varPi^1_2$ singleton forcing to define a model in which $\varPi^1_2$ Uniformization fails for a set with countable cross-sections. We also define appropriate submodels of the…
We investigate an extension of ZFC set theory (in an extended language) that stipulates the existence of a proper class of indiscernibles over the universe. One of the main results of the paper shows that the purely set-theoretical…
The Scott rank of a countable structure is a measure, coming from the proof of Scott's isomorphism theorem, of the complexity of that structure. The Scott spectrum of a theory (by which we mean a sentence of $\mathcal{L}_{\omega_1 \omega}$)…
We show that Morley's theorem on the number of countable models of a countable first-order theory becomes an undecidable statement when extended to second-order logic. More generally, we calculate the number of equivalence classes of…
A cuf space (set, resp.) is a space (set, resp.) which is a countable union of finite subspaces (subsets, resp.). It is proved in $\mathbf{ZF}$ (with the absence of the axiom of choice) that all countable unions of cuf (denumerable, resp.)…
The modal logic of forcing arises when one considers a model of set theory in the context of all its forcing extensions, interpreting necessity as "in all forcing extensions" and possibility as "in some forcing extension". In this modal…
While non-contextual hidden-variable theories are proved to be impossible, contextual ones are possible. In a contextual hidden-variable theory, an observable is called a beable if the hidden-variable assigns its value in a given…
For an interval finite quiver $Q$, we introduce a class of flat representations. We classify the indecomposable projective objects in the category $\mathrm{rep}(Q)$ of pointwise finite dimensional representations. We show that an object in…
It is known that first-order logic with some counting extensions can be efficiently evaluated on graph classes with bounded expansion, where depth-$r$ minors have constant density. More precisely, the formulas are $\exists x_1 ... x_k \#y…
We work in set-theory without choice $\ZF$. Given a closed subset $F$ of $[0,1]^I$ which is a bounded subset of $\ell^1(I)$ ({\em resp.} such that $F \subseteq \ell^0(I)$), we show that the countable axiom of choice for finite subsets of…
Laver, and Woodin independently, showed that models of ${\rm ZFC}$ are uniformly definable in their set-forcing extensions, using a ground model parameter. We investigate ground model definability for models of fragments of ${\rm ZFC}$,…
The main aim of the article is to show, in the absence of the Axiom of Choice, relationships between the following, independent of $\mathbf{ZF}$, statements: "Every countable product of compact metrizable spaces is separable (respectively,…
Assuming PFA, every uncountable subset E of the plane meets some C^1 arc in an uncountable set. This is not provable from MA(aleph_1), although in the case that E is analytic, this is a ZFC result. The result is false in ZFC for C^2 arcs,…
It is well known that the R, the set of real numbers, is an abstract set, where almost all its elements cannot be described in any finite language. We investigate possible approaches to what might be called an epi-constructionist approach…
We work in set-theory without choice ZF. Denoting by AC(N) the countable axiom of choice, we show in ZF+AC(N) that the closed unit ball of a uniformly convex Banach space is compact in the convex topology (an alternative to the weak…
Countable tightness may be destroyed by countably closed forcing. We characterize the indestructibility of countable tightness under countably closed forcing by combinatorial statements similar to the ones Tall used to characterize…
In this note we present a ZFC construction of a non-meager filter which fails to be countable dense homogeneous. This answers a question of Hern\'andez-Guti\'errez and Hru\v{s}\'ak. The method of the proof also allows us to obtain a…
It is shown that there exists a complete, atomless, sigma-centered Boolean algebra, which does not contain any regular countable subalgebra if and only if there exist a nowhere dense ultrafilter. Therefore the existence of such algebras is…