A criterion for P-computability of structures

DOI10.1007/s10469-023-09710-5OpenAlexW4386293172MaRDI QIDQ6072994

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

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

Cites Work

• Unnamed Item
• Unnamed Item
• Independence in computable algebra
• Fields of algebraic numbers computable in polynomial time. I
• Polynomial-time versus recursive models
• Finitely generated structures computable in polynomial time
• Quotient structures and groups computable in polynomial time
• Degree spectra for transcendence in fields
• Structures computable in polynomial time. I

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