Abstract is missing.
- Subtyping with Singleton TypesDavid Aspinall. 1-15
- A Subtyping for the Fisher-Honsell-Mitchell Lambda Calculus of ObjectsViviana Bono, Luigi Liquori. 16-30
- The Girard Translation Extended with RecursionTorben Braüner. 31-45
- Decidability of Higher-Order Subtyping with Intersection TypesAdriana B. Compagnoni. 46-60
- A Lambda-Calculus Structure Isomorphic to Gentzen-Style Sequent Calculus StructureHugo Herbelin. 61-75
- Usability: Formalising (Un)definedness in Typed Lambda CalculusJan Kuper. 76-90
- Lambda Representation of Operations Between Fifferent Term AlgebrasMarek Zaionc. 91-105
- Semi-Unification and Generalizations of a Particularly Simple FormMatthias Baaz, Gernot Salzer. 106-120
- A Mixed Linear and Non-Linear Logic: Proofs, Terms and Models (Extended Abstract)P. N. Benton. 121-135
- Cut Free Formalization of Logic with Finitely Many Variables. Part ILew Gordeev. 136-150
- How to Lie Without Being (Easily) Convicted and the Length of Proofs in Propositional CalculusPavel Pudlák, Samuel R. Buss. 151-162
- Monadic Second-Order Logic and Linear Orderings of Finite StructuresBruno Courcelle. 163-176
- First-Order Spectra with One Binary PredicateArnaud Durand, Solomampionona Ranaivoson. 177-189
- Monadic Logical Definability of NP-Complete ProblemsEtienne Grandjean, Frédéric Olive. 190-204
- Logics For Context-Free LanguagesClemens Lautemann, Thomas Schwentick, Denis Thérien. 205-216
- Log-Approximable Minimization Problems on Random InputsAnders Malmström. 217-227
- Convergence and 0-1 Laws for L_inf, omega^k under Arbitrary MeasuresMonica McArthur. 228-241
- Is First Order Contained in an Initial Segment of PTIME?Alexei P. Stolboushkin, Michael A. Taitslin. 242-248
- Logic Programming in Tau CategoriesStacy E. Finkelstein, Peter J. Freyd, James Lipton. 249-263
- Reasoning and Rewriting with Set-Relations I: Ground CompletenessValentinas Kriauciukas, Michal Walicki. 264-278
- Resolution Games and Non-Liftable Resolution OrderingsHans de Nivelle. 279-293
- On Existential Theories of List ConcatenationKlaus U. Schulz. 294-308
- Completeness of Resolution for Definite Answers with Case AnalysisTanel Tammet. 309-323
- Subrecursion as a Basis for a Feasible Programming LanguagePaul J. Voda. 324-338
- A Sound Metalogical Semantics for Input/Output EffectsRoy L. Crole, Andrew D. Gordon. 339-353
- An Intuitionistic Modal Logic with Applications to the Formal Verification of HardwareMatt Fairtlough, Michael Mendler. 354-368
- Towards Machine-Checked Compiler Correctness for Higher-order Pure Functional LanguagesDavid Lester, Sava Mintchev. 369-381
- Powerdomains, Powerstructures and FairnessYiannis N. Moschovakis, Glen T. Whitney. 382-396
- Canonical Forms for Data-SpecificationsFrank Piessens, Eric Steegmans. 397-411
- An Algebraic View of Structural InductionClaudio Hermida, Bart Jacobs. 412-426
- On the Interpretation of Type Theory in Locally Cartesian Closed CategoriesMartin Hofmann. 427-441
- Algorithmic Aspects of Propositional Tense LogicsAlexander V. Chagrov, Valentin B. Shehtman. 442-455
- Stratified Default TheoriesPawel Cholewinski. 456-470
- A Homomorphism Concepts for omega-RegularityNils Klarlund. 471-485
- Ramified Recurrence and Computational Complexity II: Substitution and Poly-SpaceDaniel Leivant, Jean-Yves Marion. 486-500
- General Form Recursive Equations IHrant B. Marandjian. 501-511
- Modal Logics Preserving Admissible for S4 Inference RulesVladimir V. Rybakov. 512-526
- A Bounded Set Theory with Anti-Foundation Axiom and Inductive DefinabilityVladimir Yu. Sazonov. 527-541