Handbook of computability theory

MaRDI QIDQ1307021zbMATH OpenFDO

Authors

Publication date 21 October 1999

Published in Studies in Logic and the Foundations of Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Collections of articles of miscellaneous specific interest (00B15) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to mathematical logic and foundations (03-00)

Recommendations

• Handbook of computability and complexity in analysis
• Logical Approaches to Computational Barriers
• scientific article; zbMATH DE number 3987247
• Effective hierarchy of real numbers.
• scientific article; zbMATH DE number 1460545

Cited in

(33)

• Computations via Newtonian and relativistic kinematic systems
• Handbook of recursive mathematics. Vol. 2: Recursive algebra, analysis and combinatorics
• Classical recursion theory. Vol. II
• The polynomial hierarchy of functions and its levels
• Decidability and \(k\)-regular sequences
• Modeling multitape Minsky and Turing machines by three-tape Minsky machines
• Weighted G-Drazin inverses and a new pre-order on rectangular matrices
• ^0_1-presentations of algebras
• A splitting theorem for n-REA degrees
• On Gupta-Belnap revision theories of truth, Kripkean fixed points and the next stable set
• Computational classification of cellular automata
• General computability theory (a database of articles and books)
• On Constructive Nilpotent Groups
• Computability and models. Perspectives east and west
• Programming Experimental Procedures for Newtonian Kinematic Machines
• Bounding minimal degrees by computably enumerable degrees
• Definability, Automorphisms, and Dynamic Properties of Computably Enumerable Sets
• Hyperfinite type structures
• Handbook of computability and complexity in analysis
• REDUCTION TECHNIQUES FOR PROVING DECIDABILITY IN LOGICS AND THEIR MEET–COMBINATION
• Computability. Randomness, reverse mathematics and hypercomputability
• Primitive recursive equivalence relations and their primitive recursive complexity
• An incomplete set of shortest descriptions
• Finitely presented expansions of groups, semigroups, and algebras
• scientific article; zbMATH DE number 5493266 (Why is no real title available?)
• Computability and Recursion
• Lawvere-Tierney topologies for computability theorists
• An effectively closed set with no join property*
• Numberings, c.e. oracles, and fixed points
• Effectiveness in RPL, with applications to continuous logic
• On arithmetical numberings in reverse mathematics
• Computability of analog networks
• Introduction to Turing categories

This page was built for publication: Handbook of computability theory

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