Abstract is missing.
- Lower Bounds for Probabilistic Space Complexity: Communication-Automata ApproachFarid M. Ablayev. 1-7
- On Model Checking Infinite-State SystemsHenrik Reif Andersen. 8-17
- Concurrency Problem for Horn Fragment of Girard s Linear LogicDmitry A. Archangelsky, Michael I. Dekhtyar, Evgeny Kruglov, Ilmir Kh. Musikaev, Mikhail A. Taitslin. 18-22
- Referential Data Structures and Labeled Modal LogicSergei N. Artëmov, Vladimir Krupski. 23-33
- Yet Another Correctness Criterion for Multiplicative Linear Logic with MIXAndrea Asperti, Giovanna M. Dore. 34-46
- An Approach to Effective Model-Checking of Real-Time Finite-State Machines in Mu-CalculusSergey Berezin, Nikolay V. Shilov. 47-55
- Allegories of CircuitsCarolyn Brown, Alan Jeffrey. 56-68
- The Complexity of Propositional Modal Theories and the Complexity of Consistency of Propositional Modal TheoriesCheng-Chia Chen, I-Peng Lin. 69-80
- Multiplicative Linear Logic for Resource Transformation NetsAlex Dekhtyar. 81-88
- The Parameterized Complexity of Some Problems in Logic and LinguisticsMichael T. Hallett, Harold T. Wareham. 89-100
- Foundations of Proof Search Strategies Design in Linear LogicDidier Galmiche, Guy Perrier. 101-113
- On Extreme Points of Convex Compact Turing Located SetXiaolin Ge, Anil Nerode. 114-128
- Application of Typed Lambda Calculi in the Untyped Lambda CalculusSilvia Ghilezan. 129-139
- Classes with Pairwise Equivalent EnumerationsSergei S. Goncharov, S. A. Badaev. 140-141
- Strong Normalization in a Non-Deterministic Typed Lambda-CalculusPhilippe de Groote. 142-152
- On Expressive Completeness of Modal LogicBernhard Heinemann. 153-163
- Comparing Models of the Non-Extensional Typed Lambda-CalculusRaymond Hoofman. 164-172
- Coalgebras and ApproximationBart Jacobs. 173-183
- Computational and Concurrency Models of Linear LogicMax I. Kanovich. 184-190
- The Longest Perpetual Reductions in Orthogonal Expression Reduction SystemsZurab Khasidashvili. 191-203
- The Notion of Rank and GamesBakhadyr Khoussainov, Anil Nerode. 204-217
- A Predicate Logic of Well-Founded ActionsMikle Kuchuganov. 218-226
- Predicative Recurrence in Finite TypesDaniel Leivant. 227-239
- Arity vs. Alternation in Second Order LogicJohann A. Makowsky, Y. B. Pnueli. 240-252
- Hereditarily Sequential FunctionalsHanno Nickau. 253-264
- Propositional Linear Temporal Logic and Language HomomorphismsUlrich Nitsche. 265-277
- An Abstract Property of Confluence Applied to the Study of the Lazy Partial Lambda CalculusRamón Pino Pérez, Christian Even. 278-290
- On Specialization of Derivations in Axiomatic Equality TheoriesAida Pliuskeviciene, Regimantas Pliuskevicius, Michal Walicki, Sigurd Meldal. 291-303
- Preserving of Admissible Inference Rules in Modal LogicsVladimir V. Rybakov. 304-315
- Pure Type Systems with DefinitionsPaula Severi, Erik Poll. 316-328
- Craig Interpolation Property in Modal Logics with Provability InterpretationTatiana Sidon. 329-340
- Representing Null Values in Logic ProgrammingBonnie Traylor, Michael Gelfond. 341-352
- Comparing CubesSteffen van Bakel, Luigi Liquori, Simona Ronchi Della Rocca, Pawel Urzyczyn. 353-365
- A Logic of CapabilitiesWiebe van der Hoek, Bernd van Linder, John-Jules Ch. Meyer. 366-378
- Weak Orthogonality Implies Confluence: The Higher Order CaseVincent van Oostrom, Femke van Raamsdonk. 379-392