Fleischmann, Klaus; Mahr, Bernd; Siefkes, Dirk Bounded concatenation theory as a uniform method for proving lower complexity bounds. (English) Zbl 0439.03004 Logic colloquium 76, Proc. Conf., Oxford 1976, Stud. Logic Found. Math., Vol. 87, 471-490 (1977). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 5 Documents MSC: 03B25 Decidability of theories and sets of sentences 03D15 Complexity of computation (including implicit computational complexity) Keywords:logical theories; lower complexity bounds; bounded concatenation theory; bounded word theory PDF BibTeX XML