Abstract is missing.
- The Mathematics of Set Predicates in PrologEgon Börger, Dean Rosenzweig. 1-13
- Some Connections Between Set Theory and Computer ScienceRobert Cowen. 14-22
- Gödel s Dialectica Interpretation and Its Two-Way StretchSolomon Feferman. 23-40
- Epistemic Entrenchment and Arthmetical Hierarchy (Abstract)Petr Hájek. 41-42
- A Critical Reexamination of Default Logic, Autoepistemic Logic, and Only KnowingJoseph Y. Halpern. 43-60
- Complexity Issues in Nonmonotonic Logic and Logic Programming (Abstract)V. Wiktor Marek. 61
- Strategies for Resolution Method in Non-classical Logics (Abstract)Grigori Mints. 62
- Undecidability of Implication Problems in Logic Programming, Database Theory and Classical LogicLeszek Pacholski. 63-68
- Building up a Tool-Box for Matrin-Löf s Type Theory (Abstract)Giovanni Sambin, Silvio Valentini. 69-70
- The Logic of the Gödel Proof PredicateSergei N. Artëmov, Tyko Straßen. 71-82
- Superposition with Simplification as a Desision Procedure for the Monadic Class with EqualityLeo Bachmair, Harald Ganzinger, Uwe Waldmann. 83-96
- Computation with Access to the Reals, but Using only Classical MachinesN. P. Bamber. 97-107
- The Even More Liberalized delta-Rule in Free Variable Semantic TableauxBernhard Beckert, Reiner Hähnle, Peter H. Schmitt. 108-119
- Differentiating Assumptions from Extra-Logical Axioms in Natural DeductionMario R. F. Benevides. 120-131
- The Inverse of Fitting s FunctionalAlberto Bottoni, Giorgio Levi. 132-143
- On Loop Detection in Connection CalculiStefan Brüning. 144-151
- On Arnold s Hilbert Symposium ProblemsNewton C. A. da Costa, Francisco A. Doria. 152-158
- The Structure of Exponentials: Uncovering the Dynamics of Linear Logic ProofsVincent Danos, Jean-Baptiste Joinet, Harold Schellinx. 159-171
- On Different Concepts of Function IntroductionUwe Egly. 172-183
- Double Exponential Inseparability Of Robinson Subsystem Q+ From The Unsatisfiable Sentences In The Language Of AdditionGiovanni Faglia. 184-186
- In The Meaning Of Essentially Unprovable Theorems In The Presburger Theory Of AdditionGiovanni Faglia, Paul Young. 187-189
- A Syntactic Consistency Proof for NaDSetPaul C. Gilmore. 190-201
- A Rule-based Algorithm for Rigid E-UnificationJean Goubault. 202-210
- A Scheme for Weakened Negative Introspection in Autoepistemic ReasoningTomi Janhunen, Ilkka Niemelä. 211-222
- On the Weakness of Sharply Bounded Polynomial InductionJan Johannsen. 223-230
- On the Logic of HypergraphsAdam Kolany. 231-242
- Recursion Theoretic Properties of Frequency Computation and Bounded Queries (Extended Abstract)Martin Kummer, Frank Stephan. 243-254
- Interpreting True Arithmetic in Degree StructuresAndré Nies. 255-262
- Classical Proofs as ProgramsMichel Parigot. 263-276
- Completeness of the Pool Calculus with an Open Built-in TheoryUwe Petermann. 277-288
- On the Saturation Principle for a Linear Temporal LogicRegimantas Pliuskevicius. 289-300
- A Construction of Typed Lambda Models Related to Feasible ComputabilityVladimir Yu. Sazonov, Andrei Voronkov. 301-312
- Nonmonotonic Reasoning is Sometimes SimplerGrigori Schwarz, Miroslaw Truszczynski. 313-324
- Self-Verifying Axiom SystemsDan E. Willard. 325-336
- Committed-Choice Concurrent Logic Programming in Linear LogicJirí Zlatuska. 337-348