A fundamental dichotomy for definably complete expansions of ordered fields

Journal of Symbolic Logic 80 (4):1091-1115 (2015)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,880

External links

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

Through your library

Analytics

Added to PP
2016-06-30

Downloads
17 (#1,164,273)

6 months
5 (#1,080,408)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Subsystems of Second Order Arithmetic.Stephen G. Simpson - 1999 - Studia Logica 77 (1):129-129.
Definably complete structures are not pseudo-enumerable.Antongiulio Fornasiero - 2011 - Archive for Mathematical Logic 50 (5-6):603-615.

Add more references