scientific article; zbMATH DE number 627413

zbMATH Open0804.03034MaRDI QIDQ4304754FDOQ4304754

Authors: Kostas Skandalis 

Publication date: 31 August 1994

Title of this publication is not available (Why is that?)

Recommendations

• Ordered Rings Over Which Output Sets are Recursively Enumerable Sets
• Ordered Subrings of the Reals in which Output Sets are Recursively Enumerable
• scientific article; zbMATH DE number 1285742
• Publication:4729767
• Computability over arbitrary fields

zbMATH Keywords

real closed fieldsordered fieldsoutput setsabstract computationinput setsuncountable subfields of \(\mathbb{R}\)unordered fields

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Turing machines and related notions (03D10) Ordered fields (12J15) Abstract and axiomatic computability and recursion theory (03D75) Connections between field theory and logic (12L99)

Cited In (1)

• Ordered Rings Over Which Output Sets are Recursively Enumerable Sets

This page was built for publication:

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