Indécidabilité de corps de séries formelles

Journal of Symbolic Logic 53 (4):1227-1234 (1988)
  Copy   BIBTEX

Abstract

Consider k((G)) in the language of valued fields enriched with a unary predicate for the set of constants and another one for the cross-section. For perfect k, this structure is undecidable if it does not satisfy Kaplansky's conditions

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,497

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
2009-01-28

Downloads
30 (#537,555)

6 months
15 (#174,673)

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

No references found.

Add more references