✦ LIBER ✦

A lower bound for the complexity of Craig's interpolants in sentential logic

✍ Scribed by Mundici, Daniele

Publisher: Springer-Verlag
Year: 1983
Weight: 532 KB
Volume: 23
Category: Article
ISSN: 0003-9268
DOI: 10.1007/bf02023010

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A constructive proof of Craig's interpol

A constructive proof of Craig's interpolation lemma for m-valued logic

✍ Anita Waselewska 📂 Article 📅 1979 🏛 Springer Netherlands 🌐 English ⚖ 437 KB

The a]gebraie proof of CrMg's interpolation lemma for m-valued logic was given by Rasiowa in [i]. We present here a constructive proof of this lemma, based on a Gentzen type formMization. :Let J be the set oi all formulas oi m-valued predicate calculus. We assume that our language does not contain

Craig's interpolation theorem for the in

Craig's interpolation theorem for the intuitionistic logic and its extensions—A semantical approach

✍ Hiroakira Ono 📂 Article 📅 1986 🏛 Springer Netherlands 🌐 English ⚖ 935 KB

A lower bound for the topological comple

A lower bound for the topological complexity of poly(D,n)

✍ Harold Levine 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 646 KB

A lower bound for the nondeterministic s

A lower bound for the nondeterministic space complexity of context-free recognition

✍ Helmut Alt; Viliam Geffert; Kurt Mehlhorn 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 241 KB

A lower bound for the computational comp

A lower bound for the computational complexity of a set of disjunctives in a monotone basis

✍ D. Yu. Grigor'ev 📂 Article 📅 1981 🏛 Springer US 🌐 English ⚖ 317 KB

Lower Bounds for the Complexity of Funct

Lower Bounds for the Complexity of Functions in a Realistic RAM Model

✍ Nader H. Bshouty 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 127 KB

This paper develops a new technique that finds almost tight lower bounds for the complexity of programs that compute or approximate functions in a realistic RAM model. The nonuniform realistic RAM model is a model that uses the arithmetic Ä 4 operations q, y, = , the standard bit operation Shift, Ro