Theorie Der Numerierungen III

DOI10.1002/MALQ.19770231902MaRDI QIDQ4152532zbMATH OpenOpenAlexFDO

Authors Yuri L. Ershov

Publication date 1977

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.19770231902

Mathematics Subject Classification ID

Model-theoretic algebra (03C60) Recursively (computably) enumerable sets and degrees (03D25) Structure theory of Boolean algebras (06E05) Computability and recursion theory (03D99) Model theory (03Cxx) Connections between field theory and logic (12L99)

Cited in

(30)

• Computable and Continuous Partial Homomorphisms on Metric Partial Algebras
• A decomposition of the Rogers semilattice of a family of d.c.e. sets
• Countable algebra and set existence axioms
• Strong reducibility of partial numberings
• Polynomial computability of fields of algebraic numbers
• Rogers semilattices of limitwise monotonic numberings
• On Constructive Nilpotent Groups
• Computable Heyting algebras with distinguished atoms and coatoms
• Universal recursion theoretic properties of r.e. preordered structures
• Representations versus numberings: On the relationship of two computability notions
• Some applications of computable one-one numberings
• Categoricity properties for computable algebraic fields
• Reducibility of domain representations and Cantor–Weihrauch domain representations
• Computable procedures for fields
• \(d\)-computable categoricity for algebraic fields
• An introduction to computable model theory on groups and fields
• Recursive isomorphism types of recursive Boolean algebras
• Spectra of Algebraic Fields and Subfields
• Recursive Boolean algebras with recursive atoms
• Can partial indexings be totalized?
• Lifting proofs from countable to uncountable mathematics
• Rogers semilattices of punctual numberings
• Fields of algebraic numbers computable in polynomial time. I
• Computable analysis with applications to dynamic systems
• Completeness of the hyperarithmetic isomorphism equivalence relation
• On the existence of universal numberings for finite families of d.c.e. sets
• Classifications of computable structures
• Revisiting uniform computable categoricity: for the sixtieth birthday of prof. Rod Downey
• Constructive proofs of the range property in lambda calculus
• Computable categoricity for algebraic fields with splitting algorithms

This page was built for publication: Theorie Der Numerierungen III

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