Decidable fragments of field theories

Journal of Symbolic Logic 55 (3):1007-1018 (1990)
  Copy   BIBTEX

Abstract

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

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,665

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
45 (#483,737)

6 months
14 (#214,375)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Algorithms for sentences over integral domains.Shih Ping Tung - 1990 - Annals of Pure and Applied Logic 47 (2):189-197.

Add more citations

References found in this work

The undecidability of pure transcendental extensions of real fields.Raphael M. Robinson - 1964 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 10 (18):275-282.

Add more references