scientific article; zbMATH DE number 1302869

zbMATH Open0930.03037MaRDI QIDQ4249355FDOQ4249355

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

Publication date: 15 February 2000

Title of this publication is not available (Why is that?)

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

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)

Cited In (32)

• Limitwise monotonic functions, sets, and degrees on computable domains
• Title not available (Why is that?)
• Recursive terms in semantic programming
• Classification from a Computable Viewpoint
• Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis
• My work with Victor Marek: a mathematician looks at answer set programming
• The complexity of finding SUBSEQ\((A)\)
• 1998 European Summer Meeting of the Association for Symbolic Logic
• 2005–06 Winter Meeting of the Association for Symbolic Logic
• Conditional terms in semantic programming
• COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS I: COMPUTABLE CATEGORICITY
• Handbook of recursive mathematics. Vol. 1: Recursive model theory
• Effective completeness theorems for modal logic
• 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
• Where Automatic Structures Benefit from Weighted Automata
• Effective metric model theory
• Lifting proofs from countable to uncountable mathematics
• ON ANALOGUES OF THE CHURCH–TURING THESIS IN ALGORITHMIC RANDOMNESS
• Effectiveness in RPL, with applications to continuous logic
• 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
• A meaning based information theory - informalogical space: basic concepts and convergence of information sequences

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)