Reducts of some structures over the reals
Journal of Symbolic Logic 58 (3):955-966 (1993)
| Abstract | We consider reducts of the structure $\mathscr{R} = \langle\mathbb{R}, +, \cdot, <\rangle$ and other real closed fields. We compete the proof that there exists a unique reduct between $\langle\mathbb{R}, +, <, \lambda_a\rangle_{a\in\mathbb{R}}$ and R, and we demonstrate how to recover the definition of multiplication in more general contexts than the semialgebraic one. We then conclude a similar result for reducts between $\langle\mathbb{R}, \cdot, <\rangle$ and R and for general real closed fields | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,865 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesAlexander Raichev (2005). Relative Randomness and Real Closed Fields. Journal of Symbolic Logic 70 (1):319 - 330.
Alexis Bès (2000). An Extension of the Cobham-Semënov Theorem. Journal of Symbolic Logic 65 (1):201-211.
Charles Rackoff (1976). On the Complexity of the Theories of Weak Direct Powers. Journal of Symbolic Logic 41 (3):561-573.
Françoise Delon & Patrick Simonetta (1999). Un Principe d'Ax-Kochen-Ershov Pour Des Structures Intermediares Entre Groupes Et Corps Values. Journal of Symbolic Logic 64 (3):991-1027.
David Marker, Ya'Acov Peterzil & Anand Pillay (1992). Additive Reducts of Real Closed Fields. Journal of Symbolic Logic 57 (1):109-117.
Françoise Point (2000). On Decidable Extensions of Presburger Arithmetic: From A. Bertrand Numeration Systems to Pisot Numbers. Journal of Symbolic Logic 65 (3):1347-1374.
Paolo Casalegno (1985). On the T-Degrees of Partial Functions. Journal of Symbolic Logic 50 (3):580-588.
Alexis Bès (1997). Undecidable Extensions of Büchi Arithmetic and Cobham-Semënov Theorem. Journal of Symbolic Logic 62 (4):1280-1296.
Alexis Bés & Denis Richard (1998). Undecidable Extensions of Skolem Arithmetic. Journal of Symbolic Logic 63 (2):379-401.
Patrick Cegielski, Yuri Matiyasevich & Denis Richard (1996). Definability and Decidability Issues in Extensions of the Integers with the Divisibility Predicate. Journal of Symbolic Logic 61 (2):515-540.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads0Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
