scientific article; zbMATH DE number 1302869
From MaRDI portal
Publication:4249355
zbMath0930.03037MaRDI QIDQ4249355
Anil Nerode, Yuri L. Ershov, Sergei S. Goncharov, Jeffery B. Remmel
Publication date: 15 February 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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)
Related Items
Effective completeness theorems for modal logic, Computably categorical structures and expansions by constants, 1998 European Summer Meeting of the Association for Symbolic Logic, The complexity of finding SUBSEQ\((A)\), Lifting proofs from countable to uncountable mathematics, Graphs are not universal for online computability, Finitely presented expansions of computably enumerable semigroups, Conditional terms in semantic programming, Effectiveness in RPL, with applications to continuous logic, On constructive number fields and computability of solutions of PDEs, 2005–06 Winter Meeting of the Association for Symbolic Logic, Computability-theoretic and proof-theoretic aspects of partial and linear orderings, Recursive terms in semantic programming, Generalizing Computability Theory to Abstract Algebras, Up to equimorphism, hyperarithmetic is recursive, Degree spectra of intrinsically c.e. relations, A computably categorical structure whose expansion by a constant has infinite computable dimension, Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis, ON ANALOGUES OF THE CHURCH–TURING THESIS IN ALGORITHMIC RANDOMNESS, Effective metric model theory, A meaning based information theory - informalogical space: basic concepts and convergence of information sequences, On the Equimorphism Types of Linear Orderings, 2003 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquim '03, Limitwise monotonic functions, sets, and degrees on computable domains, Computable trees of Scott rank ω1CK, and computable approximation, Where Automatic Structures Benefit from Weighted Automata, My work with Victor Marek: a mathematician looks at answer set programming, COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS I: COMPUTABLE CATEGORICITY, Spectra of structures and relations, Classification from a Computable Viewpoint
