相关论文: Reasonable ultrafilters, again
Whenever P is a proper definable forcing for adding a real, the countable support iteration of P has all the preservation properties it can possibly have, within a wide syntactically identified class of properties.
Using Koszmider's strongly unbounded functions, we show the following consistency result: Suppose that $\kappa,\lambda$ are infinite cardinals such that $\kappa^{+++} \leq \lambda$, $\kappa^{<\kappa}=\kappa$ and $2^{\kappa}= \kappa^+$, and…
A cardinal lambda is called omega-inaccessible if for all mu < lambda we have mu^omega<lambda. We show that for every omega-inaccessible cardinal lambda there is a CCC (hence cardinality and cofinality preserving) forcing that adds a…
An optimal extension of the Jensen covering lemma, within the limits imposed by Prikry forcing, is proved. If L[E] is an "iterable" weasel with no measurable cardinals, then either L[E] has "indiscernibles", or every uncountable set of…
The relationship between the large cardinal notions of strong compactness and supercompactness cannot be determined under the standard ZFC axioms of set theory. Under a hypothesis called the Ultrapower Axiom, we prove that the notions are…
Under large cardinal hypotheses beyond the Kunen inconsistency -- hypotheses so strong as to contradict the Axiom of Choice -- we solve several variants of the generalized continuum problem and identify structural features of the levels…
We further investigate a divisibility relation on the set $\beta N$ of ultrafilters on the set of natural numbers. We single out prime ultrafilters (divisible only by 1 and themselves) and establish a hierarchy in which a position of every…
Nonstandard analysis is very complex, so finding a simple description of infinitesimal points will be useful. In this paper, ultrafilters as infinitesimal points in a topological space will be proposed, and some topological concepts is…
The Gap Forcing Theorem, a key contribution of this paper, implies essentially that after any reverse Easton iteration of closed forcing, such as the Laver preparation, every supercompactness measure on a supercompact cardinal extends a…
In this paper, we study the tedious link between the properties of sensibility and approximability of models of untyped {\lambda}-calculus. Approximability is known to be a slightly, but strictly stronger property that sensibility. However,…
We introduce a model-theoretic characterization of Magidor cardinals, from which we infer that Magidor filters are beyond ZFC-inconsistency
We prove that every tower of normal filters of height $\gd$ ($\gd$ supercompact) is precipitous assuming that each normal filter in the tower is the club filter restricted to a stationary set. We give an example to show that this assumption…
We use forcing over admissible sets to show that, for every ordinal $\alpha$ in a club $C\subset\omega_1$, there are copies of $\alpha$ such that the isomorphism between them is not computable in the join of the complete $\Pi^1_1$ set…
In this article we investigate which compact spaces remain compact under countably closed forcing. We prove that, assuming the Continuum Hypothesis, the natural generalizations to $\omega_1$-sequences of the selection principle and…
We introduce a model of infinitary computation which enhances the infinite time Turing machine model slightly but in a natural way by giving the machines the capability of detecting cardinal stages of computation. The computational strength…
Suppose $\kappa$ is a regular cardinal and $\bar a=\langle \mu_i: i<\kappa \rangle$ is a non-decreasing sequence of regular cardinals. We study the set of possible cofinalities of cuts Pcut$(\bar a)=\{(\lambda_1, \lambda_2):$ for some…
We address the question of the consistency strength of certain filters and ultrafilters which fail to satisfy the Galvin property. We answer questions \cite[Questions 7.8,7.9]{TomMotiII}, \cite[Question 5]{NegGalSing} and improve theorem…
We present a coherent collection of finite mathematical theorems some of which can only be proved by going well beyond the usual axioms for mathematics. The proofs of these theorems illustrate in clear terms how one uses the well studied…
Ultrafinitism postulates that we can only compute on relatively short objects, and numbers beyond certain value are not available. This approach would also forbid many forms of infinitary reasoning and allow to remove certain paradoxes…
For ultrafilters u,v on N, the operation u/v is introduced and formalised which acts as quotient-like structures when v strongly divides u.Central to our study is the characterization of self-divisible ultrafilters in connection with the…