Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: Notesfiles $Revision: 1.6.2.17 $; site smu.UUCP
Path: utzoo!linus!decvax!tektronix!uw-beaver!cornell!vax135!houxm!ihnp4!inuxc!pur-ee!uiucdcs!smu!yun
From: yun@smu
Newsgroups: net.math.symbolic
Subject: Re: Tarski's decision method
Message-ID: <35800016@smu.UUCP>
Date: Fri, 9-Nov-84 01:59:00 EST
Article-I.D.: smu.35800016
Posted: Fri Nov  9 01:59:00 1984
Date-Received: Sun, 11-Nov-84 20:55:28 EST
References: <50200001@uicsl.UUCP>
Lines: 7
Nf-ID: #R:uicsl:50200001:smu:35800016:000:397
Nf-From: smu!yun    Nov  9 00:59:00 1984

Plenty of work has been done since then.  E.g. George Collins of U. Wisconsin
spent much of career trying to make Tarski's decision procedure efficient, or
just computable for any "non-toy" problems.  Recently, some complexity results
were discovered (bad news, doubly exponential).  References can be found in 
SYMSAC Proc. '71 or 76.
                                     D. Y. Y. Yun, CS&E/SMU