Abstract is missing.
- A Universal Turing MachineStål Aanderaa. 1-4
- Recursive Inseparability in Linear LogicStål Aanderaa, Herman Ruge Jervell. 5-13
- The Basic Logic of ProofsSergei N. Artëmov, Tyko Straßen. 14-28
- Algorithmic Structuring of Cut-free ProofsMatthias Baaz, Richard Zach. 29-42
- Optimization Problems: Expressibility, Approximation Properties and Expected Asymptotic Growth of Optimal SolutionsThomas Behrendt, Kevin J. Compton, Erich Grädel. 43-60
- Linear Lambda-Calculus and Categorial Models RevisitedP. N. Benton, Gavin M. Bierman, Valeria de Paiva, Martin Hyland. 61-84
- A Self-Interpreter of Lambda Calculus Having a Normal FormAlessandro Berarducci, Corrado Böhm. 85-99
- An Ehrenfeucht-Fraïssé Game for Fixpoint Logic and Stratified Fixpoint LogicUwe Bosse. 100-114
- The Class of Problems that are Linear Equivalent to Satisfiability or a Uniform Method for Proving NP-CompletenessNadia Creignou. 115-133
- Model Building by ResolutionChristian G. Fermüller, Alexander Leitsch. 134-148
- Comparative Transition System SemanticsTim Fernando. 149-166
- Reasoning with Higher Order Partial FunctionsAntonio Gavilanes-Franco, Francisca Lucio-Carrasco, Mario Rodríguez-Artalejo. 167-181
- Communicating Evolving AlgebrasPaola Glavan, Dean Rosenzweig. 182-215
- On the Completeness of Narrowing as the Operational Semantics of Functional Logic ProgrammingJuan Carlos González Moreno, Maria Teresa Hortalá-González, Mario Rodríguez-Artalejo. 216-230
- Inductive Definability with Counting on Finite StructuresErich Grädel, Martin Otto. 231-247
- Linear Time Algorithms and NP-Complete ProblemsEtienne Grandjean. 248-273
- The Semantics of the C Programming LanguageYuri Gurevich, James K. Huggins. 274-308
- A Theory of Classes for a Functional Language with EffectsFurio Honsell, Ian A. Mason, Scott F. Smith, Carolyn L. Talcott. 309-326
- Logical Definability of NP-Optimization Problems with Monadic Auxiliary PredicatesClemens Lautemann. 327-339
- Universes in the Theory of Types and NamesMarkus Marzetta. 340-351
- Notes on Sconing and RelatorsJohn C. Mitchell, Andre Scedrov. 352-378
- Solving 3-Satisfiability in Less Then 1, 579:::n::: StepsIngo Schiermeyer. 379-394
- Kleene s Slash and Existence of Values of Open Terms in Type TheoryJan M. Smith. 395-402
- Negation-Complete Logic ProgramsRobert F. Stärk. 403-409
- Logical Characterization of Bounded Query Classes II: Polynomial-Time Oracle MachinesIain A. Stewart. 410-424
- On Asymptotic Probabilities of Monadic Second Order PropertiesJerzy Tyszkiewicz. 425-439