Abstract is missing.
- Honest Polynomial-Time Degrees of Elementary Recursive SetsKlaus Ambos-Spies, Dongping Yang. 1-15
- On the Verification of ModulesGrigoris Antoniou, Volker Sperschneider. 16-35
- A Logical Operational Semantics of Full Prolog. Part I: Selection Core and ControlEgon Börger. 36-64
- Set-Theoretic Reductions of Hilbert s Tenth ProblemDomenico Cantone, Vincenzo Cutello, Alberto Policriti. 65-75
- The Complexity of Subtheories of the Existential Linear Theory of RealsElias Dahlhaus. 76-89
- On Test Classes for Universal TheoriesBernd I. Dahn. 90-97
- Generalizing Allowedness While Retaining Completeness of SLDNF-ResolutionHendrik Decker, Lawrence Cavedon. 98-115
- Effectively Given Information Systems and DomainsManfred Droste, Rüdiger Göbel. 116-142
- Davis-Putnam Resolution versus Unrestricted ResolutionAndreas Goerdt. 143-162
- On Logical Descriptions of Some Concepts in Structural Complexity TheoryErich Grädel. 163-175
- Algebraic Operational Semantics and OccamYuri Gurevich, Lawrence S. Moss. 176-192
- Propositional Provability and Models of Weak ArithmeticJan Krajícek, Pavel Pudlák. 193-210
- Polymorphic Recursion and Semi-UnificationHans Leiß. 211-224
- Deciding Horn Classes by HyperresolutionAlexander Leitsch. 225-241
- Omega-Branching Programs of Bounded WidthChristoph Meinel. 242-253
- A Predicate Calculus with Control of DerivationsDaniel Mey. 254-266
- Reducibility of Monotone Formulas to µ-FormulasDaniele Mundici. 267-270
- New Ways for Developing Proof Theories for First-Order Multi Modal LogicsHans Jürgen Ohlbach. 271-308
- On the Representation of Data in Lambda-CalculusMichel Parigot. 309-321
- A Streamlined Temporal Completeness TheoremAna Pasztor, Ildikó Sain. 322-336
- A Concurrent Branching Time Temporal LogicWojciech Penczek. 337-354
- Semantic for Abstract Fairness using Metric SpacesLutz Priese, Doris Nolte. 355-368
- On the Average Time Complexity of Set PartitioningEwald Speckenmeyer, Rainer Kemp. 369-381
- A Direct Proof for the Completeness of SLD-ResolutionRobert F. Stärk. 382-383
- A Quantifier-Free Completion of Logic ProgramsRobert F. Stärk. 384-395
- Stratification of Definite Clause Programs and of General Logic ProgramsOlga Stepánková, Petr Stepánek. 396-408
- The Semantics of Disjunctive Deductive DatabasesHugo Volger. 409-421
- Sequential Representation of Primitive Recursive Functions, and Complexity ClassesElisabeth Wette. 422-437