The complexity of logical theories
- 31 May 1980
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 11 (1), 71-77
- https://doi.org/10.1016/0304-3975(80)90037-7
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- On time-space classes and their relation to the theory of real additionTheoretical Computer Science, 1980
- A 222pn upper bound on the complexity of Presburger ArithmeticJournal of Computer and System Sciences, 1978
- A Decision Procedure for the First Order Theory of Real Addition with OrderSIAM Journal on Computing, 1975