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...

Full description

Saved in:

Bibliographic Details
Published in:	Information and computation Vol. 190; no. 2; pp. 196 - 219
Main Author:	Vorobyov, Sergei
Format:	Journal Article
Language:	English
Published:	San Diego, CA Elsevier Inc 01.05.2004 Elsevier
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!