Primitive recursive fields and categoricity

DOI10.1007/S10469-019-09527-1MaRDI QIDQ2011324zbMATH OpenOpenAlexWikidataFDO

Authors Iskander Kalimullin, Russell Miller

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

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

Cites work

• A computable functor from graphs to fields
• Algebraic structures computable without delay
• Categoricity for primitive recursive and polynomial Boolean algebras
• scientific article; zbMATH DE number 3843854 (Why is no real title available?)
• On the representation of partial recursive functions as superpositions
• Polynomial-time presentations of algebraic number fields
• Spectra of Algebraic Fields and Subfields
• Structures computable in polynomial time. I
• Structures computable in polynomial time. II
• The diversity of categoricity without delay

Cited in

(4)

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

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

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