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