Information and Computation, Volume 80

Volume 80, Number 1, 1989

Leen Torenvliet, Peter van Emde Boas: Simplicity, Immunity, Relativizations and Nondeterminism. 1-17
Hans Kleine Büning, Ulrich Löwen: Optimizing Propositional Calculus Formulas with Regard to Questions of Deducibility. 18-43
Miklos Santha: Relativized Arthur-Merlin versus Merlin-Arthur Games. 44-49
Pierre-Louis Curien, Adam Obtulowicz: Partiality, Cartesian closedness and Toposes. 50-95

Jan Willem Klop, Roel C. de Vrijer: Unique Normal Forms for Lambda Calculus with Surjective Pairing. 97-113
Joost Engelfriet: The Power to Two-Way Deterministic Checking Stack Automata. 114-120
Gilles Bernot: Correctness Proofs for Abstract Implementation. 121-151
Vijay V. Vazirani: NC Algorithms for Computing the Number of Perfect Matchings in K_3,3-Free Graphs and Related Problems. 152-164
Patrick Cousot, Radhia Cousot: A Language Independent Proof of the Soundness and Completeness of Generalized Hoare Logic. 165-191

Howard J. Karloff, Walter L. Ruzzo: The Iterated Mod Problem. 193-204
Patrick W. Dymond, Stephen A. Cook: Complexity Theory of Parallel Time and Hardware. 205-226
J. Ross Quinlan, Ronald L. Rivest: Inferring Decision Trees Using the Minimum Description Length Principle. 227-248
Sara Porat, Nissim Francez: Fairness in Context-Free Grammars under Every Choice-strategy. 249-268
Birgit Jenner, Bernd Kirsig, Klaus-Jörn Lange: The Logarithmic Alternation Hierarchy Collapses: A \sum^\calL_2=APi^\calL_2. 269-287