MPI-INF Logo
Publications

Server    halma.mpi-inf.mpg.de

Proceedings Article, Paper


@InProceedings
Beitrag in Tagungsband, Workshop
Author, Editor
Author(s):
Vorobyov, Sergeidblp
Editor(s):
Winskel, Glynndblp
BibTeX cite key*:
Vorobyov97LICS97
Title, Booktitle
Title*:
The `hardest´ natural decidable theory
Booktitle*:
Proceedings of the Twelfth Annual IEEE Symposium on Logic in Computer Science (LICS-97)
Event, URLs
Conference URL::
Downloading URL:
Event Address*:
Warsaw, Poland
Language:
English
Event Date*
(no longer used):
June 26-29, 1997
Organization:
IEEE Computer Society
Event Start Date:
8 July 2003
Event End Date:
12 July 2003
Publisher
Name*:
IEEE
URL:
Address*:
New York, USA
Type:
Full paper
Vol, No, Year, pp.
Series:
Volume:
Number:
Month:
June-July
Pages:
294-305
Year*:
1997
VG Wort Pages:
ISBN/ISSN:
0-8186-7925-5
Sequence Number:
DOI:
Note, Abstract, ©
(LaTeX) Abstract:
Since mid-seventies it was an open problem as to
whether there exist natural decidable theories requiring
time (lower bound) exceeding any linearly growing towers of 2s
to decide. It was conjectured that all natural decidable
theories can be decided (upper bound) within time bounded by
a tower of 2s growing linearly with the length of input.
Although it happens to be true for the majority of non-elementary
theories (Rabin's S2S, theory of term algebras, extended regular
expressions, etc), the conjecture fails. We demonstrate that a
modest fragment of L.Henkin's theory of propositional types (1963)
has the tower of 2s growing *exponentially* with the length of
input as a lower bound. This new unprecedentedly high lower
bound allows us to considerably improve the known lower bounds
and to settle the new ones for other theories.
Keywords:
Complexity theory, complexity classes, non-elementary theories, lambda calculus, higher-order matching
HyperLinks / References / URLs:
HardestDecTh.dvi.gz
Download
Access Level:
Public

Correlation
MPG Unit:
Max-Planck-Institut für Informatik
MPG Subunit:
Programming Logics Group
Audience:
Expert
Appearance:
MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat



BibTeX Entry:
@INPROCEEDINGS{Vorobyov97LICS97,
AUTHOR = {Vorobyov, Sergei},
 EDITOR = {Winskel, Glynn},
 TITLE = {The `hardest´ natural decidable theory},
 BOOKTITLE = {Proceedings of the Twelfth Annual IEEE Symposium on Logic in Computer Science (LICS-97)},
 PUBLISHER = {IEEE},
 YEAR = {1997},
 TYPE = {Full paper},
 ORGANIZATION = {IEEE Computer Society},
 PAGES = {294--305},
 ADDRESS = {Warsaw, Poland},
 MONTH = {June-July},
 ISBN = {0-8186-7925-5},
}

Entry last modified by Christine Kiesel, 03/12/2010
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Sergei Vorobyov		Created
03/11/1997 02:42:19 PM
Revisions
9.
8.
7.
6.
5.		Editor(s)
Christine Kiesel
Christine Kiesel
Christine Kiesel
Uwe Brahm
Uwe Brahm		Edit Dates
08.07.2003 15:29:36
30.08.2001 10:00:57
30.08.2001 10:00:31
04/02/98 07:15:35 PM
02/26/98 06:57:13 PM