Special issue on computability theory

DOI10.1016/S0168-0072(98)80001-8MaRDI QIDQ1303756zbMATH OpenFDO

Authors

Publication date 20 September 1999

Published in Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0168-0072(98)80001-8

zbMATH Keywords

Computability theorySpecial issue

Mathematics Subject Classification ID

Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06) Computability and recursion theory (03Dxx)

Recommendations

• Computability theory and foundations of mathematics. Proceedings of the 9th international conference, Wuhan, China, March 21--27, 2019
• Editorial: Special issue on computability, complexity and randomness
• Selected papers of the 3rd international conference on computability and complexity in analysis, CCA 2006, Gainesville, FL, USA, November 1--5, 2006
• Preface of the special issue for the Oberwolfach Workshop on Computability Theory 2018
• scientific article; zbMATH DE number 1318735

Cited in

(4)

• Special issue: Complexity theory, real machines and homotopy. One of the 14 FoCM workshops on the 3rd conference on Foundations of computational mathematics. Oxford Univ., Oxford, GB, July 19--21, 1999
• Selected papers of the 3rd international conference on computability and complexity in analysis, CCA 2006, Gainesville, FL, USA, November 1--5, 2006
• Ordinal definability and recursion theory. The Cabal Seminar, Vol. III. Reprints of papers and new material based on the Los Angeles Caltech-UCLA Logic Cabal Seminar 1976--1985
• Preface of the special issue for the Oberwolfach Workshop on Computability Theory 2018

This page was built for publication: Special issue on computability theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1303756)