The present work is an attempt to break ground in mathematics proper, armed with the accepting view just described. Specifically, we shall examine various versions of antinomic set theory, in particular the axiom of choice, keeping the presentation as intuitive as possible, more in the manner of a nineteenth century paper than as a thoroughly formalized system. The reason for such a presentation is the conviction that at this point it should be the mathematics that eventually determines the logic, rather (...) than the other way around. (shrink)

We show the relative consistency of ℵ1 satisfying a combinatorial property considered by David Fremlin (in the question DU from his list) in certain choiceless inner models. This is demonstrated by first proving the property is true for Ramsey cardinals. In contrast, we show that in ZFC, no cardinal of uncountable cofinality can satisfy a similar, stronger property. The questions considered by D. H. Fremlin are if families of finite subsets of ω1 satisfying a certain density condition necessarily contain all (...) finite subsets of an infinite subset of ω1, and specifically if this and a stronger property hold under MA + ¬CH. Towards this we show that if MA + ¬CH holds, then for every family ? of ℵ1 many infinite subsets of ω1, one can find a family ? of finite subsets of ω1 which is dense in Fremlins sense, and does not contain all finite subsets of any set in ?.We then pose some open problems related to the question. (shrink)

We determine exact consistency strengths for various failures of the Singular Cardinals Hypothesis (SCH) in the setting of the Zermelo-Fraenkel axiom system ZF without the Axiom of Choice (AC). By the new notion of parallel Prikry forcing that we introduce, we obtain surjective failures of SCH using only one measurable cardinal, including a surjective failure of Shelah's pcf theorem about the size of the power set of $\aleph _{\omega}$ . Using symmetric collapses to $\aleph _{\omega}$ , $\aleph _{\omega _{1}}$ , (...) or $\aleph _{\omega _{2}}$ , we show that injective failures at $\aleph _{\omega}$ , $\aleph _{\omega _{1}}$ , or $\aleph _{\omega _{2}}$ can have relatively mild consistency strengths in terms of Mitchell orders of measurable cardinals. Injective failures of both the aforementioned theorem of Shelah and Silver's theorem that GCH cannot first fail at a singular strong limit cardinal of uncountable cofinality are also obtained. Lower bounds are shown by core model techniques and methods due to Gitik and Mitchell. (shrink)

A question of Woodin asks if κ is strongly compact and GCH holds below κ, then must GCH hold everywhere? One variant of this question asks if κ is strongly compact and GCH fails at every regular cardinal δ < κ, then must GCH fail at some regular cardinal δ ≥ κ? Another variant asks if it is possible for GCH to fail at every limit cardinal less than or equal to a strongly compact cardinal κ. We get a negative (...) answer to the first of these questions and positive answers to the second of these questions for a supercompact cardinal κ in the context of the absence of the full Axiom of Choice. (shrink)

We examine combinatorial aspects and consistency strength properties of almost Ramsey cardinals. Without the Axiom of Choice, successor cardinals may be almost Ramsey. From fairly mild supercompactness assumptions, we construct a model of ZF + ${\neg {\rm AC}_\omega}$ in which every infinite cardinal is almost Ramsey. Core model arguments show that strong assumptions are necessary. Without successors of singular cardinals, we can weaken this to an equiconsistency of the following theories: “ZFC + There is a proper class of regular almost (...) Ramsey cardinals”, and “ZF + DC + All infinite cardinals except possibly successors of singular cardinals are almost Ramsey”. (shrink)

Suppose λ > κ is measurable. We show that if κ is either indestructibly supercompact or indestructibly strong, then A = {δ < κ | δ is measurable, yet δ is neither δ + strongly compact nor a limit of measurable cardinals} must be unbounded in κ. The large cardinal hypothesis on λ is necessary, as we further demonstrate by constructing via forcing two models in which ${A = \emptyset}$ . The first of these contains a supercompact cardinal κ and (...) is such that no cardinal δ > κ is measurable, κ’s supercompactness is indestructible under κ-directed closed, (κ +, ∞)-distributive forcing, and every measurable cardinal δ < κ is δ + strongly compact. The second of these contains a strong cardinal κ and is such that no cardinal δ > κ is measurable, κ’s strongness is indestructible under < κ-strategically closed, (κ +, ∞)-distributive forcing, and level by level inequivalence between strong compactness and supercompactness holds. The model from the first of our forcing constructions is used to show that it is consistent, relative to a supercompact cardinal, for the least cardinal κ which is both strong and has its strongness indestructible under κ-directed closed, (κ +, ∞)-distributive forcing to be the same as the least supercompact cardinal, which has its supercompactness indestructible under κ-directed closed, (κ +, ∞)-distributive forcing. It further follows as a corollary of the first of our forcing constructions that it is possible to build a model containing a supercompact cardinal κ in which no cardinal δ > κ is measurable, κ is indestructibly supercompact, and every measurable cardinal δ < κ which is not a limit of measurable cardinals is δ + strongly compact. (shrink)

