On the computability of ordered fields

DOI10.33048/SEMI.2023.020.081MaRDI QIDQ6587462FDOQ6587462

Authors: M. V. Korovina, Oleg Kudinov 

Publication date: 14 August 2024

Published in: Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

zbMATH Keywords

complexitycomputable analysisindex setcomputabilitycomputable model theory

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Theory of numerations, effectively presented structures (03D45) Applications of computability and recursion theory (03D80)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• CONSTRUCTIVE ALGEBRAS I
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computable Algebra, General Theory and Theory of Computable Fields
• Theory of Formal Systems. (AM-47)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Countable homogeneous Boolean algebras
• Title not available (Why is that?)
• Title not available (Why is that?)
• Classes of Predictably Computable Functions
• Degree spectra of real closed fields
• Spectrum of the field of computable real numbers
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Uniformity Principle for  -definability

This page was built for publication: On the computability of ordered fields

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