A criterion for P-computability of structures

DOI10.1007/S10469-023-09710-5MaRDI QIDQ6072994zbMATH OpenOpenAlexFDO

Authors P. E. Alaev

Publication date 15 September 2023

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

Full work available at URL https://doi.org/10.1007/s10469-023-09710-5

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Other degrees and reducibilities in computability and recursion theory (03D30)

Cites work

• Degree spectra for transcendence in fields
• Fields of algebraic numbers computable in polynomial time. I
• Finitely generated structures computable in polynomial time
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 1302879 (Why is no real title available?)
• Independence in computable algebra
• Polynomial-time versus recursive models
• Quotient structures and groups computable in polynomial time
• Structures computable in polynomial time. I

Cited in

(2)

• The existence of primitive recursive structures
• Description of structures computable in polynomial time

This page was built for publication: A criterion for P-computability of structures

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