Decidable fragments of field theories

Journal of Symbolic Logic 55 (3):1007-1018 (1990)
We say φ is an ∀∃ sentence if and only if φ is logically equivalent to a sentence of the form ∀ x∃ y ψ(x,y), where ψ(x,y) is a quantifier-free formula containing no variables except x and y. In this paper we show that there are algorithms to decide whether or not a given ∀∃ sentence is true in (1) an algebraic number field K, (2) a purely transcendental extension of an algebraic number field K, (3) every field with characteristic 0, (4) every algebraic number field, (5) every cyclic (abelian, radical) extension field over Q, and (6) every field
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2274469
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 23,217
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA
Raphael M. Robinson (1964). The Undecidability of Pure Transcendental Extensions of Real Fields. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 10 (18):275-282.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

10 ( #410,593 of 1,932,465 )

Recent downloads (6 months)

1 ( #456,120 of 1,932,465 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.