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 BibTeX
Steve Jackson: Partition Properties and Well-Ordered Sequences. 81-101 BibTeX

Gregory L. McColm: Parametrization over Inductive Relations of a Bounded Number of Variables. 103-134 BibTeX
Erik Palmgren, Viggo Stoltenberg-Hansen: Domain Interpretations of Martin-Löf's Partial Type Theory. 135-196 BibTeX

Tomek Bartoszynski, Haim Judah: Jumping with Random Reals. 197-213 BibTeX
Chi Tat Chong, Rodney G. Downey: Minimal Degrees Recursive in 1-Generic Degrees. 215-225 BibTeX
Chi Tat Chong, K. J. Mourad: The Degree of a Sigma_n Cut. 227-235 BibTeX
Julia F. Knight: Constructions by Transfinitely Many Workers. 237-259 BibTeX
Jan Krajícek: Exponentiation and Second-Order Bounded Arithmetic. 261-276 BibTeX
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 BibTeX
Rodney G. Downey: Corrigendum: Correction to ``Undecidability of L(F_infty) and Other Lattices of r.e. Substructures''. 299-301 BibTeX