Skip to main content
replaced http://math.stackexchange.com/ with https://math.stackexchange.com/
Source Link

Ioanna Dimitriou's Ph.D. thesis as well many papers by Arthur Apter would be a good start.

You may want to read the proof of the Feferman-Levy construction, there's a nice proof in Jech "The Axiom of Choice" as well Ioanna Dimitriou M.Sc. and Ph.D. theses. Also interesting is the results in

Truss, John "Models of set theory containing many perfect sets." Ann. Math. Logic 7 (1974), 197–219.

Also relevant are the results by Magidor that if $\operatorname{cf}(\omega_1)=\operatorname{cf}(\omega_2)=\omega$ then $0^\#$ exists (this can be found, I believe in Magidor's paper proving the covering lemma, but also in Jech "Set Theory" as an exercise for Chapter 18); and similar applications of the covering lemma which prove the necessity of large cardinals for some of the results. Related to that is Andres Caicedo's answer to my [very old] MSE question: Consistency of $\operatorname{cf}(\omega_1)=\operatorname{cf}(\omega_2)=\omega$Consistency of $\operatorname{cf}(\omega_1)=\operatorname{cf}(\omega_2)=\omega$.

On the same breath, one should mention

Busche, Daniel; Schindler, Ralf "The strength of choiceless patterns of singular and weakly compact cardinals." Ann. Pure Appl. Logic 159 (2009), no. 1-2, 198–248.

Which also deals with the question of many singular $\aleph_n$'s and its consistency strength.

From these papers and their reference, I think one should be able to cover all the known material.

Ioanna Dimitriou's Ph.D. thesis as well many papers by Arthur Apter would be a good start.

You may want to read the proof of the Feferman-Levy construction, there's a nice proof in Jech "The Axiom of Choice" as well Ioanna Dimitriou M.Sc. and Ph.D. theses. Also interesting is the results in

Truss, John "Models of set theory containing many perfect sets." Ann. Math. Logic 7 (1974), 197–219.

Also relevant are the results by Magidor that if $\operatorname{cf}(\omega_1)=\operatorname{cf}(\omega_2)=\omega$ then $0^\#$ exists (this can be found, I believe in Magidor's paper proving the covering lemma, but also in Jech "Set Theory" as an exercise for Chapter 18); and similar applications of the covering lemma which prove the necessity of large cardinals for some of the results. Related to that is Andres Caicedo's answer to my [very old] MSE question: Consistency of $\operatorname{cf}(\omega_1)=\operatorname{cf}(\omega_2)=\omega$.

On the same breath, one should mention

Busche, Daniel; Schindler, Ralf "The strength of choiceless patterns of singular and weakly compact cardinals." Ann. Pure Appl. Logic 159 (2009), no. 1-2, 198–248.

Which also deals with the question of many singular $\aleph_n$'s and its consistency strength.

From these papers and their reference, I think one should be able to cover all the known material.

Ioanna Dimitriou's Ph.D. thesis as well many papers by Arthur Apter would be a good start.

You may want to read the proof of the Feferman-Levy construction, there's a nice proof in Jech "The Axiom of Choice" as well Ioanna Dimitriou M.Sc. and Ph.D. theses. Also interesting is the results in

Truss, John "Models of set theory containing many perfect sets." Ann. Math. Logic 7 (1974), 197–219.

Also relevant are the results by Magidor that if $\operatorname{cf}(\omega_1)=\operatorname{cf}(\omega_2)=\omega$ then $0^\#$ exists (this can be found, I believe in Magidor's paper proving the covering lemma, but also in Jech "Set Theory" as an exercise for Chapter 18); and similar applications of the covering lemma which prove the necessity of large cardinals for some of the results. Related to that is Andres Caicedo's answer to my [very old] MSE question: Consistency of $\operatorname{cf}(\omega_1)=\operatorname{cf}(\omega_2)=\omega$.

On the same breath, one should mention

Busche, Daniel; Schindler, Ralf "The strength of choiceless patterns of singular and weakly compact cardinals." Ann. Pure Appl. Logic 159 (2009), no. 1-2, 198–248.

Which also deals with the question of many singular $\aleph_n$'s and its consistency strength.

From these papers and their reference, I think one should be able to cover all the known material.

added 409 characters in body
Source Link
Asaf Karagila
  • 39.9k
  • 8
  • 135
  • 283

Ioanna Dimitriou's Ph.D. thesis as well many papers by Arthur Apter would be a good start.

You may want to read the proof of the Feferman-Levy construction, there's a nice proof in Jech "The Axiom of Choice" as well Ioanna Dimitriou M.Sc. and Ph.D. theses. Also interesting is the results in

