Primitive recursive fields and categoricity

DOI10.1007/s10469-019-09527-1zbMath1468.03043OpenAlexW2947598012WikidataQ127705128 ScholiaQ127705128MaRDI QIDQ2011324

Russell G. Miller, Iskander Sh. Kalimullin

Publication date: 6 December 2019

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10469-019-09527-1

Mathematics Subject Classification ID

Model-theoretic algebra (03C60) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Model theory of fields (12L12)

Related Items (4)

Constructing punctually categorical semigroups ⋮ Punctually presented structures I: Closure theorems ⋮ Primitive recursive ordered fields and some applications ⋮ PUNCTUAL CATEGORICITY AND UNIVERSALITY

Cites Work

• Unnamed Item
• Algebraic structures computable without delay
• On the representation of partial recursive functions as superpositions
• Structures computable in polynomial time. II
• Polynomial-time presentations of algebraic number fields
• The diversity of categoricity without delay
• Categoricity for primitive recursive and polynomial Boolean algebras
• Structures computable in polynomial time. I
• Spectra of Algebraic Fields and Subfields
• A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS

This page was built for publication: Primitive recursive fields and categoricity