top

  Info

  • Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
Cardinal arithmetic / Saharon Shelah
Cardinal arithmetic / Saharon Shelah
Autore Shelah, Saharon
Pubbl/distr/stampa Oxford : Clarendon Press, 1994
Descrizione fisica xxxi, 481 p. ; 24 cm.
Disciplina 511.322
Collana Oxford logic guides ; 29
Soggetto topico Cardinal numbers
ISBN 0198537859
Classificazione AMS 04A10
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNISALENTO-991000732469707536
Shelah, Saharon  
Oxford : Clarendon Press, 1994
Materiale a stampa
Lo trovi qui: Univ. del Salento
Opac: Controlla la disponibilità qui
Classical descriptive set theory / Alexander S. Kechris
Classical descriptive set theory / Alexander S. Kechris
Autore KECHRIS, Alexander S.
Pubbl/distr/stampa New York, : Springer, c1995
Descrizione fisica XVIII, 402 p. : ill. ; 24 cm
Disciplina 511.322
Collana Graduate texts in mathematics
Soggetto topico Teoria degli insiemi
ISBN 0-387-94374-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNISA-990000044890203316
KECHRIS, Alexander S.  
New York, : Springer, c1995
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Classification and orbit equivalence relations / Greg Hjorth
Classification and orbit equivalence relations / Greg Hjorth
Autore Hjorth, Greg
Pubbl/distr/stampa Providence, RI : American Mathematical Society, c2000
Descrizione fisica xvii, 195 p. ; 26 cm
Disciplina 511.322
Collana Mathematical surveys and monographs, 0076-5376 ; 75
Soggetto topico Classification
Equivalence classes (Set theory)
Equivalence relations (Set theory)
ISBN 0821820028
Classificazione AMS 03E15
AMS 22A05
AMS 54H20
QA248.H56
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNISALENTO-991000745229707536
Hjorth, Greg  
Providence, RI : American Mathematical Society, c2000
Materiale a stampa
Lo trovi qui: Univ. del Salento
Opac: Controlla la disponibilità qui
Coding the universe / A. Beller, R. Jensen, P. Welch
Coding the universe / A. Beller, R. Jensen, P. Welch
Autore Beller, A.
Pubbl/distr/stampa Cambridge : Cambridge University Press, c1982
Descrizione fisica 353 p. ; 23 cm
Disciplina 511.322
Altri autori (Persone) Jensen, Ronald Bjorn
Welch, P.
Collana London Mathematical Society lecture note series, 0076-0552 ; 47
Soggetto topico Axiomatic set theory
Set theory
Symbolic logic and mathematical
ISBN 0521280404
Classificazione AMS 03E
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNISALENTO-991000748689707536
Beller, A.  
Cambridge : Cambridge University Press, c1982
Materiale a stampa
Lo trovi qui: Univ. del Salento
Opac: Controlla la disponibilità qui
Combinatorial set theory : partition relations for cardinals / Paul Erdos, Andras Hajnal, Attila Mate, Richard Rado
Combinatorial set theory : partition relations for cardinals / Paul Erdos, Andras Hajnal, Attila Mate, Richard Rado
Autore Hajnal, Andras
Pubbl/distr/stampa Amsterdam : North-Holland, 1984
Descrizione fisica 347 p. ; 23 cm.
Disciplina 511.322
Altri autori (Persone) Mate, Attilaauthor
Rado, Richard
Erdos, Paulauthor
Collana Studies in logic and the foundations of mathematics, ISSN 0049237X ; 106
Soggetto topico Combinatorial set theory
Ordinal and cardinal numbers
ISBN 0444861572
Classificazione AMS 03E
AMS 03E05
AMS 03E10
QA248.C616
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNISALENTO-991000757549707536
Hajnal, Andras  
Amsterdam : North-Holland, 1984
Materiale a stampa
Lo trovi qui: Univ. del Salento
Opac: Controlla la disponibilità qui
Combinatorial Set Theory [[electronic resource] ] : With a Gentle Introduction to Forcing / / by Lorenz J. Halbeisen
Combinatorial Set Theory [[electronic resource] ] : With a Gentle Introduction to Forcing / / by Lorenz J. Halbeisen
Autore Halbeisen Lorenz J
Edizione [2nd ed. 2017.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017
Descrizione fisica 1 online resource (XVI, 594 p. 20 illus.)
Disciplina 511.322
Collana Springer Monographs in Mathematics
Soggetto topico Mathematical logic
Combinatorics
Mathematical Logic and Foundations
ISBN 3-319-60231-4
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto The Setting -- First-Order Logic in a Nutshell -- Axioms of Set Theory -- Overture: Ramsey's Theorem -- Cardinal Relations in ZF Only -- Forms of Choice -- How to Make Two Balls from One -- Models of Set Theory with Atoms -- Thirteen Cardinals and Their Relations -- The Shattering Number Revisited -- Happy Families and Their Relatives -- Coda: A Dual Form of Ramsey’s Theorem -- The Idea of Forcing -- Martin's Axiom -- The Notion of Forcing -- Proving Unprovability -- Models in Which AC Fails -- Combining Forcing Notions -- Models in Which p=c -- Suslin’s Problem -- Properties of Forcing Extensions -- Cohen Forcing Revisited -- Sacks Forcing -- Silver-Like Forcing Notions -- Miller Forcing -- Mathias Forcing -- How Many Ramsey Ultrafilters Exist? -- Combinatorial Properties of Sets of Partitions -- Suite.
Record Nr. UNINA-9910254296403321
Halbeisen Lorenz J  
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Combinatorial set theory / Neil H. Williams
Combinatorial set theory / Neil H. Williams
Autore Williams, Neil H.
Pubbl/distr/stampa Amsterdam : North-Holland ; New York : sole distributors for the U.S.A. and Canada American Elsevier, 1977
Descrizione fisica xi, 208 p. ; 23 cm.
Disciplina 511.322
Collana Studies in logic and the foundations of mathematics, ISSN 0049237X ; 91
Soggetto topico Combinatorial set theory
ISBN 0720407222
Classificazione AMS 03E05
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNISALENTO-991000757589707536
Williams, Neil H.  
Amsterdam : North-Holland ; New York : sole distributors for the U.S.A. and Canada American Elsevier, 1977
Materiale a stampa
Lo trovi qui: Univ. del Salento
Opac: Controlla la disponibilità qui
Combinatorics of finite sets / Ian Anderson
Combinatorics of finite sets / Ian Anderson
Autore ANDERSON, Ian
Pubbl/distr/stampa Oxford : Clarendon Press, copyr. 1987 (stampa 1989)
Descrizione fisica XV, 250 p. : ill. ; 23 cm
Disciplina 511.322
Soggetto non controllato Teoria degli insiemi
ISBN 0-19-853379-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNISA-990000247050203316
ANDERSON, Ian  
Oxford : Clarendon Press, copyr. 1987 (stampa 1989)
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Computational prospects of infinity [[electronic resource] ] . Part I Tutorials / / editors, Chitat Chong ... [et al.]
Computational prospects of infinity [[electronic resource] ] . Part I Tutorials / / editors, Chitat Chong ... [et al.]
Pubbl/distr/stampa Singapore ; ; Hackensack, NJ, : World Scientific, c2008
Descrizione fisica 1 online resource (264 p.)
Disciplina 511.322
Altri autori (Persone) ChongC.-T <1949-> (Chi-Tat)
Collana Lecture notes series / Institute for Mathematical Sciences, National University of Singapore
Soggetto topico Recursion theory
Set theory
Infinite
Soggetto genere / forma Electronic books.
ISBN 1-281-93434-8
9786611934347
981-279-405-0
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto CONTENTS; Foreword; Preface; Recursion Theory Tutorials; Five Lectures on Algorithmic Randomness Rod Downey; 1. Introduction; 2. Lecture 1: Kolmogorov complexity basics; 2.1. Plain complexity; 2.2. Symmetry of Information; 2.3. Pre.x-free complexity; 2.4. The Coding Theorem; 2.5. Pre.x-free symmetry of information; 2.6. Pre.x-free randomness; 2.7. The overgraph functions; 3. Lecture 2: Randomness for reals; 3.1. Martin-L ̈of randomness; 3.2. Schnorr's Theorem and the computational paradigm; 3.3. Martingales and the prediction paradigm; 3.4. Super martingales and continuous semimeasures
3.5. Schnorr and computable randomness 4. Lecture 3: Randomness in general; 4.1. The de Leeuw, Moore, Shannon, Shapiro Theorem, and Sacks' Theorem; 4.2. Coding into randoms; 4.3. Kucera Coding; 4.4. n-randomness; 4.5. Notes on 2-randoms; 4.6. Kucera strikes again; 4.7. van Lambalgen's Theorem; 4.8. Effective 0-1 Laws; 4.9. Omega operators; 5. Lecture 4: Calibrating randomness; 5.1. Measures of relative randomness and the Kucera-Slaman Theorem; 5.2. The Density Theorem; 5.3. Other measures of relative randomness; 5.4. 5.7. Hausdor. Dimension 6. Lecture 5: Measure-theoretical injury arguments; 6.1. Risking measure; 6.2. 2-random degrees are hyperimmune; 6.3. Almost every degree is CEA; References; Global Properties of the Turing Degrees and the Turing Jump Theodore A. Slaman; 1. Introduction; 1.1. Style; 2. The coding lemma and the rst order theory of the Turing degrees; 2.1. The coding lemma; 3. Properties of automorphisms of D; 3.1. Results of Nerode and Shore; 4. Slaman and Woodin analysis of Aut(D); 4.1. Persistent automorphisms; 4.2. Persistently extending persistent automorphisms
4.3. Persistence and reection 4.4. Generic persistence; 4.5. Denability of automorphisms of D; 4.6. Invariance of the double jump; 5. Denability in D; 5.1. Bi-interpretability; 6. The Turing jump; 6.1. Recursive enumerability; References; Set Theory Tutorials; Derived Models Associated to Mice John R. Steel; 1. Introduction; 2. Some background and preliminaries; 2.1. Homogeneously Suslin sets; 2.2. Hom1 iteration strategies; 2.3. The derived model; 2.4. Iterations to make RV = R; 2.5. Premice over a set; 3. Iteration independence for derived models of mice
4. Mouse operators and jump operators 5. The mouse set conjecture in D(M; ); 6. The Solovay sequence in D(M; ); 7. The -transform; 8. A long Solovay sequence; 9. The mouse set conjectures: Framework of the induction; 10. The background universe N; 11. The L[E]-model Nx; 12. Two hybrid mouse operators at 0; 13. New mice modulo (y); 15. The consistency strength of AD+ + 0 <; 16. Global MSC implies the local MSC; 17. MSC implies capturing via R-mice; References; Tutorial Outline: Suitable Extender Sequences W. Hugh Woodin; 1. Introduction; 2. Generalized iteration trees
2.1. Long extenders
Record Nr. UNINA-9910452972103321
Singapore ; ; Hackensack, NJ, : World Scientific, c2008
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Computational prospects of infinity [[electronic resource] ] . Part I Tutorials / / editors, Chitat Chong ... [et al.]
Computational prospects of infinity [[electronic resource] ] . Part I Tutorials / / editors, Chitat Chong ... [et al.]
Pubbl/distr/stampa Singapore ; ; Hackensack, NJ, : World Scientific, c2008
Descrizione fisica 1 online resource (264 p.)
Disciplina 511.322
Altri autori (Persone) ChongC.-T <1949-> (Chi-Tat)
Collana Lecture notes series / Institute for Mathematical Sciences, National University of Singapore
Soggetto topico Recursion theory
Set theory
Infinite
ISBN 1-281-93434-8
9786611934347
981-279-405-0
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto CONTENTS; Foreword; Preface; Recursion Theory Tutorials; Five Lectures on Algorithmic Randomness Rod Downey; 1. Introduction; 2. Lecture 1: Kolmogorov complexity basics; 2.1. Plain complexity; 2.2. Symmetry of Information; 2.3. Pre.x-free complexity; 2.4. The Coding Theorem; 2.5. Pre.x-free symmetry of information; 2.6. Pre.x-free randomness; 2.7. The overgraph functions; 3. Lecture 2: Randomness for reals; 3.1. Martin-L ̈of randomness; 3.2. Schnorr's Theorem and the computational paradigm; 3.3. Martingales and the prediction paradigm; 3.4. Super martingales and continuous semimeasures
3.5. Schnorr and computable randomness 4. Lecture 3: Randomness in general; 4.1. The de Leeuw, Moore, Shannon, Shapiro Theorem, and Sacks' Theorem; 4.2. Coding into randoms; 4.3. Kucera Coding; 4.4. n-randomness; 4.5. Notes on 2-randoms; 4.6. Kucera strikes again; 4.7. van Lambalgen's Theorem; 4.8. Effective 0-1 Laws; 4.9. Omega operators; 5. Lecture 4: Calibrating randomness; 5.1. Measures of relative randomness and the Kucera-Slaman Theorem; 5.2. The Density Theorem; 5.3. Other measures of relative randomness; 5.4. 5.7. Hausdor. Dimension 6. Lecture 5: Measure-theoretical injury arguments; 6.1. Risking measure; 6.2. 2-random degrees are hyperimmune; 6.3. Almost every degree is CEA; References; Global Properties of the Turing Degrees and the Turing Jump Theodore A. Slaman; 1. Introduction; 1.1. Style; 2. The coding lemma and the rst order theory of the Turing degrees; 2.1. The coding lemma; 3. Properties of automorphisms of D; 3.1. Results of Nerode and Shore; 4. Slaman and Woodin analysis of Aut(D); 4.1. Persistent automorphisms; 4.2. Persistently extending persistent automorphisms
4.3. Persistence and reection 4.4. Generic persistence; 4.5. Denability of automorphisms of D; 4.6. Invariance of the double jump; 5. Denability in D; 5.1. Bi-interpretability; 6. The Turing jump; 6.1. Recursive enumerability; References; Set Theory Tutorials; Derived Models Associated to Mice John R. Steel; 1. Introduction; 2. Some background and preliminaries; 2.1. Homogeneously Suslin sets; 2.2. Hom1 iteration strategies; 2.3. The derived model; 2.4. Iterations to make RV = R; 2.5. Premice over a set; 3. Iteration independence for derived models of mice
4. Mouse operators and jump operators 5. The mouse set conjecture in D(M; ); 6. The Solovay sequence in D(M; ); 7. The -transform; 8. A long Solovay sequence; 9. The mouse set conjectures: Framework of the induction; 10. The background universe N; 11. The L[E]-model Nx; 12. Two hybrid mouse operators at 0; 13. New mice modulo (y); 15. The consistency strength of AD+ + 0 <; 16. Global MSC implies the local MSC; 17. MSC implies capturing via R-mice; References; Tutorial Outline: Suitable Extender Sequences W. Hugh Woodin; 1. Introduction; 2. Generalized iteration trees
2.1. Long extenders
Record Nr. UNINA-9910782357403321
Singapore ; ; Hackensack, NJ, : World Scientific, c2008
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui

Data di pubblicazione

Altro...