Friedman, Sy D. 1953
Overview
Works:  22 works in 76 publications in 1 language and 1,747 library holdings 

Genres:  Conference papers and proceedings 
Roles:  Author, Editor, Other 
Publication Timeline
.
Most widely held works by
Sy D Friedman
Fine structure and class forcing by
Sy D Friedman(
)
18 editions published between 2000 and 2011 in English and held by 1,241 WorldCat member libraries worldwide
18 editions published between 2000 and 2011 in English and held by 1,241 WorldCat member libraries worldwide
Generalized descriptive set theory and classification theory by
Sy D Friedman(
Book
)
13 editions published between 1900 and 2014 in English and held by 172 WorldCat member libraries worldwide
Descriptive set theory is mainly concerned with studying subsets of the space of all countable binary sequences. In this paper we study the generalization where countable is replaced by uncountable. We explore properties of generalized Baire and Cantor spaces, equivalence relations and their Borel reducibility. The study shows that the descriptive set theory looks very different in this generalized setting compared to the classical, countable case. We also draw the connection between the stability theoretic complexity of firstorder theories and the descriptive set theoretic complexity of their isomorphism relations. Our results suggest that Borel reducibility on uncountable structures is a model theoretically natural way to compare the complexity of isomorphism relations
13 editions published between 1900 and 2014 in English and held by 172 WorldCat member libraries worldwide
Descriptive set theory is mainly concerned with studying subsets of the space of all countable binary sequences. In this paper we study the generalization where countable is replaced by uncountable. We explore properties of generalized Baire and Cantor spaces, equivalence relations and their Borel reducibility. The study shows that the descriptive set theory looks very different in this generalized setting compared to the classical, countable case. We also draw the connection between the stability theoretic complexity of firstorder theories and the descriptive set theoretic complexity of their isomorphism relations. Our results suggest that Borel reducibility on uncountable structures is a model theoretically natural way to compare the complexity of isomorphism relations
The hyperuniverse project and maximality by
Radek Honzik(
)
9 editions published in 2018 in English and held by 145 WorldCat member libraries worldwide
This collection documents the work of the Hyperuniverse Project which is a new approach to settheoretic truth based on justifiable principles and which leads to the resolution of many questions independent from ZFC. The contributions give an overview of the program, illustrate its mathematical content and implications, and also discuss its philosophical assumptions. It will thus be of wide appeal among mathematicians and philosophers with an interest in the foundations of set theory. The Hyperuniverse Project was supported by the John Templeton Foundation from January 2013 until September 2015.  Back cover
9 editions published in 2018 in English and held by 145 WorldCat member libraries worldwide
This collection documents the work of the Hyperuniverse Project which is a new approach to settheoretic truth based on justifiable principles and which leads to the resolution of many questions independent from ZFC. The contributions give an overview of the program, illustrate its mathematical content and implications, and also discuss its philosophical assumptions. It will thus be of wide appeal among mathematicians and philosophers with an interest in the foundations of set theory. The Hyperuniverse Project was supported by the John Templeton Foundation from January 2013 until September 2015.  Back cover
Logic Colloquium '01 : proceedings of the Annual European Summer Meeting of the Association for Symbolic Logic, held in Vienna,
Austria, August 611, 2001 by Logic Colloquium(
Book
)
10 editions published between 2005 and 2017 in English and held by 108 WorldCat member libraries worldwide
Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. This volume, the twentieth publication in the Lecture Notes in Logic series, contains the proceedings of the 2001 European Summer Meeting of the Association for Symbolic Logic, held at the Vienna University of Technology. Two long articles present accessible expositions on resolution theorem proving and the determinacy of long games. The remaining articles cover separate research topics in many areas of mathematical logic, including applications in computer science, proof theory, set theory, model theory, computability theory, linguistics and aspects of philosophy. This collection will interest not only mathematical logicians but also philosophical logicians, historians of logic, computer scientists, formal linguists and mathematicians working in algebra, abstract analysis and topology
10 editions published between 2005 and 2017 in English and held by 108 WorldCat member libraries worldwide
Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. This volume, the twentieth publication in the Lecture Notes in Logic series, contains the proceedings of the 2001 European Summer Meeting of the Association for Symbolic Logic, held at the Vienna University of Technology. Two long articles present accessible expositions on resolution theorem proving and the determinacy of long games. The remaining articles cover separate research topics in many areas of mathematical logic, including applications in computer science, proof theory, set theory, model theory, computability theory, linguistics and aspects of philosophy. This collection will interest not only mathematical logicians but also philosophical logicians, historians of logic, computer scientists, formal linguists and mathematicians working in algebra, abstract analysis and topology
Sets and computations(
)
8 editions published between 2017 and 2018 in English and held by 53 WorldCat member libraries worldwide
"The contents in this volume are based on the program Sets and Computations that was held at the Institute for Mathematical Sciences, National University of Singapore from 30 March until 30 April 2015. This special collection reports on important and recent interactions between the fields of Set Theory and Computation Theory. This includes the new research areas of computational complexity in set theory, randomness beyond the hyperarithmetic, powerful extensions of Goodstein's theorem and the capturing of large fragments of set theory via elementaryrecursive structures. Further chapters are concerned with central topics within Set Theory, including cardinal characteristics, Fraïssé limits, the setgeneric multiverse and the study of ideals. Also Computation Theory, which includes computable group theory and measuretheoretic aspects of Hilbert's Tenth Problem. A volume of this broad scope will appeal to a wide spectrum of researchers in mathematical logic."Publisher's website
8 editions published between 2017 and 2018 in English and held by 53 WorldCat member libraries worldwide
"The contents in this volume are based on the program Sets and Computations that was held at the Institute for Mathematical Sciences, National University of Singapore from 30 March until 30 April 2015. This special collection reports on important and recent interactions between the fields of Set Theory and Computation Theory. This includes the new research areas of computational complexity in set theory, randomness beyond the hyperarithmetic, powerful extensions of Goodstein's theorem and the capturing of large fragments of set theory via elementaryrecursive structures. Further chapters are concerned with central topics within Set Theory, including cardinal characteristics, Fraïssé limits, the setgeneric multiverse and the study of ideals. Also Computation Theory, which includes computable group theory and measuretheoretic aspects of Hilbert's Tenth Problem. A volume of this broad scope will appeal to a wide spectrum of researchers in mathematical logic."Publisher's website
One hundred years of Russell's paradox : mathematics, logic, philosophy(
)
1 edition published in 2008 in English and held by 11 WorldCat member libraries worldwide
Die in diesem Band zusammengefassten Beiträge stellen die wesentlichen Forschungsergebnisse der internationalen Münchner Konferenz "100 Jahre RussellParadoxon" im Jahr 2001 dar, auf der an die Entdeckung des berühmten Russell Paradoxons vor 100 Jahren erinnert wurde. Die 31 Beiträge und der Einführungsessay des Herausgebers wurden alle  bis auf zwei Ausnahmen  ursprünglich für diesen Band verfasst
1 edition published in 2008 in English and held by 11 WorldCat member libraries worldwide
Die in diesem Band zusammengefassten Beiträge stellen die wesentlichen Forschungsergebnisse der internationalen Münchner Konferenz "100 Jahre RussellParadoxon" im Jahr 2001 dar, auf der an die Entdeckung des berühmten Russell Paradoxons vor 100 Jahren erinnert wurde. Die 31 Beiträge und der Einführungsessay des Herausgebers wurden alle  bis auf zwei Ausnahmen  ursprünglich für diesen Band verfasst
Measurable cardinals and the cofinality of the symmetric group by
Sy D Friedman(
)
2 editions published in 2010 in English and held by 2 WorldCat member libraries worldwide
Assuming the existence of a $P_2\kappa$hypermeasurable cardinal, we construct a model of set theory with a measurable cardinal $\kappa$ such that $2^\kappa=\kappa^{++}$ and the group $\text{Sym}(\kappa)$ of all permutations of $\kappa$ cannot be written as the union of a chain of proper subgroups of length $<\kappa^{++}$. The proof involves iteration of a suitably defined uncountable version of the Miller forcing poset as well as the "tuning fork" argument introduced by the first author and K.Thompson [J. Symb. Log. 73, No. 3, 906918 (2008)]
2 editions published in 2010 in English and held by 2 WorldCat member libraries worldwide
Assuming the existence of a $P_2\kappa$hypermeasurable cardinal, we construct a model of set theory with a measurable cardinal $\kappa$ such that $2^\kappa=\kappa^{++}$ and the group $\text{Sym}(\kappa)$ of all permutations of $\kappa$ cannot be written as the union of a chain of proper subgroups of length $<\kappa^{++}$. The proof involves iteration of a suitably defined uncountable version of the Miller forcing poset as well as the "tuning fork" argument introduced by the first author and K.Thompson [J. Symb. Log. 73, No. 3, 906918 (2008)]
Recursion on inadmissible ordinals by
Sy D Friedman(
Book
)
1 edition published in 1976 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 1976 in English and held by 2 WorldCat member libraries worldwide
THE EIGHTFOLD WAY(
)
1 edition published in 2018 in English and held by 1 WorldCat member library worldwide
1 edition published in 2018 in English and held by 1 WorldCat member library worldwide
Condensation and large cardinals by
Sy D Friedman(
)
1 edition published in 2011 in English and held by 1 WorldCat member library worldwide
1 edition published in 2011 in English and held by 1 WorldCat member library worldwide
The enriched stable core and the relative rigidity of HOD by
Sy D Friedman(
)
1 edition published in 2016 in English and held by 1 WorldCat member library worldwide
1 edition published in 2016 in English and held by 1 WorldCat member library worldwide
<> by
Sy D Friedman(
)
1 edition published in 2013 in English and held by 1 WorldCat member library worldwide
1 edition published in 2013 in English and held by 1 WorldCat member library worldwide
Killing GCH everywhere by a cofinalitypreserving forcing notion over a model of GCH by
Sy D Friedman(
)
1 edition published in 2013 in English and held by 1 WorldCat member library worldwide
1 edition published in 2013 in English and held by 1 WorldCat member library worldwide
Fusion and large cardinal preservation by
Sy D Friedman(
)
1 edition published in 2013 in English and held by 1 WorldCat member library worldwide
In this paper we introduce some fusion properties of forcing notions which guarantee that an iteration with supports of size $\le \kappa$ not only does not collapse $\kappa^+$ but also preserves the strength of $\kappa$ (after a suitable preparatory forcing). This provides a general theory covering the known cases of tree iterations which preserve large cardinals
1 edition published in 2013 in English and held by 1 WorldCat member library worldwide
In this paper we introduce some fusion properties of forcing notions which guarantee that an iteration with supports of size $\le \kappa$ not only does not collapse $\kappa^+$ but also preserves the strength of $\kappa$ (after a suitable preparatory forcing). This provides a general theory covering the known cases of tree iterations which preserve large cardinals
Negative universality results for graphs by
Sy D Friedman(
)
1 edition published in 2010 in English and held by 1 WorldCat member library worldwide
1 edition published in 2010 in English and held by 1 WorldCat member library worldwide
The consistency strength of the tree property at the double successor of a measurable cardinal by
Natasha Dobrinen(
)
1 edition published in 2010 in English and held by 1 WorldCat member library worldwide
1 edition published in 2010 in English and held by 1 WorldCat member library worldwide
COHERENT SYSTEMS OF FINITE SUPPORT ITERATIONS(
)
1 edition published in 2018 in English and held by 1 WorldCat member library worldwide
Abstract: We introduce a forcing technique to construct threedimensional arrays of generic extensions through FS (finite support) iterations of ccc posets, which we refer to as 3Dcoherent systems. We use them to produce models of new constellations in Cichoń's diagram, in particular, a model where the diagram can be separated into 7 different values. Furthermore, we show that this constellation of 7 values is consistent with the existence of a ${\rm{\Delta }}_3^1$ wellorder of the reals
1 edition published in 2018 in English and held by 1 WorldCat member library worldwide
Abstract: We introduce a forcing technique to construct threedimensional arrays of generic extensions through FS (finite support) iterations of ccc posets, which we refer to as 3Dcoherent systems. We use them to produce models of new constellations in Cichoń's diagram, in particular, a model where the diagram can be separated into 7 different values. Furthermore, we show that this constellation of 7 values is consistent with the existence of a ${\rm{\Delta }}_3^1$ wellorder of the reals
Forcing with finite conditions by
Sy D Friedman(
Book
)
1 edition published in 2003 in English and held by 1 WorldCat member library worldwide
1 edition published in 2003 in English and held by 1 WorldCat member library worldwide
<> by
Sy D Friedman(
)
1 edition published in 2015 in English and held by 1 WorldCat member library worldwide
1 edition published in 2015 in English and held by 1 WorldCat member library worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Kulikov, Vadim 1986
 Hyttinen, Tapani
 Antos, Carolin Other Editor
 Ternullo, Claudio Other Editor
 Honzik, Radek Other Author Editor
 Baaz, Matthias Editor
 Krajíček, Jan Editor
 Raghavan, Dilip Other Editor
 Yang, Yue 1964 Other Editor
 American Mathematical Society
Useful Links
Associated Subjects
Covers
Alternative Names
Friedman, S.D.
Friedman, Sy D.
Friedman, Sy D. 1953
Friedman, SyDavid.
Friedman, SyDavid 1953
Sy Friedman American mathematician
Sy Friedman Amerikaans wiskundige
Sy Friedman amerikansk matematikar
Sy Friedman amerikansk matematiker
Sy Friedman matemático estadounidense
Sy Friedman matematico statunitense
Sy Friedman USamerikanischer Mathematiker
Languages