The most nonelementary theory

We give a direct proof by generic reduction that testing validity of formulas in a decidable rudimentary theory Ω of finite typed sets (Henkin, Fundamenta Mathematicæ 52 (1963) 323–344) requires space and time exceeding infinitely often (1) 2 · · · 2 exp ∞( exp(cn))=2 height 2 cm for some constant c...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Information and computation Ročník 190; číslo 2; s. 196 - 219
Hlavný autor:	Vorobyov, Sergei
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	San Diego, CA Elsevier Inc 01.05.2004 Elsevier
Predmet:	Applied sciences Computer science; control theory; systems Exact sciences and technology Generic reduction Inductive definition Lower complexity bound Miscellaneous Nonelementary theory Reduction via length order Theoretical computing Inductive definition 03D15 Complexity of computation Lower complexity bound Reduction via length order MSC 68Q25 Analysis of algorithms and problem complexity Nonelementary theory Generic reduction Computer theory
ISSN:	0890-5401, 1090-2651
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!