2
votes
2answers
44 views

First order formula defining a predicate which asserts that a set is finite.

Is it possible to define a predicate in the first order language of set theory such that $F(x)$ is true iff $x$ is a finite set? I understand that FOL cannot assert that the domain of discourse is ...
4
votes
2answers
160 views

Is there a minimal axiomatization of ZFC?

Working in ZFC, does there exist a set $\Sigma$ of sentences which axiomatizes ZFC (i.e. every sentence in $\Sigma$ is provable from your favorite axiomatization of ZFC, and vice versa) and is minimal ...
4
votes
1answer
118 views

Proof of “If $ZFC$ proves there is an inaccessible cardinal, then $ZFC$ is inconsistent”.

Let $I$ be the statement "there is an inaccessible cardinal". I'm aware of two proofs of "If $ZFC\vdash I$ then $ZFC$ is inconsistent". One proof uses the Second Incompleteness Theorem, which I ...
14
votes
1answer
329 views

What axioms does ZF have, exactly?

While trying to find the list of axioms of ZF on the Web and in literature I noticed that the lists I had found varied quite a bit. Some included the axiom of empty set, while others didn't. That is ...
4
votes
2answers
79 views

Is it meaningless to say $M\prec N$ for two proper class models?

Kunen in page 88 of his "Set Theory" book says: ... For a specific given $\varphi$, the notion $M\prec_{\varphi}N$ (i.e. $\forall \overline{a}\in M~~~M\models \varphi ...
4
votes
2answers
177 views

How much set theory is necessary for serious logic?

I'm currently studying logic at my university and I have been trying to squeeze in as much set theory on the side as possible. Considering that I am spending quite a lot of time studying set theory ...
2
votes
1answer
55 views

Transfinite Cardinals and Expressive Power

Consider a language with a sufficiently rich lexicon such that, for every (finite and transfinite) cardinal K, it's possible to express the statement that there exist K-many objects. Two general ...
1
vote
1answer
59 views

Is it possible to iterate a function transfinite times?

Let $f:A\rightarrow A$ be a function. We can simply define $f\circ f$, $f\circ f\circ f$, etc., for each given natural number inductively. $f^{(0)}=id_A$ $\forall n\in\omega \qquad f^{(n+1)}=f\circ ...
1
vote
1answer
104 views

Miller's Construction, Partition Principle and Failure of Axiom of Choice

Partition Principle ($PP$) is the following statement: For all sets $a$, $b$ there is an injection $f:a\rightarrow b$ iff there is a surjection $g:b\rightarrow a$ It is known that $ZF\vdash ...
1
vote
2answers
168 views

How many undecidable statements are there in ZFC?

There are several statements known to be undecidable in ZFC, with the continuum hypothesis probably being the most "popular" one. Is it known how many undecidable statements are there in ZFC? I.e. ...
8
votes
0answers
97 views

Does such a first-order theory exist? A question pertaining to transitive models of ZFC.

Assume a proper class of inaccessibles. Does there exist a first-order theory $T$ subject to the following conditions? $T$ admits an infinite model Whenever $M$ is a transitive model of ZFC with $T ...
3
votes
0answers
64 views

Manifolds of Non-Standard Dimension

Can there exists (non-trivial) manifolds of non-standard dimensions? Certainly, there do exist manifolds of dimension $n$ for any $n \in \mathbb{N}$ (as well as manifolds of countably many ...
5
votes
1answer
106 views

How much maths can we do in NF(U)?

I have recently become interested in non-standard set theories, particularly in NF and NFU and have been reading some things here and there. Of course, I don't know much about it and I'm still trying ...
0
votes
1answer
69 views

Godel's completeness theorem and formula that states consistency of ZF

Godel's completeness theorem, in original formulation, says that every logically valid statement/formula has finite deduction of a formula. Now then there is Godel's incompleteness theorem. Would this ...
1
vote
0answers
58 views

Are there axiomatizations of first order logic or set theory defined in first order logic or set theory?

There are several axiomatizations for number theory, group theory, and other theories represented in first order logic. Further, these theories are also representable in set theory such as $\sf ZFC$ ...
3
votes
1answer
49 views

A question about second-order logic and inaccessible cardinals.

Let $\kappa$ denote an inaccessible cardinal, and suppose $T \in V_\kappa$ is a second-order theory. Now consider some mathematical structure $X \in V_\kappa$. Then I think it is clear that $X \models ...
1
vote
1answer
52 views

Comprehension and Impredicativity

Wang and McNaughton (Les Systemes Axiomatiques de la Theorie des Ensembles, 1953) discuss briefly the topic of impredicativity in chapter 2 (titled 'Type Theory') of the above mentioned book, but I'm ...
2
votes
1answer
61 views

If a version of GCH holds for Chang's $\kappa$-constructibility, does a version of GCH hold for $L_{\infty}$?

In C.C. Chang's paper "Sets Constructible Using $L_{\kappa \kappa}$" one can "deduce a version of the GCH, theorem VI [(iv)--my comment], assuming that all sets are $\kappa$-constructible." Now ...
1
vote
0answers
95 views

A Question Regarding Consistent Fragments of Naive (Ideal) Set Theory

It is well known that Naive (to some, otherwise known as Ideal) set theory, that is, the set theory generated by the axioms: (EXT) (x)(x $\in$ A iff x $\in$ B) iff A=B (COMP) ($\exists$y)(x)(x ...
6
votes
1answer
88 views

Construction of Ultrafilters

I've been doing a lot of work with ultrapowers and saturation recently. In particular, I am reading chapter 6 of Chang and Keisler as well as Keisler's paper on "Ultraproducts which are not ...
0
votes
2answers
118 views

Is the “Most Important Property a Set S has” Necessary and Sufficient to Define a Paradox-Free Notion of Set?

About a year and a half ago, while I was looking on the Web for papers regarding the Russell paradox, I chanced to find an interesting concept. This concept was contained in what (for want of a ...
7
votes
1answer
187 views

What is semantics of “type”? Do “types” of “type theory” semantically differ from “set” of set theory?

"To be of a (certain type)" is a fundamental relationship for ontology and the computer science "ontologies" are in the core of Semantic Web (which is my interest). But I did not encounter a ...
0
votes
2answers
59 views

Ordinal existence

Is there any ordinal $\alpha$ such that $\omega ^ {\omega ^ \alpha} = \alpha$? Could you please suggest me how to even try to solve this?
2
votes
1answer
107 views

Cardinalities of Collections of Models

Let $T$ be a complete theory in a countable language (with only infinite models). Recall the spectrum function: $I(\aleph_\alpha,T)=$ the number of non-isomorphic models of $T$ of cardinality ...
5
votes
1answer
75 views

Partial order on cardinalities without the axiom of choice

Cardinality can still be defined without choice, e.g. as equivalence class of equipotent sets, see Defining cardinality in the absence of choice. Injections define partial order on cardinalities by ...
0
votes
1answer
46 views

Examples of non-trivial determiner formulas of trnsitive models of ZFC

Notation: For each $\{\in\}$-formula $\varphi(x_1,\cdots,x_n)$ and each $\in$-model $M$, define: $$\varphi (M)=\{(a_{1},\cdots,a_{n})\in M^{n}~|~\langle M,\in\rangle\models \varphi ...
2
votes
2answers
155 views

Is it Theoretically Impossible to Demonstrate that Set Theories Are Consistent?

I have to present on the main realist and non-realist arguments for/against set theory. According to one of my sources, it remains a matter of debate as to whether any of the set theories' (ZF, NF, ...
6
votes
2answers
251 views

Set theoretic realism

What are the main contemporary arguments for and against realism about set theory?
3
votes
1answer
72 views

The order-theoretic structure of the ordinal numbers in non-standard models

I have read the following. Proposition. Let $T$ denote the first-order theory of $\mathbb{N}$ in the language of arithmetic. Then any countable non-standard model of $T$ is order isomorphic to a ...
3
votes
0answers
85 views

Countable transitive $T \vDash ZFC-P$ with $\approx$ not absolute: why do we need $H(\aleph_3)$?

I am trying to solve Exercise IV.3.31 from Kunen's Foundations of Mathematics. I think I have a solution but I am confused by one of the hints. By request, here is the text of the exercise. ...
2
votes
1answer
76 views

Absolute confusion! (A question about absolute *sentences*)

I'm seriously confused about absoluteness. A formula in the language of a theory $T$ is absolute for $T$ structures if its truth value is the same in all standard transitive models of $T$ (this may ...
2
votes
0answers
106 views

How large or small can the gap in Shelah's main gap theorem be, up to consistency?

Shelah's main gap theorem in model theory says: For each first order complete theory $T$ in a countable language if $I(T,\kappa)$ denotes the number of its models of size $\kappa$ then one of ...
1
vote
1answer
47 views

Models of ZFC as Ordered Fields

Question: Let $M$ be a set such that $\langle M,\in\rangle\vDash ZFC$. Consider the partial order $\langle M,\subseteq\rangle$. Using order extension principle there is a linear order $\subseteq^{*}$ ...
1
vote
1answer
104 views

Is there any relevance between Boolean Algebras and Fields?

In some sense Boolean Algebras and Fields have same operators and constants. In both structures there are operators addition ($+$ , $\vee$), multiplication ($\times$ , $\wedge$), inverse with respect ...
2
votes
2answers
110 views

Coding Forcing Notions by Ordinal Numbers: A Possible Approach to Shelah-Foreman-Magidor Conjecture

Forcing notions are partial orders. In some sense each partial order is a "combination" of some well-orderings and each well-orderings is isomorphic to a unique ordinal number. Thus in some sense a ...
0
votes
1answer
65 views

Forcing Preservation on Arbitrary Set Theoretic Formulas

Fixing a ground model $M$, a forcing notion $\mathbb{P}$ is called cardinal preserving iff for all $\mathbb{P}$-generic filter $G$ over $M$ we have: $$\forall a\in M~~~(M\models ...
4
votes
0answers
68 views

How to think about iterated ultrapowers?

I would like to gain some basic intuition about iterated ultrapowers. I am perfectly happy with accepting the construction and can see that it fits into a fundamental role in many places (for example, ...
6
votes
0answers
177 views

Is Kunen's claim about non-equivalent forms of Axiom of Choice, true?

Consider the following forms of the axiom of choice: $AC_1:\forall F\neq \emptyset~~~(\emptyset\notin F~\wedge~\forall x,y\in F~~~(x\neq y\rightarrow x\cap y= \emptyset))\rightarrow \exists C~\forall ...
1
vote
1answer
85 views

Modal set-theory

In his “The Potential Hierarchy of Sets”, Review of Symbolic Logic 6:2 (2013), 205-28 Øystein Linnebo has proposed a modal set-theory. I was wondering what kind of utility can such a theory have for a ...
1
vote
1answer
37 views

Model for replacement

If $R_{k} $ is a model for replacement, is necesarly k a strong limit cardinal? And if k is a regular cardinal, are then equivalent the sentences: k is a strongly inaccesible cardinal if and only if ...
0
votes
1answer
47 views

About the definible sets $L_\alpha$

Let $\alpha$ be an ordinal number. Is that true that $\alpha$ = $\beth_\alpha $ is equivalent to the statement $|L_\alpha|=|R_\alpha|$, where $L_\alpha $ is the $\alpha$-th stage of the constructible ...
7
votes
1answer
58 views

Every elementary submodel of $H(\aleph_1)$ is transitive

I am trying to solve the first part of Exercise II.17.30 in Kunen's Foundations of Mathematics which asks: Prove that every $A \preccurlyeq H(\aleph_1)$ is transitive. Here we are working over ...
4
votes
1answer
79 views

Ultraproducts of models of ZFC

Let $D$ be a non-principal ultrafilter over $\mathbb{N}$. Let $A_i$ for $i\in\mathbb{N}$ be (countable) models of ZFC such that $A_i\models \mathfrak{c}=\aleph_i$. Then, what is the size of the ...
1
vote
1answer
78 views

Is there a formalisation of set theory where unions can be taken over some classes that are not a priori known to be sets?

Of course, fully unrestricted unions in ZFC will immediately lead to inconsistency, but is there a variation where restrictions on allowed classes are given explicitly at least, in terms of the ...
4
votes
0answers
51 views

Can existence of aleph one be proved without the power set axiom? [duplicate]

Cantor's construction of $\aleph_1$ is to notice that all ordinals constructed after $\omega$ are countable, take the union of all countable ordinals, and then show that this union can not be ...
5
votes
2answers
177 views

About proving that the Continuum Hypothesis is independent of ZFC

In Mathematical Logic, we were introduced to the concept of forcing using countable transitive models - ctm - of $\mathsf{ZFC}$. Using two different notions of forcing we were able to build (from the ...
1
vote
1answer
83 views

Hall's marriage Theorem and Tychonoff Theorem

I was reading this paper. In particular the second point. He proves the Hall's marriage Theorem for infinite family using the Tychonoff theorem on topological product of compact $T_2$ spaces and the ...
7
votes
1answer
210 views

New Axioms of Infinity

Axiom of Infinity says there is an inductive set (i.e. a set which includes $\emptyset$ and is closed under successor operator). Formally: $Inf:\exists x~(\emptyset\in x~\wedge~\forall y\in ...
2
votes
1answer
86 views

Can the consistency of ZF be proved in MK?

When adding choice to Zermelo–Fraenkel (ZF) set theory, one can go further than ZFC, by first adding classes, then adding global choice, and then proving that the resulting von Neumann–Bernays–Gödel ...
5
votes
1answer
193 views

Asymmetric roles that are symmetric in every instance

This is similar to something else I posted, but this time we'll pretend we've never heard of infinite sets or infinite series. \begin{align} & \sin(\alpha+\beta+\gamma+\delta+\varepsilon+\zeta) ...