Information and Computation, Volume 112

Volume 112, Number 1, 1994

Martín Abadi, Joseph Y. Halpern: Decidability and Expressiveness for First-Order Logics of Probability. 1-36 BibTeX
Christos Levcopoulos, Ola Petersson: Sorting Shuffled Monotone Sequences. 37-50 BibTeX
Vince Grolmusz: The BNS Lower Bound for Multi-Party Protocols in Nearly Optimal. 51-54 BibTeX
Matthew Hennessy: A Fully Abstract Denotational Model for Higher-Order Processes. 55-95 BibTeX
Ian Parberry: A Guide for New Referees in Theoretical Computer Science. 96-116 BibTeX
Pei Yuan Yan, Ian Parberry: Exponential Size Lower Bounds for Some Depth Three Circuits. 117-130 BibTeX
Benjamin C. Pierce: Bounded Quantification is Undecidable. 131-165 BibTeX

Hubert Comon, Catherine Delor: Equational Formulae with Membership Constraints. 167-216 BibTeX
Eric Allender, Ulrich Hertrampf: Depth Reduction for Circuits of Unbounded Fan-In. 217-238 BibTeX
Yannis Dimopoulos, Vangelis Magirou: A Graph-Theoretic Approach to Default Logic. 239-256 BibTeX
Ramamohan Paturi, Michael E. Saks: Approximating Threshold Circuits by Rational Functions. 257-272 BibTeX
Thomas A. Henzinger, Zohar Manna, Amir Pnueli: Temporal Proof Methodologies for Timed Transition Systems. 273-337 BibTeX