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.

Biblioteca

MARC Lista (tabellare)
Abstraction and infinity / / Paolo Mancosu
Abstraction and infinity / / Paolo Mancosu
Autore Mancosu Paolo
Edizione [First edition.]
Pubbl/distr/stampa Oxford : , : Oxford University Press, , 2017
Descrizione fisica 1 online resource
Disciplina 510.1
Soggetto topico Abstraction
Infinite
ISBN 0-19-180909-8
0-19-106380-0
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNINA-9910155495903321
Mancosu Paolo  
Oxford : , : Oxford University Press, , 2017
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Ad Infinitum : new essays on epistemological infinitism
Ad Infinitum : new essays on epistemological infinitism
Autore Turri
Pubbl/distr/stampa Oxford : , : Oxford University Press, , 2014
Descrizione fisica 1 online resource
Disciplina 121
Soggetto topico Knowledge, Theory of
Infinite
Philosophy
Philosophy & Religion
Speculative Philosophy
ISBN 0-19-177937-7
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNINA-9910157843103321
Turri  
Oxford : , : Oxford University Press, , 2014
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
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
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-9910813457003321
Singapore ; ; Hackensack, NJ, : World Scientific, c2008
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Dall’infinito poetico all’infinito matematico : attraverso il filosofico / Giuseppe Zappalà
Dall’infinito poetico all’infinito matematico : attraverso il filosofico / Giuseppe Zappalà
Autore Zappalà, Giuseppe
Pubbl/distr/stampa Roma : Aracne, 2016
Descrizione fisica 80 p. : ill. ; 24 cm
Disciplina 510.1
Soggetto topico Science - Philosophy
Infinite
ISBN 9788854894457
Classificazione LC QA9
AMS 00A30
AMS 03A05
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione ita
Record Nr. UNISALENTO-991003317519707536
Zappalà, Giuseppe  
Roma : Aracne, 2016
Materiale a stampa
Lo trovi qui: Univ. del Salento
Opac: Controlla la disponibilità qui
The end of infinity : where mathematics and philosophy meet / / Anthony C. Patton
The end of infinity : where mathematics and philosophy meet / / Anthony C. Patton
Autore Patton Anthony C. <1969->
Pubbl/distr/stampa New York : , : Algora Publishing, , [2018]
Descrizione fisica 1 online resource (200 pages)
Disciplina 111/.6
Soggetto topico Infinite
Soggetto genere / forma Electronic books.
ISBN 1-62894-341-6
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNINA-9910466995003321
Patton Anthony C. <1969->  
New York : , : Algora Publishing, , [2018]
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
The end of infinity : where mathematics and philosophy meet / / Anthony C. Patton
The end of infinity : where mathematics and philosophy meet / / Anthony C. Patton
Autore Patton Anthony C. <1969->
Pubbl/distr/stampa New York : , : Algora Publishing, , [2018]
Descrizione fisica 1 online resource (200 pages)
Disciplina 111/.6
Soggetto topico Infinite
ISBN 1-62894-341-6
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNINA-9910796956403321
Patton Anthony C. <1969->  
New York : , : Algora Publishing, , [2018]
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
The end of infinity : where mathematics and philosophy meet / / Anthony C. Patton
The end of infinity : where mathematics and philosophy meet / / Anthony C. Patton
Autore Patton Anthony C. <1969->
Pubbl/distr/stampa New York : , : Algora Publishing, , [2018]
Descrizione fisica 1 online resource (200 pages)
Disciplina 111/.6
Soggetto topico Infinite
ISBN 1-62894-341-6
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNINA-9910819606903321
Patton Anthony C. <1969->  
New York : , : Algora Publishing, , [2018]
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Feeding on infinity [[electronic resource] ] : readings in the romantic rhetoric of internalization / / Joshua Wilner
Feeding on infinity [[electronic resource] ] : readings in the romantic rhetoric of internalization / / Joshua Wilner
Autore Wilner Joshua
Pubbl/distr/stampa Baltimore, : John Hopkins University Press, 2000
Descrizione fisica 1 online resource (173 p.)
Disciplina 809/.9145/019
Soggetto topico European literature - Male authors - History and criticism
Psychoanalysis and literature - Europe
Male authors - Psychology
Romanticism - Europe
Internalization
Infinite
Soggetto genere / forma Electronic books.
ISBN 0-8018-7716-4
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNINA-9910454573403321
Wilner Joshua  
Baltimore, : John Hopkins University Press, 2000
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui