On the computability of ordered fields

DOI10.33048/SEMI.2023.020.081MaRDI QIDQ6587462

O. V. Kudinov, Margarita Korovina

Publication date: 14 August 2024

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

zbMATH Keywords

complexityindex setcomputabilitycomputable analysiscomputable model theory

Mathematics Subject Classification ID

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

Cites Work

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

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)