Suppose that κ is indestructibly supercompact and there is a measurable cardinal λ > κ. It then follows that A1 = {δ < κ∣δ is measurable, δ is not a limit of measurable cardinals, and δ is not δ+ supercompact} is unbounded in κ. If in addition λ is 2λ supercompact, then A2 = {δ < κ∣δ is measurable, δ is not a limit of measurable cardinals, and δ is δ+ supercompact} is unbounded in κ as well. The large cardinal (...) hypotheses on λ are necessary, as we further demonstrate by constructing via forcing two distinct models in which either equation image or equation image. In each of these models, there is an indestructibly supercompact cardinal κ, and a restricted large cardinal structure above κ. If we weaken the indestructibility requirement on κ to indestructibility under partial orderings which are both κ-directed closed and -distributive, then it is possible to construct a model containing a supercompact cardinal κ witnessing this degree of indestructibility in which every measurable cardinal δ < κ is δ+ supercompact. (shrink)

We construct a model for the level by level equivalence between strong compactness and supercompactness in which the least supercompact cardinal κ has its strong compactness indestructible under adding arbitrarily many Cohen subsets. There are no restrictions on the large cardinal structure of our model.

We show that it is consistent, relative to n ∈ ω supercompact cardinals, for the strongly compact and measurable Woodin cardinals to coincide precisely. In particular, it is consistent for the first n strongly compact cardinals to be the first n measurable Woodin cardinals, with no cardinal above the n th strongly compact cardinal being measurable. In addition, we show that it is consistent, relative to a proper class of supercompact cardinals, for the strongly compact cardinals and the cardinals which (...) are both strong cardinals and Woodin cardinals to coincide precisely. We also show how the techniques employed can be used to prove additional theorems about possible relationships between Woodin cardinals and strongly compact cardinals. (shrink)

We construct a model for the level by level equivalence between strong compactness and supercompactness in which below the least supercompact cardinal κ, there is a stationary set of cardinals on which SCH fails. In this model, the structure of the class of supercompact cardinals can be arbitrary.

We show that from a supercompact cardinal $\kappa$, there is a forcing extension $V[G]$ that has a symmetric inner model $N$ in which $\mathrm {ZF}+\lnot\mathrm {AC}$ holds, $\kappa$ and $\kappa^{+}$ are both singular, and the continuum function at $\kappa$ can be precisely controlled, in the sense that the final model contains a sequence of distinct subsets of $\kappa$ of length equal to any predetermined ordinal. We also show that the above situation can be collapsed to obtain a model of $\mathrm (...) {ZF}+\lnot\mathrm {AC}_{\omega}$ in which either $\aleph_{1}$ and $\aleph_{2}$ are both singular and the continuum function at $\aleph_{1}$ can be precisely controlled, or $\aleph_{\omega}$ and $\aleph_{\omega+1}$ are both singular and the continuum function at $\aleph_{\omega}$ can be precisely controlled. Additionally, we discuss a result in which we separate the lengths of sequences of distinct subsets of consecutive singular cardinals $\kappa$ and $\kappa^{+}$ in a model of $\mathrm {ZF}$. Some open questions concerning the continuum function in models of $\mathrm {ZF}$ with consecutive singular cardinals are posed. (shrink)

