Toward logic tailored for computational complexity
- 1 January 1984
- book chapter
- Published by Springer Nature in Lecture Notes in Mathematics
- p. 175-216
- https://doi.org/10.1007/bfb0099486
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- The Gödel class with identity is unsolvableBulletin of the American Mathematical Society, 1984
- Structure and complexity of relational queriesJournal of Computer and System Sciences, 1982
- AlternationJournal of the ACM, 1981
- Relative complexity of checking and evaluatingInformation Processing Letters, 1976
- The complexity of explicit definitionsAdvances in Mathematics, 1976
- Monadic generalized spectraMathematical Logic Quarterly, 1975
- Turing machines and the spectra of first-order formulasThe Journal of Symbolic Logic, 1974
- On Extensions of Elementary LogicTheoria, 1969
- Linear reasoning. A new form of the Herbrand-Gentzen theoremThe Journal of Symbolic Logic, 1957
- A lattice-theoretical fixpoint theorem and its applicationsPacific Journal of Mathematics, 1955