Some results on R-computable structures

MaRDI QIDQ3464655zbMATH OpenFDO

Authors Wesley Calvert, John E. Porter

Publication date 27 January 2016

Full work available at URL https://arxiv.org/abs/0803.3404

zbMATH Keywords

\(\mathbb{R}\)-computable structureseffectiveness propertiesTuring computability

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Computation over the reals, computable analysis (03D78)

Abstract: This survey paper examines the effective model theory obtained with the BSS model of real number computation. It treats the following topics: computable ordinals, satisfaction of computable infinitary formulas, forcing as a construction technique, effective categoricity, effective topology, and relations with other models for the effective theory of uncountable structures.

Recommendations

• Effective Structures
• scientific article; zbMATH DE number 1984268
• On computably enumerable structures
• Computability-Theoretic Complexity of Countable Structures
• Computable model theory over the reals

Cited in

(4)

• On computably enumerable structures
• Effectively existentially-atomic structures
• scientific article; zbMATH DE number 6536307 (Why is no real title available?)
• Some new computable structures of high rank

This page was built for publication: Some results on \(\mathbb{R}\)-computable structures

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