Annals of Pure and Applied Logic 43 (1):1-30 (1989)
| Abstract | This article has no associated abstract. (fix it) |
| Keywords | No keywords specified (fix it) |
| Categories | (categorize this paper) |
| DOI | 10.1016/0168-0072(89)90023-7 |
| Options |
Mark as duplicate
Export citation
Request removal from index
|
Download options
References found in this work BETA
The First Order Properties of Products of Algebraic Systems.S. Feferman & R. L. Vaught - 1967 - Journal of Symbolic Logic 32 (2):276-276.
A Uniform Method for Proving Lower Bounds on the Computational Complexity of Logical Theories.Kevin J. Compton & C. Ward Henson - 1990 - Annals of Pure and Applied Logic 48 (1):1.
The Decision Problem for Standard Classes.Yuri Gurevich - 1976 - Journal of Symbolic Logic 41 (2):460-464.
View all 7 references / Add more references
Citations of this work BETA
On the Restraining Power of Guards.Erich Grädel - 1999 - Journal of Symbolic Logic 64 (4):1719-1742.
Presburger Arithmetic, Rational Generating Functions, and Quasi-Polynomials.Kevin Woods - 2015 - Journal of Symbolic Logic 80 (2):433-449.
On the Restraining Power of Guards.Erich Grädel - 1999 - Journal of Symbolic Logic 64 (4):1719-1742.
Similar books and articles
Computational Complexity of Logical Theories of One Successor and Another Unary Function.Pascal Michel - 2007 - Archive for Mathematical Logic 46 (2):123-148.
On Dividing Chains in Simple Theories.Steffen Lewitzka & Ruy J. G. B. De Queiroz - 2005 - Archive for Mathematical Logic 44 (7):897-911.
Complexity Theories, Social Theory, and the Question of Social Complexity.Peter Stewart - 2001 - Philosophy of the Social Sciences 31 (3):323-360.
Logics Which Capture Complexity Classes Over the Reals.Felipe Cucker & Klaus Meer - 1999 - Journal of Symbolic Logic 64 (1):363-390.
Review: Anna R. Bruss, Albert R. Meyer, On Time-Space Classes and Their Relation to the Theory of Real Addition; Leonard Berman, The Complexity of Logical Theories; Hugo Volger, Turing Machines with Linear Alternation, Theories of Bounded Concatenation. [REVIEW]Charles Rackoff - 1986 - Journal of Symbolic Logic 51 (3):817-818.
Review: Jeanne Ferrante, Charles W. Rackoff, The Computational Complexity of Logical Theories. [REVIEW]Dirk Siefkes - 1984 - Journal of Symbolic Logic 49 (2):670-671.
Analytics
Added to PP index
2014-01-16
Total views
8 ( #939,377 of 2,402,070 )
Recent downloads (6 months)
1 ( #552,323 of 2,402,070 )
2014-01-16
Total views
8 ( #939,377 of 2,402,070 )
Recent downloads (6 months)
1 ( #552,323 of 2,402,070 )
How can I increase my downloads?
Downloads
