Journal: Inf. Comput.

Volume 54, Issue 3

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

Volume 54, Issue 1/2

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