Abstract Computability and Invariant Definability

DOI10.2307/2270854MaRDI QIDQ5622176zbMATH OpenOpenAlexFDO

Authors Yiannis N. Moschovakis

Publication date 1969

Published in 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)

Cites work

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

Cited in

(18)

• Inductive definability in formal language theory
• Computability by means of effectively definable schemes and definability via enumerations
• Definability and invariance
• Enumeration reducibility and computable structure theory
• scientific article; zbMATH DE number 4154430 (Why is no real title available?)
• scientific article; zbMATH DE number 2063217 (Why is no real title available?)
• scientific article; zbMATH DE number 6863850 (Why is no real title available?)
• Generalizing Computability Theory to Abstract Algebras
• scientific article; zbMATH DE number 2151710 (Why is no real title available?)
• Exact effective enumerations of total functional structures
• scientific article; zbMATH DE number 7533333 (Why is no real title available?)
• Inductive Definitions and Computability
• The Game Quantifier
• Logical Approaches to Computational Barriers
• Computational inductive definability
• Numerical invariants via abstract machines
• Ivan Soskov: a life in computability
• Some applications of computable one-one numberings

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

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