scientific article; zbMATH DE number 3348085
From MaRDI portal
Publication:5623672
zbMath0219.02027MaRDI QIDQ5623672
Publication date: 1971
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Mathematics, Metaphysics and the Multiverse ⋮ Unnamed Item ⋮ Enumeration Reducibility and Computable Structure Theory ⋮ Primitive recursive selection functions for existential assertions over abstract algebras ⋮ Transfinite recursion and computation in the iterative conception of set ⋮ The scope of Gödel's first incompleteness theorem ⋮ COMPUTABILITY IN UNCOUNTABLE BINARY TREES ⋮ Introduction to Turing categories ⋮ COMPUTABILITY IN PARTIAL COMBINATORY ALGEBRAS ⋮ Hyperhypersimple sets and \(\Delta _ 2\) systems ⋮ A view of computability on term algebras ⋮ Undecidability vs transfinite induction for the consistency of hyperarithmetical sets