相关论文: The Cardinality of the second uniform indiscernibl…

We indicate a way of distinguishing between structures, for which, we call two structures distinguishable. Roughly, being distinguishable means that they differ in the number of realizations each gives for some formula. Being…

Using the Hilbert-Bernays account as a spring-board, we first define four ways in which two objects can be discerned from one another, using the non-logical vocabulary of the language concerned. (These definitions are based on definitions…

Denote by $\continuum=2^{\aleph_0}$ the cardinal of continuum. We construct an intriguing family $(P_\alpha: \alpha\in\continuum)$ of prime $z$-ideals in $\C_0(\reals)$ with the following properties: If $f\in P_{i_0}$ for some…

We show that it is consistent that the continuum is as large as you wish, and for each uncountable cardinal $\kappa$ below the continuum, there are a subset $T$ of the reals and a family $A$ of countable subsets of $T$ such that (1) both…

This paper examines the possibilities of extending Cantor's two arguments on the uncountable nature of the set of real numbers to one of its proper denumerable subsets: the set of rational numbers. The paper proves that, unless certain…

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…

We prove that if there is a real-valued measurable cardinal then the splitting number is $\aleph_1$. Likewise, if the continuum is real-valued measurable then the reaping number equals the continuum.

We prove that if the set of unordered pairs of real numbers is colored by finitely many colors, there is a set of reals homeomorphic to the rationals whose pairs have at most two colors. Our proof uses large cardinals and it verifies a…

It is proved that if there is an $\aleph_2$-Aronszajn line, then there is one that does not contain an $\aleph_2$-Countryman line. This solves a problem of Moore and stands in a sharp contrast with his Basis Theorem for linear orders of…

We address the question regarding the structure of the Mitchell order on normal measures. We show that every well founded order can be realized as the Mitchell order on a measurable cardinal $\kappa$ from some large cardinal assumption.

After reviewing various natural bi-interpretations in urelement set theory, including second-order set theories with urelements, we explore the strength of second-order reflection in these contexts. Ultimately, we prove, second-order…

We make use of some observations on the core model, for example assuming $V=L [ E ]$, and that there is no inner model with a Woodin cardinal, and $M$ is an inner model with the same cardinals as $V$, then $V=M$. We conclude in this latter…

This article explores the model-dependent nature of set cardinality, emphasizing that cardinality is not absolute but varies across different axiomatic frameworks. Although Cantor's diagonal argument shows the real numbers are…

We give several new examples of computable structures of high Scott rank. For earlier known computable structures of Scott rank $\omega_1^{CK}$, the computable infinitary theory is $\aleph_0$-categorical. Millar and Sacks asked whether this…

We investigate the extent of second order characterizable structures by extending Shelah's Main Gap dichotomy to second order logic. For this end we consider a countable complete first order theory T. We show that all sufficiently large…

An inaccessible cardinal kappa is supercompact when (kappa, lambda)-ITP holds for all lambda greater than or equal to kappa. We prove that if there is a model of ZFC with infinitely many supercompact cardinals, then there is a model of ZFC…

We prove, for stably computably enumerable formal systems, direct analogues of the first and second incompleteness theorems of G\"odel. A typical stably computably enumerable set is the set of Diophantine equations with no integer…

The article focuses on a class of second countable groups assembled from profinite and discrete by elementary operations. We focus on a rank associated with these groups that measure their complexity, the decomposition rank. A collection of…

We study the structural regularities and irregularities of the reals in inner models of set theory. Starting with $L$, G\"{o}del's constructible universe, our study of the reals is thus two-fold. On the one hand, we study how their…

Since the theory developed by Georg Cantor, mathematicians have taken a sharp interest in the sizes of infinite sets. We know that the set of integers is infinitely countable and that its cardinality is Aleph0. Cantor proved in 1891 with…