Publication:4249355

zbMath0930.03037MaRDI QIDQ4249355

Anil Nerode, Yuri L. Ershov, Sergei S. Goncharov, Jeffery B. Remmel

Publication date: 15 February 2000

zbMATH Keywords

future research; historical roots of recursive mathematics; major themes

Mathematics Subject Classification ID

03-02: Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations

03-03: History of mathematical logic and foundations

03C57: Computable structure theory, computable model theory

Related Items

Generalizing Computability Theory to Abstract Algebras, A computably categorical structure whose expansion by a constant has infinite computable dimension, 2003 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquim '03, Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis, Limitwise monotonic functions, sets, and degrees on computable domains, COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS I: COMPUTABLE CATEGORICITY, Computable trees of Scott rank ω₁^CK, and computable approximation, 2005–06 Winter Meeting of the Association for Symbolic Logic, Up to equimorphism, hyperarithmetic is recursive, ON ANALOGUES OF THE CHURCH–TURING THESIS IN ALGORITHMIC RANDOMNESS, Effective metric model theory, Effectiveness in RPL, with applications to continuous logic, The complexity of finding SUBSEQ\((A)\), My work with Victor Marek: a mathematician looks at answer set programming, Computability-theoretic and proof-theoretic aspects of partial and linear orderings, Conditional terms in semantic programming, On constructive number fields and computability of solutions of PDEs, Recursive terms in semantic programming, Effective completeness theorems for modal logic, Finitely presented expansions of computably enumerable semigroups, Graphs are not universal for online computability, A meaning based information theory - informalogical space: basic concepts and convergence of information sequences, Lifting proofs from countable to uncountable mathematics, Degree spectra of intrinsically c.e. relations, Where Automatic Structures Benefit from Weighted Automata, Spectra of structures and relations, Classification from a Computable Viewpoint, On the Equimorphism Types of Linear Orderings, Computably categorical structures and expansions by constants, 1998 European Summer Meeting of the Association for Symbolic Logic