We show that the consistency of the theory “ZF + DC + Every successor cardinal is regular + Every limit cardinal is singular + Every successor cardinal satisfies the tree property” follows from the consistency of a proper class of supercompact cardinals. This extends earlier results due to the author showing that the consistency of the theory “\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\rm ZF} + \neg{\rm AC}_\omega}$$\end{document} + Every successor cardinal is regular + Every limit cardinal (...) is singular + Every successor cardinal satisfies the tree property” follows from hypotheses stronger in consistency strength than a supercompact limit of supercompact cardinals. A lower bound in consistency strength is provided by a result of Busche and Schindler, who showed that the consistency of the theory “ZF + Every successor cardinal is regular + Every limit cardinal is singular + Every successor cardinal satisfies the tree property” implies the consistency of ADL(R). (shrink)

Beginning from some passages by Vācaspati Miśra and Bhāskararāya Makhin discussing the relationship between a crown and the gold of which it is made, this paper investigates the complex underlying connections among difference, non-difference, coreferentiality, and qualification qua relations. Methodologically, philological care is paired with formal logical analysis on the basis of ‘Navya-Nyāya Formal Language’ premises and an axiomatic set theory-based approach. This study is intended as the first step of a broader investigation dedicated to analysing causation and transformation in (...) non-difference. (shrink)

The present paper is a continuation of a previous one by the same title, the content of which faced the issue concerning the relations of coreference and qualification in compliance with the Navya-Nyāya theoretical framework, although prompted by the Advaita-Vedānta enquiry regarding non-difference. In a complementary manner, by means of a formal analysis of equivalence, equality, and identity, this section closes the loop by assessing the extent to which non-difference, the main issue here, cannot be reduced to any of the (...) former. The following sections of this study will focus on the assessment of the eventual possibility of causation and transformation in non-difference. (shrink)

Decision theory faces a number of problematic gambles which challenge it to say what value an ideal rational agent should assign to the gamble, and why. Yet little attention has been devoted to the question of what an ideal rational agent is, and in what sense decision theory may be said to apply to one. I show that, given one arguably natural set of constraints on the preferences of an idealized rational agent, such an agent is forced to be indifferent (...) among entire families of goods, and hence cannot choose among them. This result illustrates the dangers of speaking of the choices of an ?ideal rational agent? when one does not make precise the exact nature of the idealizing assumptions. The result may also be viewed as providing an upper bound on the kinds of idealizing assumptions which can be made for rational agents, beyond which the very concept of choice becomes attenuated. (shrink)

A number of philosophers have attempted to solve the problem of null-probability possible events in Bayesian epistemology by proposing that there are infinitesimal probabilities. Hájek and Easwaran have argued that because there is no way to specify a particular hyperreal extension of the real numbers, solutions to the regularity problem involving infinitesimals, or at least hyperreal infinitesimals, involve an unsatisfactory ineffability or arbitrariness. The arguments depend on the alleged impossibility of picking out a particular hyperreal extension of the real numbers (...) and/or of a particular value within such an extension due to the use of the Axiom of Choice. However, it is false that the Axiom of Choice precludes a specification of a hyperreal extension—such an extension can indeed be specified. Moreover, for all we know, it is possible to explicitly specify particular infinitesimals within such an extension. Nonetheless, I prove that because any regular probability measure that has infinitesimal values can be replaced by one that has all the same intuitive features but other infinitesimal values, the heart of the arbitrariness objection remains. (shrink)

The program put forward in von Wright's last works defines deontic logic as ``a study of conditions which must be satisfied in rational norm-giving activity'' and thus introduces the perspective of logical pragmatics. In this paper a formal explication for von Wright's program is proposed within the framework of set-theoretic approach and extended to a two-sets model which allows for the separate treatment of obligation-norms and permission norms. The three translation functions connecting the language of deontic logic with the language (...) of the extended set-theoretical approach are introduced, and used in proving the correspondence between the deontic theorems, on one side, and the perfection properties of the norm-set and the ``counter-set'', on the other side. In this way the possibility of reinterpretation of standard deontic logic as the theory of perfection properties that ought to be achieved in norm-giving activity has been formally proved. The extended set-theoretic approach is applied to the problem of rationality of principles of completion of normative systems. The paper concludes with a plaidoyer for logical pragmatics turn envisaged in the late phase of Von Wright's work in deontic logic. (shrink)

