Abstract is missing.
- Modular Linear LogicDmitry A. Archangelsky, Mikhail A. Taitslin. 1-8
- Machine Learning of Higher Order ProgramsGanesh Baliga, John Case, Sanjay Jain, Mandayam Suraj. 9-20
- Quantifying the Amount of VerbosenessRichard Beigel, Martin Kummer, Frank Stephan. 21-32
- Strictness Logic and Polymorphic InvarianceP. N. Benton. 33-44
- Preference Logics and Non-Monotonicity in Logic ProgrammingAllen L. Brown Jr., Surya Mantha, Toshiro Wakayama. 45-56
- The Ehrenfeucht-Fraisse Games for Transitive ClosureA. Calò, Johann A. Makowsky. 57-68
- Feasibility of Finite and Infinite Paths in Data Dependent ProgramsKarlis Cerans. 69-80
- An Interleaving Model for Real-Time SystemsLiang Chen. 81-92
- A Logical Characterization of Asynchronously Communicating AgentsSøren Christensen. 93-104
- Denotations for Classical Proofs - Preliminary ResultsPhilippe de Groote. 105-116
- Ordinal Arithmetic with List StructuresNachum Dershowitz, Edward M. Reingold. 117-126
- Continuous I-CategoriesAbbas Edalat. 127-138
- Many-Valued Non-Monotonic Modal LogicsMelvin Fitting. 139-150
- Automated Deduction in Additive and Multiplicative Linear LogicDidier Galmiche, Guy Perrier. 151-162
- Intensionally Stable FunctionsB. Gamatie. 163-173
- A Constructive Proof that Trees Are Well-Quasi-Ordered Under MinorsArvind Gupta. 174-185
- Banishing Robust Turing CompletenessLane A. Hemachandra, Sanjay Jain, Nikolai K. Vereshchagin. 186-197
- Balanced Formulas, BCK-Minimal Formulas and Their ProofsSachio Hirokawa. 198-208
- Non-Stable Models of Linear LogicRaymond Hoofman. 209-220
- Ordering Optimizations for Concurrent Logic ProgramsAndy King, Paul Soper. 221-228
- A Categorical Interpretation of Partial Function Logic and Hoare LogicPeter M. W. Knijnenburg, Frank Nordemann. 229-240
- The Polynominal Complexity of Conjunctive Normal Form Satisfiability, when the Number of Conjunctions and Negations is LimitedNikolai K. Kossovsky, A. B. Prokhoroff. 241-245
- Typed lamda-Calculus with Recursive DefinitionsSergey V. Kotov. 246-257
- Set Theoretic Foundations for Fuzzy Set Theory, and Their ApplicationsKevin Lano. 258-268
- Constructive Specifications of Abstract Data Types Using Temporal LogicFrank Lesske. 269-280
- An Interval-Based Modal Logic for System SpecificationRenwei Li, José Carmo. 281-292
- A Unifying Theory of Dependent Types: The Schematic ApproachZhaohui Luo. 293-304
- MSL - A Mathematical Specification LanguageV. P. Makarov. 305-313
- Partial Algebra + Order-Sorted Algebra = Galactic AlgebraAristide Mégrelis. 314-325
- Minimal Negation and Hereditary Harrop FormulaeAlberto Momigliano. 326-335
- Kleene Automata and Recursion TheoryJohn Mullins. 336-346
- Incremental Polymorphic Type Checking with UpdateAlan Mycroft. 347-357
- Operators on Lattices of omega-Herbrand InterpretationsJan A. Plaza. 358-369
- Sequential Calculus for Proving the Properties of Regular ProgramsAida Pliuskeviciene. 370-381
- Complete Sequential Calculi for the First Order Symmetrical Linear Temporal Logic with Until and SinceRegimantas Pliuskevicius. 382-393
- Non Modularity and Expressibility for Nets of RelationsAlexander Moshe Rabinovich. 394-405
- Correctness of Generic ModulesWolfgang Reif. 406-417
- An And-Parallelism Cooperative Scheme for Full Prolog Interpreters on a Transputer-Based ArchitectureKamel Sadi, François Meunier. 418-429
- A Sequent Calculus for a First Order Linear Temporal Logic with EqualityJurate Sakalauskaite. 430-440
- On the Expressive Power of Modal Logics on TreesBernd-Holger Schlingloff. 441-451
- Propositional Dynamic Logic with Fixed Points: Algorithmic Tools for Verification of Finite State MachinesNikolay V. Shilov. 452-458
- Effective Operators and Continuity RevisitedDieter Spreen. 459-469
- Logical Characterizations of Bounded Query Classes I: Logspace Oracle MachinesIain A. Stewart. 470-479
- Solving Equational Constraints in Polymorphic TypesJerzy Tiuryn. 480-492
- Gentzen-Style and Novikov-Style Cut-EliminationSergei Tupailo. 493-502
- Graded Modalities in Epistemic LogicWiebe van der Hoek, John-Jules Ch. Meyer. 503-514