Handbook of computability theory

zbMath0923.03001MaRDI QIDQ1307021

No author found.

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)

Related Items (25)

Bounding minimal degrees by computably enumerable degrees ⋮ Primitive recursive equivalence relations and their primitive recursive complexity ⋮ Computability of analog networks ⋮ An effectively closed set with no join property* ⋮ Numberings, c.e. oracles, and fixed points ⋮ Weighted G-Drazin inverses and a new pre-order on rectangular matrices ⋮ Programming Experimental Procedures for Newtonian Kinematic Machines ⋮ Effectiveness in RPL, with applications to continuous logic ⋮ On Constructive Nilpotent Groups ⋮ Computability and Recursion ⋮ An incomplete set of shortest descriptions ⋮ Modeling multitape Minsky and Turing machines by three-tape Minsky machines ⋮ Definability, Automorphisms, and Dynamic Properties of Computably Enumerable Sets ⋮ Finitely presented expansions of groups, semigroups, and algebras ⋮ A splitting theorem for $n-REA$ degrees ⋮ Hyperfinite type structures ⋮ On Gupta-Belnap Revision Theories of Truth, Kripkean Fixed Points, and The Next Stable Set ⋮ \(\Pi^0_1\)-presentations of algebras ⋮ Introduction to Turing categories ⋮ The polynomial hierarchy of functions and its levels ⋮ Computations via Newtonian and relativistic kinematic systems ⋮ Decidability and \(k\)-regular sequences ⋮ REDUCTION TECHNIQUES FOR PROVING DECIDABILITY IN LOGICS AND THEIR MEET–COMBINATION ⋮ Computational classification of cellular automata ⋮ Lawvere-Tierney topologies for computability theorists

This page was built for publication: Handbook of computability theory