A set of sentential revision operations can be generated in a select-direct way within a new framework for belief change named descriptor revision firstly introduced in Hansson [8]. In this paper, we adopt another constructive approach to these operations, based on a relation \ on sentences named believability relation. Intuitively, \ means that the subject is at least as prone to believe or accept \ as to believe or accept \. We demonstrate that so called H-believability relations and basic believability (...) relations, the second of which the is axiomatically characterized with a set of weak postulates, are faithful alternative models for two typical select-direct sentential revision operations. Then we investigate additional postulates on believability relations that correlate with properties of the generated revision operations. Finally, we show that traditional AGM revision operations can be reconstructed from a strengthened variant of the basic believability relation and there is a close connection between this relation and the standard epistemic entrenchment relation. (shrink)

We show that in a σ‐closed forcing extension, the bounded forcing axiom for Namba forcing fails. This answers a question of J. T. Moore.

We introduce a property of forcing notions, called the anti-, which comes from Aronszajn trees. This property canonically defines a new chain condition stronger than the countable chain condition, which is called the property . In this paper, we investigate the property . For example, we show that a forcing notion with the property does not add random reals. We prove that it is consistent that every forcing notion with the property has precaliber 1 and for forcing notions with the (...) property fails. This negatively answers a part of one of the classical problems about implications between fragments of. (shrink)

If S, T are stationary subsets of a regular uncountable cardinal κ, we say that S reflects fully in $T, S , if for almost all α ∈ T (except a nonstationary set) S ∩ α is stationary in α. This relation is known to be a well-founded partial ordering. We say that a given poset P is realized by the reflection ordering if there is a maximal antichain $\langle X_p; p \in P\rangle$ of stationary subsets of $\operatorname{Reg}(\kappa)$ so that (...) $\forall p, q \in P \forall S \subseteq X_p, T \subseteq X_q \text{stationary}: (S We prove that if $V = L\lbrack\overset{\rightarrow\mathscr{U}}\rbrack, o^\mathscr{U} (\kappa) = \kappa^{++}$ , and P is an arbitrary well-founded poset of cardinality ≤ κ + then there is a generic extension where P is realized by the reflection ordering on κ. (shrink)

We provide a new interpretation of Zeno’s Paradox of Measure that begins by giving a substantive account, drawn from Aristotle’s text, of the fact that points lack magnitude. The main elements of this account are (1) the Axiom of Archimedes which states that there are no infinitesimal magnitudes, and (2) the principle that all assignments of magnitude, or lack thereof, must be grounded in the magnitude of line segments, the primary objects to which the notion of linear magnitude applies. Armed (...) with this account, we are ineluctably driven to introduce a highly constructive notion of (outer) measure based exclusively on the total magnitude of potentially infinite collections of line segments. The Paradox of Measure then consists in the proof that every finite or potentially infinite collection of points lacks magnitude with respect to this notion of measure. We observe that the Paradox of Measure, thus understood, troubled analysts into the 1880’s, despite their knowledge that the linear continuum is uncountable. The Paradox was ultimately resolved by Borel in his thesis of 1893, as a corollary to his celebrated result that every countable open cover of a closed line segment has a finite sub-cover, a result he later called the “First Fundamental Theorem of Measure Theory.” This achievement of Borel has not been sufficiently appreciated. We conclude with a metamathematical analysis of the resolution of the paradox made possible by recent results in reverse mathematics. (shrink)

We survey the use of extra-set-theoretic hypotheses, mainly the continuum hypothesis, in the C*-algebra literature. The Calkin algebra emerges as a basic object of interest.

We show that, like singular cardinals, and weakly compact cardinals, Jensen's core model K for measures of order zero [4] calculates correctly the successors of Jónsson cardinals, assuming $O^{Sword}$ does not exist. Namely, if $\kappa$ is a Jónsson cardinal then $\kappa^+ = \kappa^{+K}$ , provided that there is no non-trivial elementary embedding $j:K \longrightarrow K$ . There are a number of related results in ZFC concerning $\cal{P}(\kappa)$ in V and inner models, for $\kappa$ a Jónsson or singular cardinal.

We present a direct proof of the consistency of the existence of a five element basis for the uncountable linear orders. Our argument is based on the approach of König, Larson, Moore and Veličković and simplifies the original proof of Moore.

The mantle is the intersection of all ground models of V. We show that if there exists an extendible cardinal then the mantle is the smallest ground model of V.

We prove various theorems about the preservation and destruction of the tree property at ω2. Working in a model of Mitchell [9] where the tree property holds at ω2, we prove that ω2 still has the tree property after ccc forcing of size \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\aleph_1}$$\end{document} or adding an arbitrary number of Cohen reals. We show that there is a relatively mild forcing in this same model which destroys the tree property. Finally we (...) prove from a supercompact cardinal that the tree property at ω2 can be indestructible under ω2-directed closed forcing. (shrink)

