Some aspects of generalized computability
From MaRDI portal
Publication:1846417
DOI10.1007/BF02219296zbMath0288.02022MaRDI QIDQ1846417
Publication date: 1974
Published in: Algebra and Logic (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/186792
Related Items (19)
Nonuniform autostability of models ⋮ Criterion for strong constructivizability of a homogeneous model ⋮ Strong constructivizability of homogeneous models ⋮ Numerations of saturated and homogeneous models ⋮ Totally transcendental theory with a nonconstructivizable prime model ⋮ A totally transcendental decidable theory without constructivizable homogeneous models ⋮ Constructivizations of Boolean algebras ⋮ Recursive isomorphism types of recursive Boolean algebras ⋮ Recursive Boolean algebras with recursive atoms ⋮ Theories with recursive models ⋮ Theory of Abelian groups with constructive models ⋮ Algorithmic properties of branching models ⋮ Degrees of autostability relative to strong constructivizations ⋮ 2004 Summer Meeting of the Association for Symbolic Logic ⋮ Enumerations of simple models ⋮ Homogeneous \(0'\)-elements in structural partial orderings ⋮ Turing machine computations in finitely axiomatizable theories ⋮ Autostability and extensions of constructivizations ⋮ Constructivizability of a prime model
Cites Work
This page was built for publication: Some aspects of generalized computability