scientific article; zbMATH DE number 3349789
From MaRDI portal
Publication:5625138
zbMath0221.02027MaRDI QIDQ5625138
Publication date: 1971
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Effectivity and reducibility with ordinal Turing machines, Approximating sets with equivalence relations, On λ-Definable Functions on Ordinals, \(\Delta\)-languages for sets and LOGSPACE computable graph transformers, Well ordering principles for iterated \(\Pi^1_1\)-comprehension, The gap‐two cardinal problem for uncountable languages, Hierarchien primitiv-rekursiver Funktionen im Transfiniten, All melodies are lost -- recognizability for weak and strong \(\alpha \)-register machines, Set-theoretic reflection is equivalent to induction over well-founded classes, Computable aspects of the Bachmann–Howard principle, \(\Pi_1^1\)-comprehension as a well-ordering principle, Logical problems of functional interpretations, OPTIMAL RESULTS ON RECOGNIZABILITY FOR INFINITE TIME REGISTER MACHINES, A categorical construction of Bachmann–Howard fixed points, The Shoenfield absoluteness lemma, Patterns of resemblance and Bachmann-Howard fixed points, Characterisations of variant transfinite computational models: Infinite time Turing, ordinal time Turing, and Blum–Shub–Smale machines, Functional interpretation of Aczel's constructive set theory, Predicatively computable functions on sets, Effective randomness for continuous measures
