External Links

    Journal: Inf. Comput.

    Volume 125, Issue 2

    77 -- 0Masami Hagiya. Preface
    78 -- 102Martín Abadi, Luca Cardelli. A Theory of Primitive Objects: Untyped and First-Order Systems
    103 -- 117Franco Barbanera, Stefano Berardi. A Symmetric Lambda Calculus for Classical Program Extraction
    118 -- 143Ursula Goltz, Roberto Gorrieri, Arend Rensink. Comparing Syntactic and Semantic Sction Refinement
    144 -- 153Masako Takahashi, Yohji Akama, Sachio Hirokawa. Normal Proofs and Their Grammar
    154 -- 170David A. Plaisted, Andrea Sattler-Klein. Proof Lengths for Equational Completion

    Volume 125, Issue 1

    1 -- 12Nadia Creignou, Miki Hermann. Complexity of Generalized Satisfiability Counting Problems
    13 -- 31David W. Juedes, Jack H. Lutz. Completeness and Weak Completeness Under Polynomial-Size Circuits
    32 -- 45Dora Giammarresi, Antonio Restivo, Sebastian Seibert, Wolfgang Thomas. Monadic Second-Order Logic Over Rectangular Pictures and Recognizability by Tiling Systems
    46 -- 51Yves Lafont, Andre Scedrov. The Undecidability of Second Order Multiplicative Linear Logic
    52 -- 61Judit Bar-Ilan, David Peleg. Scheduling Jobs Using Common Resources
    62 -- 69Orna Kupferman, Orna Grumberg. Branching-Time Temporal Logic and Tree Automata
    70 -- 76Ronald V. Book, Osamu Watanabe. On Random Hard Sets for NP
    runs on