Theorie Der Numerierungen III
From MaRDI portal
Publication:4152532
DOI10.1002/malq.19770231902zbMath0374.02028OpenAlexW4230166451MaRDI QIDQ4152532
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
Model-theoretic algebra (03C60) Connections between field theory and logic (12L99) Recursively (computably) enumerable sets and degrees (03D25) Structure theory of Boolean algebras (06E05) Computability and recursion theory (03D99) Model theory (03Cxx)
Related Items (30)
An introduction to computable model theory on groups and fields ⋮ Universal recursion theoretic properties of r.e. preordered structures ⋮ Rogers semilattices of punctual numberings ⋮ Completeness of the hyperarithmetic isomorphism equivalence relation ⋮ Lifting proofs from countable to uncountable mathematics ⋮ Rogers semilattices of limitwise monotonic numberings ⋮ Computable Heyting algebras with distinguished atoms and coatoms ⋮ Classifications of computable structures ⋮ Revisiting Uniform Computable Categoricity: For the Sixtieth Birthday of Prof. Rod Downey ⋮ On Constructive Nilpotent Groups ⋮ Reducibility of domain representations and Cantor–Weihrauch domain representations ⋮ Computable and Continuous Partial Homomorphisms on Metric Partial Algebras ⋮ Polynomial computability of fields of algebraic numbers ⋮ Spectra of Algebraic Fields and Subfields ⋮ Can partial indexings be totalized? ⋮ On the existence of universal numberings for finite families of d.c.e. sets ⋮ Recursive isomorphism types of recursive Boolean algebras ⋮ Recursive Boolean algebras with recursive atoms ⋮ Strong reducibility of partial numberings ⋮ Representations versus numberings: On the relationship of two computability notions ⋮ A decomposition of the Rogers semilattice of a family of d.c.e. sets ⋮ Computable analysis with applications to dynamic systems ⋮ Some applications of computable one-one numberings ⋮ d-computable categoricity for algebraic fields ⋮ Fields of algebraic numbers computable in polynomial time. I ⋮ Computable categoricity for algebraic fields with splitting algorithms ⋮ Categoricity properties for computable algebraic fields ⋮ Countable algebra and set existence axioms ⋮ Constructive proofs of the range property in lambda calculus ⋮ Computable procedures for fields
This page was built for publication: Theorie Der Numerierungen III
