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.
Computability theory and its applications : current trends and open problems : proceedings of a 1999 AMS-IMS-SIAM joint summer research conference, computability theory and applications, June 13-17, 1999, University of Colorado, Boulder / / Peter A. Cholak [and three others], editors
Computability theory and its applications : current trends and open problems : proceedings of a 1999 AMS-IMS-SIAM joint summer research conference, computability theory and applications, June 13-17, 1999, University of Colorado, Boulder / / Peter A. Cholak [and three others], editors
Pubbl/distr/stampa Providence, Rhode Island : , : American Mathematical Society, , [2000]
Descrizione fisica 1 online resource (338 p.)
Disciplina 511.3
Collana Contemporary mathematics
Soggetto topico Computable functions
ISBN 0-8218-7847-6
0-8218-1922-4
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto ""2. The Reverse Mathematics Enterprise""""3. The Interpretability Conjecture""; ""4. The Coding Issue""; ""5. Real Analysis and Topology""; ""6. Banach Space Theory""; ""7. Ramsey Theory""; ""8. WQO Theory""; ""9. Countable Abelian Group Theory""; ""10. Replacing RCA0 by a Weaker Base Theory""; ""References""; ""Open problems in the theory of constructive algebraic systems""; ""Independence results from ZFC in computability theory: Some open problems""; ""Problems related to arithmetic""; ""Embeddings into the computably enumerable degrees""
""Definability in the c.e. degrees: Questions and results""""Strong reducibilities, again""; ""Finitely axiomatizable theories and Lindenbaum algebras of semantic classes""; ""Towards an analog of Hilbert's tenth problem for a number field""; ""Natural definability in degree structures""; ""Recursion theory in set theory""; ""Extensions, automorphisms, and definability""; ""Open problems in the enumeration degrees""
Record Nr. UNINA-9910788654203321
Providence, Rhode Island : , : American Mathematical Society, , [2000]
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Computability theory and its applications : current trends and open problems : proceedings of a 1999 AMS-IMS-SIAM joint summer research conference, computability theory and applications, June 13-17, 1999, University of Colorado, Boulder / / Peter A. Cholak [and three others], editors
Computability theory and its applications : current trends and open problems : proceedings of a 1999 AMS-IMS-SIAM joint summer research conference, computability theory and applications, June 13-17, 1999, University of Colorado, Boulder / / Peter A. Cholak [and three others], editors
Pubbl/distr/stampa Providence, Rhode Island : , : American Mathematical Society, , [2000]
Descrizione fisica 1 online resource (338 p.)
Disciplina 511.3
Collana Contemporary mathematics
Soggetto topico Computable functions
ISBN 0-8218-7847-6
0-8218-1922-4
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto ""2. The Reverse Mathematics Enterprise""""3. The Interpretability Conjecture""; ""4. The Coding Issue""; ""5. Real Analysis and Topology""; ""6. Banach Space Theory""; ""7. Ramsey Theory""; ""8. WQO Theory""; ""9. Countable Abelian Group Theory""; ""10. Replacing RCA0 by a Weaker Base Theory""; ""References""; ""Open problems in the theory of constructive algebraic systems""; ""Independence results from ZFC in computability theory: Some open problems""; ""Problems related to arithmetic""; ""Embeddings into the computably enumerable degrees""
""Definability in the c.e. degrees: Questions and results""""Strong reducibilities, again""; ""Finitely axiomatizable theories and Lindenbaum algebras of semantic classes""; ""Towards an analog of Hilbert's tenth problem for a number field""; ""Natural definability in degree structures""; ""Recursion theory in set theory""; ""Extensions, automorphisms, and definability""; ""Open problems in the enumeration degrees""
Record Nr. UNINA-9910828839203321
Providence, Rhode Island : , : American Mathematical Society, , [2000]
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Computability, complexity, logic / E. Börger
Computability, complexity, logic / E. Börger
Autore Borger, Egon
Pubbl/distr/stampa Amsterdam : North-Holland, 1989
Descrizione fisica xx, 592 p. ; 23 cm.
Collana Studies in logic and the foundations of mathematics, ISSN 0049237X ; 128
Soggetto topico Computable functions
Computational complexity
Mathematical logic
Symbolic logic
ISBN 0444874062
Classificazione AMS 03D
AMS 03D05
AMS 03D15
AMS 68Q
QA9.59.B6713
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNISALENTO-991000773079707536
Borger, Egon  
Amsterdam : North-Holland, 1989
Materiale a stampa
Lo trovi qui: Univ. del Salento
Opac: Controlla la disponibilità qui
Computable structures and the hyperarithmetical hierarchy [e-book] / C. J. Ash, J. Knight
Computable structures and the hyperarithmetical hierarchy [e-book] / C. J. Ash, J. Knight
Autore Ash, C. J.
Pubbl/distr/stampa Amsterdam ; New York : Elsevier, 2000
Descrizione fisica xv, 346 p. ; 24 cm
Disciplina 511.3
Altri autori (Persone) Knight, Julia
Collana Studies in logic and the foundations of mathematics ; 144
Soggetto topico Computable functions
ISBN 9780444500724
0444500723
Formato Risorse elettroniche
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNISALENTO-991003272759707536
Ash, C. J.  
Amsterdam ; New York : Elsevier, 2000
Risorse elettroniche
Lo trovi qui: Univ. del Salento
Opac: Controlla la disponibilità qui
Effective mathematics of the uncountable / / edited by Noam Greenberg, Victoria University of Wellington, Joel David Hamkins, City University of New York, Denis Hirschfeldt, University of Chicago, Russell Miller, City University of New York [[electronic resource]]
Effective mathematics of the uncountable / / edited by Noam Greenberg, Victoria University of Wellington, Joel David Hamkins, City University of New York, Denis Hirschfeldt, University of Chicago, Russell Miller, City University of New York [[electronic resource]]
Pubbl/distr/stampa Cambridge : , : Cambridge University Press, , 2013
Descrizione fisica 1 online resource (viii, 197 pages) : digital, PDF file(s)
Disciplina 511.3/4
Collana Lecture notes in logic
Soggetto topico Model theory
Computable functions
ISBN 1-139-89203-7
1-107-50349-3
1-139-02859-6
1-107-51647-1
1-107-01451-4
1-107-51376-6
1-107-49634-9
1-107-50615-8
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Some results on R-computable structures / Wesley Calvert and John E. Porter -- Infinite time Turing machines and an application to the hierarchy of equivalence relations on the reals / Samuel Coskey and Joel David Hamkins -- Computable structure theory using admissible recursion theory on [omega]1 using admissibility / Noam Greenberg and Julia F. Knight -- Local computability and uncountable structures / Russell Miller -- Borel structures : a brief survey / Antonio Montalbán and André Nies -- E-recursive intuitions / Gerald E. Sacks -- Reverse mathematics, countable and uncountable : a computational approach -- Effective model theory : an approach via [Sigma]-definability.
Record Nr. UNINA-9910464679303321
Cambridge : , : Cambridge University Press, , 2013
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Effective mathematics of the uncountable / / edited by Noam Greenberg, Victoria University of Wellington, Joel David Hamkins, City University of New York, Denis Hirschfeldt, University of Chicago, Russell Miller, City University of New York [[electronic resource]]
Effective mathematics of the uncountable / / edited by Noam Greenberg, Victoria University of Wellington, Joel David Hamkins, City University of New York, Denis Hirschfeldt, University of Chicago, Russell Miller, City University of New York [[electronic resource]]
Pubbl/distr/stampa Cambridge : , : Cambridge University Press, , 2013
Descrizione fisica 1 online resource (viii, 197 pages) : digital, PDF file(s)
Disciplina 511.3/4
Collana Lecture notes in logic
Soggetto topico Model theory
Computable functions
ISBN 1-139-89203-7
1-107-50349-3
1-139-02859-6
1-107-51647-1
1-107-01451-4
1-107-51376-6
1-107-49634-9
1-107-50615-8
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Some results on R-computable structures / Wesley Calvert and John E. Porter -- Infinite time Turing machines and an application to the hierarchy of equivalence relations on the reals / Samuel Coskey and Joel David Hamkins -- Computable structure theory using admissible recursion theory on [omega]1 using admissibility / Noam Greenberg and Julia F. Knight -- Local computability and uncountable structures / Russell Miller -- Borel structures : a brief survey / Antonio Montalbán and André Nies -- E-recursive intuitions / Gerald E. Sacks -- Reverse mathematics, countable and uncountable : a computational approach -- Effective model theory : an approach via [Sigma]-definability.
Record Nr. UNINA-9910789311403321
Cambridge : , : Cambridge University Press, , 2013
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Effective mathematics of the uncountable / / edited by Noam Greenberg, Victoria University of Wellington, Joel David Hamkins, City University of New York, Denis Hirschfeldt, University of Chicago, Russell Miller, City University of New York [[electronic resource]]
Effective mathematics of the uncountable / / edited by Noam Greenberg, Victoria University of Wellington, Joel David Hamkins, City University of New York, Denis Hirschfeldt, University of Chicago, Russell Miller, City University of New York [[electronic resource]]
Pubbl/distr/stampa Cambridge : , : Cambridge University Press, , 2013
Descrizione fisica 1 online resource (viii, 197 pages) : digital, PDF file(s)
Disciplina 511.3/4
Collana Lecture notes in logic
Soggetto topico Model theory
Computable functions
ISBN 1-139-89203-7
1-107-50349-3
1-139-02859-6
1-107-51647-1
1-107-01451-4
1-107-51376-6
1-107-49634-9
1-107-50615-8
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Some results on R-computable structures / Wesley Calvert and John E. Porter -- Infinite time Turing machines and an application to the hierarchy of equivalence relations on the reals / Samuel Coskey and Joel David Hamkins -- Computable structure theory using admissible recursion theory on [omega]1 using admissibility / Noam Greenberg and Julia F. Knight -- Local computability and uncountable structures / Russell Miller -- Borel structures : a brief survey / Antonio Montalbán and André Nies -- E-recursive intuitions / Gerald E. Sacks -- Reverse mathematics, countable and uncountable : a computational approach -- Effective model theory : an approach via [Sigma]-definability.
Record Nr. UNINA-9910824613803321
Cambridge : , : Cambridge University Press, , 2013
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
The foundations of computability theory / / Borut Robic
The foundations of computability theory / / Borut Robic
Autore Robič Borut <1960->
Edizione [2nd ed. 2020.]
Pubbl/distr/stampa Berlin, Germany : , : Springer, , [2020]
Descrizione fisica 1 online resource (XXI, 422 p.)
Disciplina 511.3
Soggetto topico Computable functions
ISBN 3-662-62421-4
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Part I, The Roots of Computability Theory -- Introduction -- The Foundational Crisis of Mathematics -- Formalism -- Hilbert’s Attempt at Recovery -- Part II, Classicial Computability Theory -- The Quest for a Formalization -- The Turing Machine -- The First Basic Results -- Incomputable Problems -- Methods of Proving Incomputability -- Part III, Relative Computability -- Computation with External Help -- Degrees of Unsolvability -- The Turing Hierarchy of Unsolvability -- The Class D of Degrees of Unsolvability -- C.E. Degrees and the Priority Method -- The Arithmetical Hierarchy -- Part IV, Back to the Roots -- Computability (Church-Turing) Thesis Revisited -- Further Reading -- App. A, Mathematical Background -- App. B, Notation Index -- Glossary -- References -- Index.
Record Nr. UNINA-9910427697703321
RobicÌŒ Borut <1960->  
Berlin, Germany : , : Springer, , [2020]
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
The foundations of computability theory / / Borut Robic
The foundations of computability theory / / Borut Robic
Autore Robič Borut <1960->
Edizione [2nd ed. 2020.]
Pubbl/distr/stampa Berlin, Germany : , : Springer, , [2020]
Descrizione fisica 1 online resource (XXI, 422 p.)
Disciplina 511.3
Soggetto topico Computable functions
ISBN 3-662-62421-4
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Part I, The Roots of Computability Theory -- Introduction -- The Foundational Crisis of Mathematics -- Formalism -- Hilbert’s Attempt at Recovery -- Part II, Classicial Computability Theory -- The Quest for a Formalization -- The Turing Machine -- The First Basic Results -- Incomputable Problems -- Methods of Proving Incomputability -- Part III, Relative Computability -- Computation with External Help -- Degrees of Unsolvability -- The Turing Hierarchy of Unsolvability -- The Class D of Degrees of Unsolvability -- C.E. Degrees and the Priority Method -- The Arithmetical Hierarchy -- Part IV, Back to the Roots -- Computability (Church-Turing) Thesis Revisited -- Further Reading -- App. A, Mathematical Background -- App. B, Notation Index -- Glossary -- References -- Index.
Record Nr. UNISA-996465352603316
RobicÌŒ Borut <1960->  
Berlin, Germany : , : Springer, , [2020]
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Handbook of computability theory [e-book] / edited by Edward R. Griffor
Handbook of computability theory [e-book] / edited by Edward R. Griffor
Pubbl/distr/stampa Amsterdam ; New York : Elsevier, 1999
Descrizione fisica xii, 727 p. : ill. ; 23 cm
Disciplina 511.3
Altri autori (Persone) Griffor, Edward R.
Collana Studies in logic and the foundations of mathematics ; 140
Soggetto topico Computable functions
ISBN 9780444898821
0444898824
Formato Risorse elettroniche
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNISALENTO-991003274889707536
Amsterdam ; New York : Elsevier, 1999
Risorse elettroniche
Lo trovi qui: Univ. del Salento
Opac: Controlla la disponibilità qui