Information and Computation, Volume 54

Volume 54, Number 1-2, 1982

Martin Davis: Why Gödel Didn't Have Church's Thesis. 3-24 BibTeX
Howard A. Blair: The Recursion-Theoretical Complexity of the Semantics of Predicate Logic as a Programming Language. 25-47 BibTeX
Kenneth L. Manders, Robert R. Daley: The Complexity of the Validity Problem for Dynamic Logic. 48-69 BibTeX
J. W. de Bakker, Jeffery I. Zucker: Processes and the Denotational Semantics of Concurrency. 70-120 BibTeX
Robert S. Streett: Propositional Dynamic Logic of Looping and Converse Is Elementarily Decidable. 121-141 BibTeX

Stathis Zachos: Robustness of Probabilistic Computational Complexity Classes under Definitional Perturbations. 143-154 BibTeX
Hermann A. Maurer, Grzegorz Rozenberg, Emo Welzl: Using String Languages to Describe Picture Languages. 155-185 BibTeX
Jan A. Bergstra, J. V. Tucker: The Completeness of the Algebraic Specification Methods for Computable Data Types. 186-200 BibTeX
Simona Ronchi Della Rocca: Characterization Theorems for a Filter Lambda Model. 201-216 BibTeX
Pavol Duris, Zvi Galil: On Reversal-Bounded Counter Machines and on Pushdown Automata with a Bound on the Size of their Pushdown Store. 217-227 BibTeX