Information and Computation
, Volume 125
Volume 125, Number 1, 25 February 1996
Nadia Creignou
,
Miki Hermann
: Complexity of Generalized Satisfiability Counting Problems. 1-12
BibTeX
David W. Juedes
,
Jack H. Lutz
: Completeness and Weak Completeness Under Polynomial-Size Circuits. 13-31
BibTeX
Dora Giammarresi
,
Antonio Restivo
,
Sebastian Seibert
,
Wolfgang Thomas
: Monadic Second-Order Logic Over Rectangular Pictures and Recognizability by Tiling Systems. 32-45
BibTeX
Yves Lafont
,
Andre Scedrov
: The Undecidability of Second Order Multiplicative Linear Logic. 46-51
BibTeX
Judit Bar-Ilan
,
David Peleg
: Scheduling Jobs Using Common Resources. 52-61
BibTeX
Orna Kupferman
,
Orna Grumberg
: Branching-Time Temporal Logic and Tree Automata. 62-69
BibTeX
Ronald V. Book
,
Osamu Watanabe
: On Random Hard Sets for NP. 70-76
BibTeX
Volume 125, Number 2, 15 March 1996
Masami Hagiya
: Preface. 77
BibTeX
Martín Abadi
,
Luca Cardelli
: A Theory of Primitive Objects: Untyped and First-Order Systems. 78-102
BibTeX
Franco Barbanera
,
Stefano Berardi
: A Symmetric Lambda Calculus for Classical Program Extraction. 103-117
BibTeX
Ursula Goltz
,
Roberto Gorrieri
,
Arend Rensink
: Comparing Syntactic and Semantic Sction Refinement. 118-143
BibTeX
Masako Takahashi
,
Yohji Akama
,
Sachio Hirokawa
: Normal Proofs and Their Grammar. 144-153
BibTeX
David A. Plaisted
,
Andrea Sattler-Klein
: Proof Lengths for Equational Completion. 154-170
BibTeX
Copyright ©
Sat May 16 23:59:58 2009 by
Michael Ley
(
ley@uni-trier.de
)