The following pages link to Theorie Der Numerierungen III (Q4152532):
Displaying 20 items.
- Some applications of computable one-one numberings (Q750430) (← links)
- Fields of algebraic numbers computable in polynomial time. I (Q784464) (← links)
- Countable algebra and set existence axioms (Q1063593) (← links)
- Constructive proofs of the range property in lambda calculus (Q1314345) (← links)
- Classifications of computable structures (Q1704081) (← links)
- Strong reducibility of partial numberings (Q1766927) (← links)
- Polynomial computability of fields of algebraic numbers (Q1994088) (← links)
- Computable procedures for fields (Q2117796) (← links)
- Completeness of the hyperarithmetic isomorphism equivalence relation (Q2143655) (← links)
- Lifting proofs from countable to uncountable mathematics (Q2672667) (← links)
- Can partial indexings be totalized? (Q2758051) (← links)
- An introduction to computable model theory on groups and fields (Q2882823) (← links)
- Revisiting Uniform Computable Categoricity: For the Sixtieth Birthday of Prof. Rod Downey (Q2970964) (← links)
- On Constructive Nilpotent Groups (Q2970967) (← links)
- Recursive isomorphism types of recursive Boolean algebras (Q3331214) (← links)
- Recursive Boolean algebras with recursive atoms (Q3331215) (← links)
- Computable and Continuous Partial Homomorphisms on Metric Partial Algebras (Q4650302) (← links)
- On the existence of universal numberings for finite families of d.c.e. sets (Q5419207) (← links)
- Rogers semilattices of limitwise monotonic numberings (Q6094148) (← links)
- Computable Heyting algebras with distinguished atoms and coatoms (Q6117138) (← links)
