Abstract Computability and Invariant Definability

DOI10.2307/2270854zbMath0218.02039OpenAlexW2070746010MaRDI QIDQ5622176

Yiannis N. Moschovakis

Publication date: 1969

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2270854

Mathematics Subject Classification ID

Abstract and axiomatic computability and recursion theory (03D75)

Related Items (7)

Unnamed Item ⋮ Enumeration Reducibility and Computable Structure Theory ⋮ Inductive Definitions and Computability ⋮ The Game Quantifier ⋮ Inductive definability in formal language theory ⋮ Computability by means of effectively definable schemes and definability via enumerations ⋮ Some applications of computable one-one numberings

Cites Work

• Hierarchies of number-theoretic predicates
• On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper)

This page was built for publication: Abstract Computability and Invariant Definability