Some results on R-computable structures

zbMATH Open1370.03053arXiv0803.3404MaRDI QIDQ3464655FDOQ3464655

Wesley Calvert, John E. Porter

Publication date: 27 January 2016

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.

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

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

zbMATH Keywords

Turing computability\(\mathbb{R}\)-computable structureseffectiveness properties

Mathematics Subject Classification ID

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

Cited In (2)

• Some new computable structures of high rank
• Title not available (Why is that?)

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)