default search action
Annals of Pure and Applied Logic, Volume 48
Volume 48, Number 1, 10 July 1990
Kevin J. Compton, C. Ward Henson:
A Uniform Method for Proving Lower Bounds on the Computational Complexity of Logical Theories. 1-79
Volume 48, Number 2, 16 July 1990
- Gregory L. McColm:
Parametrization over Inductive Relations of a Bounded Number of Variables. 103-134 - Erik Palmgren, Viggo Stoltenberg-Hansen:
Domain Interpretations of Martin-Löf's Partial Type Theory. 135-196
Volume 48, Number 3, 31 August 1990
- Alexander Yakhnis, Vladimir Yakhnis:
Extension of Gurevich-Harrington's Restricted Memory Determinacy Theorem: A Criterion for the Winning Player and an Explicit Class of Winning Strategies. 277-297 - Rodney G. Downey:
Corrigendum: Correction to ``Undecidability of L(Finfty) and Other Lattices of r.e. Substructures''. 299-301
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2015-03-02 23:48 CET by the dblp team