相关论文: Set theory without choice: not everything on cofin…

We study models M of set theory that are "condensable", in the sense that there is an "ordinal" v of M such that the rank initial segment of M determined by v is both isomorphic to M, and also an elementary submodel of M for infinitary…

We present two different types of models where, for certain singular cardinals lambda of uncountable cofinality, lambda -> (lambda, omega+1)^2, although lambda is not a strong limit cardinal. We announce, here, and will present in a…

In [2] Su Gao proves that the following are equivalent for a countable $M$ (cf. theorem 1.2 too): (I)There is an uncountable model of the Scott sentence of $M$. (II) There exists some $j\in \overline{Aut(M)}\setminus Aut(M)$, where…

Using forcing with measured creatures we build a universe of set theory in which: (a) every sup-measurable function f:RxR-->R is measurable, and (b) every function f:R-->R is continuous on a non-measurable set. This answers a question of…

We investigate connections between resolvability and different forms of tightness. This study is adjacent to [1,2]. We construct a non-regular refinement $\tau^*$ of the natural topology of the real line $\mathbb{R}$ with properties such…

We show that in the theory ZF + DC + for every cardinal {\lambda}, the set of infinite subsets of {\lambda} is well-ordered (i.e., Shelah's AX4), the {\theta}-function measuring the surjective size of the powersets P({\kappa}) can take…

We obtain an improvement of some coloring theorems from \cite{nsbpr}, \cite{819}, and \cite{APAL} for the case where the singular cardinal in question has countable cofinality. As a corollary, we obtain an "idealized" version of the…

We give a simple example of a set that is weakly Dedekind infinite (= can be mapped onto omega) but dually Dedekind finite (=cannot be mapped noninjectively onto itself), namely, the power set of a superamorphous set. (A infinite set is…

We distinguish finitarily between algorithmic verifiability, and algorithmic computability, to show that Goedel's 'formally' unprovable, but 'numeral-wise' provable, arithmetical proposition [(Ax)R(x)] can be finitarily evidenced as:…

Local versions of measurability have been around for a long time. Roughly, one splits the notion of $\mu $-completeness into pieces, and asks for a uniform ultrafilter over $\mu $ satisfying just some piece of $\mu $-completeness. Analogue…

A set X subseteq R is strongly meager if for every measure zero set H, X+H not= R. Let SM denote the collection of strongly meager sets. We show that assuming CH, SM is not an ideal.

Solomonoff unified Occam's razor and Epicurus' principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field of algorithmic information theory. His central result is that the…

A function F:R^2->R is sup-measurable if F_f:R->R given by F_f(x)=F(x,f(x)), x in R, is measurable for each measurable function f:R->R. It is known that under different set theoretical assumptions, including CH, there are sup-measurable…

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…

Let 0<n^*< omega and f:X-> n^*+1 be a function where X subseteq omega backslash (n^*+1) is infinite. Consider the following set S_f= {x subset aleph_omega : |x| <= aleph_{n^*} & (for all n in X)cf(x cap alpha_n)= aleph_{f(n)}}. The…

We propose an AC-independent proof of the existence of a non-measurable set as a consequence of the Hahn-Banach theorem of functional analysis which is known to be strictly weaker than AC.

If we apply an extension of the Deduction meta-Theorem to Goedel's meta-reasoning of "undecidability", we can conclude that Goedel's formal system of Arithmetic is not omega-consistent. If we then take the standard interpretation…

We prove that mu = mu^{< mu}, 2^mu = mu^+ and ``there is a non reflecting stationary subset of mu^+ composed of ordinals of cofinality < mu'' imply that there is a mu-complete Souslin tree on mu^+ .

Let lambda be aleph_0 or a strong limit of cofinality aleph_0. Suppose that (G_m,p_{m,n}:m =< n<omega) and (H_m,p^t_{m,n}: m=< n < omega) are projective systems of groups of cardinality less than lambda and suppose that for every n<omega…

We deal with the monadic (second-order) theory of order. We prove all known results in a unified way, show a general way of reduction, prove more results and show the limitation on extending them. We prove (CH) that the monadic theory of…