Abstract First Order Computability. I
From MaRDI portal
Publication:5622175
DOI10.2307/1994926zbMath0218.02038OpenAlexW4247184275MaRDI QIDQ5622175
Publication date: 1969
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1994926
Related Items
The jump operation for structure degrees ⋮ Inductive definitions over finite structures ⋮ Unnamed Item ⋮ Computability by nondeterministic program and the Moschovakis search computability ⋮ Monotone inductive definitions in a constructive theory of functions and classes ⋮ Computational inductive definability ⋮ Rice sequences of relations ⋮ Unnamed Item ⋮ Computation over algebraic structures and a classification of undecidable problems ⋮ EXPANDING THE REALS BY CONTINUOUS FUNCTIONS ADDS NO COMPUTATIONAL POWER ⋮ A note on three-valued logic and Tarski theorem on truth definitions ⋮ Hierarchies of Effective Descriptive Set Theory ⋮ Enumeration Reducibility and Computable Structure Theory ⋮ Floyd's principle, correctness theories and program equivalence ⋮ On Σ‐definability without equality over the real numbers ⋮ Parametrization over inductive relations of a bounded number of variables ⋮ Unnamed Item ⋮ Inductive Definitions and Computability ⋮ Hyperarithmetical Sets ⋮ The Game Quantifier ⋮ Fixed Points on the Real Numbers without the Equality Test ⋮ Unnamed Item ⋮ Introduction to Turing categories ⋮ Operational set theory and small large cardinals ⋮ Feferman on Computability ⋮ Computability by means of effectively definable schemes and definability via enumerations ⋮ Some applications of computable one-one numberings ⋮ D. Skordev's hypothesis ⋮ Computation by `While' programs on topological partial algebras ⋮ Translatability of schemas over restricted interpretations
