Some aspects of generalized computability

DOI10.1007/BF02219296MaRDI QIDQ1846417zbMATH OpenFDO

Authors 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

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

Cites work

• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3397511 (Why is no real title available?)
• scientific article; zbMATH DE number 3188506 (Why is no real title available?)
• Constructively accessible ordinal numbers
• Generalized computations and second degree arithmetic
• Recursive Functionals and Quantifiers of Finite Types I

Cited in

(19)

• Theories with recursive models
• Enumerations of simple models
• Theory of Abelian groups with constructive models
• Criterion for strong constructivizability of a homogeneous model
• Autostability and extensions of constructivizations
• Constructivizability of a prime model
• Strong constructivizability of homogeneous models
• A totally transcendental decidable theory without constructivizable homogeneous models
• Homogeneous 0'-elements in structural partial orderings
• Constructivizations of Boolean algebras
• Recursive isomorphism types of recursive Boolean algebras
• Recursive Boolean algebras with recursive atoms
• Nonuniform autostability of models
• Numerations of saturated and homogeneous models
• 2004 Summer Meeting of the Association for Symbolic Logic
• Turing machine computations in finitely axiomatizable theories
• Degrees of autostability relative to strong constructivizations
• Totally transcendental theory with a nonconstructivizable prime model
• Algorithmic properties of branching models

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1846417)