We investigate how the sentence choice semantics for propositional superposition logic developed in Tzouvaras could be extended so as to successfully apply to first-order superposition logic. There are two options for such an extension. The apparently more natural one is the formula choice semantics based on choice functions for pairs of arbitrary formulas of the basis language. It is proved however that the universal instantiation scheme of first-order logic, $\varphi \rightarrow \varphi $, is false, as a scheme of tautologies, with (...) respect to FCS. This causes the total failure of FCS as a candidate semantics. Then we turn to the other option, which is a variant of SCS, since it uses again choice functions for pairs of sentences only. This semantics however presupposes that the applicability of the connective | is restricted to quantifier-free sentences, and thus the class of well-formed formulas and sentences of the language is restricted too. Granted these syntactic restrictions, the usual axiomatizations of FOLS turn out to be sound and conditionally complete with respect to this second semantics, just like the corresponding systems of PLS. (shrink)

We show that the notion of cardinality of a set is independent from that of wellordering, and that reasonable total notions of cardinality exist in every model of ZF where the axiom of choice fails. Such notions are either definable in a simple and natural way, or non-definable, produced by forcing. Analogous cardinality notions exist in nonstandard models of arithmetic admitting nontrivial automorphisms. Certain motivating phenomena from quantum mechanics are also discussed in the Appendix.

We examine what happens if we replace ZFC with a localistic/relativistic system, LZFC, whose central new axiom, denoted by Loc(ZFC), says that every set belongs to a transitive model of ZFC. LZFC consists of Loc(ZFC) plus some elementary axioms forming Basic Set Theory (BST). Some theoretical reasons for this shift of view are given. All ${\Pi_2}$ consequences of ZFC are provable in LZFC. LZFC strongly extends Kripke-Platek (KP) set theory minus Δ0-Collection and minus ${\in}$ -induction scheme. ZFC+ “there is an (...) inaccessible cardinal” proves the consistency of LZFC. In LZFC we focus on models rather than cardinals, a transitive model being considered as the analogue of an inaccessible cardinal. Pushing this analogy further we define α-Mahlo models and ${\Pi_1^1}$ -indescribable models, the latter being the analogues of weakly compact cardinals. Also localization axioms of the form ${Loc({\rm ZFC}+\phi)}$ are considered and their global consequences are examined. Finally we introduce the concept of standard compact cardinal (in ZFC) and some standard compactness results are proved. (shrink)

An instance of Stratified Comprehension ∀x₁ … ∀x n ∃y∀x (x ∈ y ↔ φ(x, x₁, …, x n )) is called strictly impredicative iff, under minimal stratification, the type of x is 0. Using the technology of forcing, we prove that the fragment of NF based on strictly impredicative Stratified Comprehension is consistent. A crucial part in this proof, namely showing genericity of a certain symmetric filter, is due to Robert Solovay. As a bonus, our interpretation also satisfies some (...) instances of Stratified Comprehension which are not strictly impredicative. For example, it verifies existence of Frege natural numbers. Apparently, this is a new subsystem of NF shown to be consistent. The consistency question for the whole theory NF remains open (since 1937). (shrink)

We give an overview of a research line concentrated on finding to which extent compactness fails at the level of first uncountable cardinal and to which extent it could be recovered on some other perhaps not so large cardinal. While this is of great interest to set theorists, one of the main motivations behind this line of research is in its applicability to other areas of mathematics. We give some details about this and we expose some possible directions for further (...) research. (shrink)

In this paper, we explore some of the consequences of Martin’s Conjecture on degree invariant Borel maps. These include the strongest conceivable ergodicity result for the Turing equivalence relation with respect to the filter on the degrees generated by the cones, as well as the statement that the complexity of a weakly universal countable Borel equivalence relation always concentrates on a null set.

