Abstract Computability and Invariant Definability
From MaRDI portal
Publication:5622176
DOI10.2307/2270854zbMath0218.02039MaRDI QIDQ5622176
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
03D75: Abstract and axiomatic computability and recursion theory
Related Items
Unnamed Item, Inductive Definitions and Computability, The Game Quantifier, Some applications of computable one-one numberings, Inductive definability in formal language theory, Computability by means of effectively definable schemes and definability via enumerations, Enumeration Reducibility and Computable Structure Theory
Cites Work