Chromatic number of the product of graphs, graph homomorphisms, Antichains and cofinal subsets of posets without AC

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 countable. 2. If in a partially ordered set, all chains are finite and all antichains have size $\aleph_{\alpha}$, then the set has size $\aleph_{\alpha}$ for any regular $\aleph_{\alpha}$. 3. CS (Every partially ordered set without a maximal element has two disjoint cofinal subsets). 4. CWF (Every partially ordered set has a cofinal well-founded subset). 5. DT (Dilworth's decomposition theorem for infinite p.o.sets of finite width). 6. If the chromatic number of a graph $G_{1}$ is finite (say $k<\omega$), and the chromatic number of another graph $G_{2}$ is infinite, then the chromatic number of $G_{1}\times G_{2}$ is $k$. 7. For an infinite graph $G=(V_{G}, E_{G})$ and a finite graph $H=(V_{H}, E_{H})$, if every finite subgraph of $G$ has a homomorphism into $H$, then so has $G$. Further we study a few statements restricted to linearly-ordered structures without the axiom of choice.Comment: Revised versio

Combinatorial Properties and Dependent choice in symmetric extensions based on L\'{e}vy Collapse

We work with symmetric extensions based on L\'{e}vy Collapse and extend a few results of Arthur Apter. We prove a conjecture of Ioanna Dimitriou from her P.h.d. thesis. We also observe that if $V$ is a model of ZFC, then $DC_{<\kappa}$ can be preserved in the symmetric extension of $V$ in terms of symmetric system $\langle \mathbb{P},\mathcal{G},\mathcal{F}\rangle$, if $\mathbb{P}$ is $\kappa$-distributive and $\mathcal{F}$ is $\kappa$-complete. Further we observe that if $V$ is a model of ZF + $DC_{\kappa}$, then $DC_{<\kappa}$ can be preserved in the symmetric extension of $V$ in terms of symmetric system $\langle \mathbb{P},\mathcal{G},\mathcal{F}\rangle$, if $\mathbb{P}$ is $\kappa$-strategically closed and $\mathcal{F}$ is $\kappa$-complete.Comment: Revised versio

On the structure of classical realizability models of ZF

The technique of "classical realizability" is an extension of the method of "forcing"; it permits to extend the Curry-Howard correspondence between proofs and programs, to Zermelo-Fraenkel set theory and to build new models of ZF, called "realizability models". The structure of these models is, in general, much more complicated than that of the particular case of "forcing models". We show here that the class of constructible sets of any realizability model is an elementary extension of the constructibles of the ground model (a trivial fact in the case of forcing, since these classes are identical). It follows that Shoenfield absoluteness theorem applies to realizability models.Comment: 17 page