Fitch's basic logic is an untyped illative combinatory logic with unrestricted principles of abstraction effecting a type collapse between properties (or concepts) and individual elements of an abstract syntax. Fitch does not work axiomatically and the abstraction operation is not a primitive feature of the inductive clauses defining the logic. Fitch's proof that basic logic has unlimited abstraction is not clear and his proof contains a number of errors that have so far gone undetected. This paper corrects these errors and (...) presents a reasonably intuitive proof that Fitch's system K supports an implicit abstraction operation. Some general remarks on the philosophical significance of basic logic, especially with respect to neo-logicism, are offered, and the paper concludes that basic logic models a highly intensional form of logicism. (shrink)

We give a derivation of exclusion principles for the elementary particles of the standard model, using simple mathematical principles arising from a set theory of identical particles. We apply the theory of permutation group actions, stating some theorems which are proven elsewhere, and interpreting the results as a heuristic derivation of Pauli's Exclusion Principle (PEP) which dictates the formation of elements in the periodic table and the stability of matter, and also a derivation of quark confinement. We arrive at these (...) properties by using a symmetry property of collections of the particles themselves as compared for example to the symmetry property of their wave function under interchange of two particles. (shrink)

The use of tensed language and the metaphor of set ‘formation’ found in informal descriptions of the iterative conception of set are seldom taken at all seriously. Both are eliminated in the nonmodal stage theories that formalise this account. To avoid the paradoxes, such accounts deny the Maximality thesis, the compelling thesis that any sets can form a set. This paper seeks to save the Maximality thesis by taking the tense more seriously than has been customary (although not literally). A (...) modal stage theory, MST, is developed in a bimodal language, governed by a tenselike logic. Such a language permits a very natural axiomatisation of the iterative conception, which upholds the Maximality thesis. It is argued that the modal approach is consonant with mathematical practice and a plausible metaphysics of sets and shown that MST interprets a natural extension of Zermelo set theory less the axiom of Infinity and, when extended with a further axiom concerning the extent of the hierarchy, interprets Zermelo–Fraenkel set theory. (shrink)

Given a countable transitive model of set theory and a partial order contained in it, there is a natural countable Borel equivalence relation on generic filters over the model; two are equivalent if they yield the same generic extension. We examine the complexity of this equivalence relation for various partial orders, focusing on Cohen and random forcing. We prove, among other results, that the former is an increasing union of countably many hyperfinite Borel equivalence relations, and hence is amenable, while (...) the latter is neither amenable nor treeable. (shrink)

In this paper we give characterizations of the stable and ℵ0-stable theories, in terms of an external property called representation. In the sense of the representation property, the mentioned classes of first-order theories can be regarded as “not very complicated”.

Let σ(U) denote the number of automorphisms of a model U of power ω1. We derive a necessary and sufficient condition in terms of trees for the existence of an U with $\omega_1 < \sigma(\mathfrak{U}) < 2^{\omega_1}$. We study the sufficiency of some conditions for σ(U) = 2ω1 . These conditions are analogous to conditions studied by D. Kueker in connection with countable models.

We show that it is consistent with ordinary set theory ZFC and the generalized continuum hypothesis that there exist two 1-separable abelian groups of cardinality 1 which are filtration-equivalent and one is a Whitehead group but the other is not. This solves one of the open problems from Eklof and Mekler [2].

In this paper, we study the relationship between the cofinalityc(Sym(ω)) of the infinite symmetric group and the minimal cardinality $$\underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle\thicksim}$}}{b} $$ of an unbounded familyF of ω ω.

We describe the inner models with representatives in all equivalence classes of thin equivalence relations in a given projective pointclass of even level assuming projective determinacy. The main result shows that these models are characterized by their correctness and the property that they correctly compute the tree from the appropriate scale. The main step towards this characterization shows that the tree from a scale can be reconstructed in a generic extension of an iterate of a mouse. We then construct models (...) with this property as generic extensions of iterates of mice under the assumption that the corresponding projective ordinal is below ω2ω2. On the way, we consider several related problems, including the question when forcing does not add equivalence classes to thin projective equivalence relations. For instance, we show that if every set has a sharp, then reasonable forcing does not add equivalence classes to thin provably View the MathML source Δ1/3 equivalence relations, and generalize this to all projective levels. (shrink)

We study the relationship between various properties of the real numbers and weak choice principles.