Generalized computations and second degree arithmetic

DOI10.1007/BF02219441zbMath0278.02036OpenAlexW4248899757MaRDI QIDQ1394341

N. V. Belyakin

Publication date: 1971

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02219441

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Recursive ordinals and ordinal notations (03F15) Turing machines and related notions (03D10) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (1)

Some aspects of generalized computability

Cites Work

• Unnamed Item

This page was built for publication: Generalized computations and second degree arithmetic