Related papers: An uncountable version of Pt\'ak's combinatorial l…
We study $\Sigma_1(\omega_1)$-definable sets (i.e. sets that are equal to the collection of all sets satisfying a certain $\Sigma_1$-formula with parameter $\omega_1$) in the presence of large cardinals. Our results show that the existence…
We use a generalization of a construction by Ziegler to show that for any field $F$ and any countable collection of countable subsets $A_i \subseteq F, i \in \calI \subset \Z_{>0}$ there exist infinitely many fields $K$ of arbitrary…
Recently, in Axioms 10(2): 119 (2021), a nonclassical first-order theory T of sets and functions has been introduced as the collection of axioms we have to accept if we want a foundational theory for (all of) mathematics that is not weaker…
Our theme is that not every interesting question in set theory is independent of $ZFC$. We give an example of a first order theory $T$ with countable $D(T)$ which cannot have a universal model at $\aleph_1$ without CH; we prove in $ZFC$ a…
The Nonassociative Lambek Calculus (NL) represents a logic devoid of the structural rules of exchange, weakening, and contraction, and it does not presume the associativity of its connectives. Its finitary consequence relation is decidable…
The {\em Singular Cardinal Hypothesis} (SCH) is one of the most classical combinatorial principles in set theory. It says that if $\kappa$ is singular strong limit, then $2^{\kappa}=\kappa^+$. We prove that given a singular cardinal…
We have observations concerning the set theoretic strength of the following combinatorial statements without the axiom of choice. 1. If in a partially ordered set, all chains are finite and all antichains are countable, then the set is…
We are lifting classical problems from single instances to regular sets of instances. The task of finding a positive instance of the combinatorial problem $P$ in a potentially infinite given regular set is equivalent to the so called…
We define a nontrivial version of the square principle $\Box_\omega$, which we then show consistent by means of forcing with finite conditions. This paper has been withdrawn by the author due to the fact that the presented $\Box_\omega$ can…
We show that if $M$ is a countable transitive model of ZF and if $a,b$ are reals not in $M$, then there is a $G$ generic over $M$ such that $b \in L[a,G]$. We then present several applications such as the following: if $J$ is any countable…
In the absence of the Axiom of Choice, the "small" cardinal $\omega_1$ can exhibit properties more usually associated with large cardinals, such as strong compactness and supercompactness. For a local version of strong compactness, we say…
A classical theorem of Hechler asserts that the structure $\left(\omega^\omega,\le^*\right)$ is universal in the sense that for any $\sigma$-directed poset P with no maximal element, there is a ccc forcing extension in which…
We study the question of when an uncountable ccc topological space $X$ contains a ccc subspace of size $\aleph_1$. We show that it does if $X$ is compact Hausdorff and more generally if $X$ is Hausdorff with $\mathrm{pct}(X) \leq \aleph_1$.…
The Lambek calculus is a well-known logical formalism for modelling natural language syntax. The original calculus covered a substantial number of intricate natural language phenomena, but only those restricted to the context-free setting.…
We give a combinatorial equivalent to the existence of a non-free hereditarily separable group of cardinality aleph_1. This can be used, together with a known combinatorial equivalent of the existence of a non-free Whitehead group, to prove…
We address the question of whether a reflecting stationary set may be partitioned into two or more reflecting stationary subsets, providing various affirmative answers in ZFC. As an application to singular cardinals combinatorics, we infer…
Let n>1 be a number. Let Gn be the hypergraph of all rectangles in an n-dimensional Euclidean space. It is consistent that ZF+DC holds, the chromatic number of Gn is countable, yet the chromatic number of Gn+1 is uncountable.
The Axiom of Dependent Choice $\mathsf{DC}$ and the Axiom of Countable Choice $\mathsf{AC}_\omega$ are two weak forms of the Axiom of Choice that can be stated for a specific set: $\mathsf{DC}(X)$ asserts that any total binary relation on…
We discuss some well-known compactness principles for uncountable structures of small regular sizes ($\omega_n$ for $2 \le n<\omega$, $\aleph_{\omega+1}$, $\aleph_{\omega^2+1}$, etc.), consistent from weakly compact (the size-restricted…
We give an example of a countable theory T such that for every cardinal lambda >= aleph_2 there is a fully indiscernible set A of power lambda such that the principal types are dense over A, yet there is no atomic model of T over A. In…