Fundamentals of generalized recursion theory

zbMath0597.03028MaRDI QIDQ1078561

Melvin Fitting

Publication date: 1981

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

zbMATH Keywords

inductive definitionsadmissible ordinalsadmissible sets with urelementsenumeration operatorinductive and hyperelementary relationsMontague recursion theorysearch computabilitySmullyan's elementary formal systems

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Higher-type and set recursion theory (03D65) Abstract and axiomatic computability and recursion theory (03D75)

Related Items (7)

Unnamed Item ⋮ A representation of recursively enumerable sets through Horn formulas in higher recursion theory ⋮ Computability of String Functions Over Algebraic Structures Armin Hemmerling ⋮ Introduction to Turing categories ⋮ Definability of Recursive Predicates in the Induced Subgraph Order ⋮ Computation by `While' programs on topological partial algebras ⋮ Extending the first-order theory of combinators with self-referential truth

This page was built for publication: Fundamentals of generalized recursion theory