Some aspects of generalized computability

DOI10.1007/BF02219296zbMath0288.02022MaRDI QIDQ1846417

L. N. Pobedin

Publication date: 1974

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

Full work available at URL: https://eudml.org/doc/186792

Mathematics Subject Classification ID

Computability and recursion theory (03D99) Turing machines and related notions (03D10)

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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalized computations and second degree arithmetic
• Recursive Functionals and Quantifiers of Finite Types I
• Constructively accessible ordinal numbers

This page was built for publication: Some aspects of generalized computability