scientific article; zbMATH DE number 1302869

MaRDI QIDQ4249355zbMATH OpenFDO

Authors Yuri L. Ershov, S. S. Goncharov, Jeffrey Remmel, Anil Nerode

Publication date 15 February 2000

zbMATH Keywords

future researchhistorical roots of recursive mathematicsmajor themes

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) History of mathematical logic and foundations (03-03) Computable structure theory, computable model theory (03C57)

Recommendations

• scientific article; zbMATH DE number 4027419
• Handbook of recursive mathematics. Vol. 2: Recursive algebra, analysis and combinatorics
• scientific article; zbMATH DE number 1302880
• Handbook of recursive mathematics. Vol. 1: Recursive model theory

Cited in

(33)

• A meaning based information theory - informalogical space: basic concepts and convergence of information sequences
• Limitwise monotonic functions, sets, and degrees on computable domains
• scientific article; zbMATH DE number 4027419 (Why is no real title available?)
• Recursive terms in semantic programming
• My work with Victor Marek: a mathematician looks at answer set programming
• Classification from a Computable Viewpoint
• The complexity of finding SUBSEQ(A)
• Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis
• 1998 European Summer Meeting of the Association for Symbolic Logic
• Conditional terms in semantic programming
• 2005–06 Winter Meeting of the Association for Symbolic Logic
• Handbook of recursive mathematics. Vol. 1: Recursive model theory
• Effective completeness theorems for modal logic
• Where automatic structures benefit from weighted automata
• Computable trees of Scott rank ω₁^CK, and computable approximation
• 2003 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquim '03
• Generalizing Computability Theory to Abstract Algebras
• On the Equimorphism Types of Linear Orderings
• Graphs are not universal for online computability
• Degree spectra of intrinsically c. e. relations
• Computability-theoretic and proof-theoretic aspects of partial and linear orderings
• Computability and uncountable linear orders. I: Computable categoricity.
• Effectiveness in RPL, with applications to continuous logic
• Lifting proofs from countable to uncountable mathematics
• Effective metric model theory
• Finitely presented expansions of computably enumerable semigroups
• A computably categorical structure whose expansion by a constant has infinite computable dimension
• Computably categorical structures and expansions by constants
• Up to equimorphism, hyperarithmetic is recursive
• On constructive number fields and computability of solutions of PDEs
• Spectra of structures and relations
• Introduction
• On analogues of the Church-Turing thesis in algorithmic randomness

This page was built for publication:

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