Computing strength of structures related to the field of real numbers

Journal of Symbolic Logic 82 (1):137-150 (2017)
  Copy   BIBTEX

Abstract

In [8], the third author defined a reducibility$\le _w^{\rm{*}}$that lets us compare the computing power of structures of any cardinality. In [6], the first two authors showed that the ordered field of reals${\cal R}$lies strictly above certain related structures. In the present paper, we show that$\left \equiv _w^{\rm{*}}{\cal R}$. More generally, for the weak-looking structure${\cal R}$ℚconsisting of the real numbers with just the ordering and constants naming the rationals, allo-minimal expansions of${\cal R}$ℚare equivalent to${\cal R}$. Using this, we show that for any analytic functionf,$\left \equiv _w^{\rm{*}}{\cal R}$. $is noto-minimal.)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,590

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Restricted mad families.Osvaldo Guzmán, Michael Hrušák & Osvaldo Téllez - 2020 - Journal of Symbolic Logic 85 (1):149-165.

Analytics

Added to PP
2017-03-26

Downloads
19 (#190,912)

6 months
5 (#1,552,255)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Computable valued fields.Matthew Harrison-Trainor - 2018 - Archive for Mathematical Logic 57 (5-6):473-495.

Add more citations

References found in this work

A Decision Method for Elementary Algebra and Geometry.Alfred Tarski - 1952 - Journal of Symbolic Logic 17 (3):207-207.
A Decision Method for Elementary Algebra and Geometry.Alfred Tarski - 1949 - Journal of Symbolic Logic 14 (3):188-188.
Forcing a countable structure to belong to the ground model.Itay Kaplan & Saharon Shelah - 2016 - Mathematical Logic Quarterly 62 (6):530-546.

Add more references