Truss, John "Models of set theory containing many perfect sets." Ann. Math. Logic 7 (1974), 197–219.

Also relevant are the results by Magidor that if $\operatorname{cf}(\omega_1)=\operatorname{cf}(\omega_2)=\omega$ then $0^\#$ exists;exists (this can be found, I believe in Magidor's paper proving the covering lemma, but also in Jech "Set Theory" as an exercise for Chapter 18); and similar applications of the covering lemma which prove the necessity of large cardinals for some of the results. Related to that is Andres Caicedo's answer to my [very old] MSE question: Consistency of $\operatorname{cf}(\omega_1)=\operatorname{cf}(\omega_2)=\omega$.

On the same breath, one should mention

Busche, Daniel; Schindler, Ralf "The strength of choiceless patterns of singular and weakly compact cardinals." Ann. Pure Appl. Logic 159 (2009), no. 1-2, 198–248.

Which also deals with the question of many singular $\aleph_n$'s and its consistency strength.

From these papers and their reference, I think one should be able to cover all the known material.

Ioanna Dimitriou's Ph.D. thesis as well many papers by Arthur Apter would be a good start.

You may want to read the proof of the Feferman-Levy construction, there's a nice proof in Jech "The Axiom of Choice" as well Ioanna Dimitriou M.Sc. and Ph.D. theses. Also interesting is the results in

Truss, John "Models of set theory containing many perfect sets." Ann. Math. Logic 7 (1974), 197–219.

Also relevant are the results by Magidor that if $\operatorname{cf}(\omega_1)=\operatorname{cf}(\omega_2)=\omega$ then $0^\#$ exists; and similar applications of the covering lemma which prove the necessity of large cardinals for some of the results.

On the same breath, one should mention

Busche, Daniel; Schindler, Ralf "The strength of choiceless patterns of singular and weakly compact cardinals." Ann. Pure Appl. Logic 159 (2009), no. 1-2, 198–248.

Which also deals with the question of many singular $\aleph_n$'s and its consistency strength.

From these papers and their reference, I think one should be able to cover all the known material.

Ioanna Dimitriou's Ph.D. thesis as well many papers by Arthur Apter would be a good start.

You may want to read the proof of the Feferman-Levy construction, there's a nice proof in Jech "The Axiom of Choice" as well Ioanna Dimitriou M.Sc. and Ph.D. theses. Also interesting is the results in

Truss, John "Models of set theory containing many perfect sets." Ann. Math. Logic 7 (1974), 197–219.

Also relevant are the results by Magidor that if $\operatorname{cf}(\omega_1)=\operatorname{cf}(\omega_2)=\omega$ then $0^\#$ exists (this can be found, I believe in Magidor's paper proving the covering lemma, but also in Jech "Set Theory" as an exercise for Chapter 18); and similar applications of the covering lemma which prove the necessity of large cardinals for some of the results. Related to that is Andres Caicedo's answer to my [very old] MSE question: Consistency of $\operatorname{cf}(\omega_1)=\operatorname{cf}(\omega_2)=\omega$.

On the same breath, one should mention

Busche, Daniel; Schindler, Ralf "The strength of choiceless patterns of singular and weakly compact cardinals." Ann. Pure Appl. Logic 159 (2009), no. 1-2, 198–248.

Which also deals with the question of many singular $\aleph_n$'s and its consistency strength.

From these papers and their reference, I think one should be able to cover all the known material.

Source Link
Asaf Karagila
  • 39.9k
  • 8
  • 135
  • 283

Ioanna Dimitriou's Ph.D. thesis as well many papers by Arthur Apter would be a good start.

You may want to read the proof of the Feferman-Levy construction, there's a nice proof in Jech "The Axiom of Choice" as well Ioanna Dimitriou M.Sc. and Ph.D. theses. Also interesting is the results in

Truss, John "Models of set theory containing many perfect sets." Ann. Math. Logic 7 (1974), 197–219.

Also relevant are the results by Magidor that if $\operatorname{cf}(\omega_1)=\operatorname{cf}(\omega_2)=\omega$ then $0^\#$ exists; and similar applications of the covering lemma which prove the necessity of large cardinals for some of the results.

On the same breath, one should mention

Busche, Daniel; Schindler, Ralf "The strength of choiceless patterns of singular and weakly compact cardinals." Ann. Pure Appl. Logic 159 (2009), no. 1-2, 198–248.

Which also deals with the question of many singular $\aleph_n$'s and its consistency strength.

From these papers and their reference, I think one should be able to cover all the known material.