Abstract is missing.
- Trakhtenbrot Theorem and Fuzzy LogicPetr Hájek. 1-8
- Descriptive Complexity, Lower Bounds and Linear TimeThomas Schwentick. 9-28
- Testing for Finite State SystemsMihalis Yannakakis, David Lee. 29-44
- On the Power of Quantifers in First-Order Algebraic SpecificationDavid Kempe, Arno Schöegge. 45-57
- On the Effective Semantics of Nondeterministic, Nonmonotonic, Temporal Logic DatabasesFosca Giannotti, Giuseppe Manco, Mirco Nanni, Dino Pedreschi. 58-72
- Revision Programming = Logic Programming + Integrity ConstraintsV. Wiktor Marek, Inna Pivkina, Miroslaw Truszczynski. 73-89
- Quantifers and the System KE: Some Surprising ResultsUwe Egly. 90-104
- Choice Construct and Lindström LogicsH. Khanh Hoang. 105-125
- Monadic NP and Graph MinorsMartin Kreidler, Detlef Seese. 126-141
- Invariant Definability and P/::::poly::::Johann A. Makowsky. 142-158
- Computational Complexity of Ehrenfeucht-Fraïssé Games on Finite StructuresElena Pezzoli. 159-170
- An Upper Bound for Minimal Resolution RefutationsHans Kleine Büning. 171-178
- On an Optimal Deterministic Algorithm for SATZenon Sadowski. 179-187
- Characteristic Properties of Majorant-Computability over the RealsMargarita V. Korovina, Oleg V. Kudinov. 188-203
- Theorems af Péter and Parsons in Computer ProgrammingJán Komara, Paul J. Voda. 204-223
- Belnap, Urquhart and Relevant Decidability & Complexity. Das ist nicht Mathematik, das ist Theologie. Jaques Riche, Robert K. Meyer. 224-240
- Existence and Uniqueness of Normal Forms in Pure Type Systems with betaeta-ConversionGilles Barthe. 241-259
- Normalization of Typable Terms by SuperdevelopmentsZurab Khasidashvili, Adolfo Piperno. 260-282
- Subtyping Functional+Nonempty Record TypesSergei G. Vorobyov. 283-297
- Monotone Fixed-Point Types and Strong NormalizationRalph Matthes. 298-312
- Morphisms and Partitions of V-setsRichard Statman. 313-322
- Computational Adequacy in an Elementary ToposAlex K. Simpson. 323-342
- Logical Relations and Inductive/Coinductive TypesThorsten Altenkirch. 343-354
- On the Complexity of H-SubsumptionReinhard Pichler. 355-371
- Complexity Classes and Rewrite Systems with Polynomial InterpretationGuillaume Bonfante, Adam Cichon, Jean-Yves Marion, Hélène Touzet. 372-384
- RPO Constraint Solving Is in NPPaliath Narendran, Michaël Rusinowitch, Rakesh M. Verma. 385-398
- Quantifier Elimination in Fuzzy LogicMatthias Baaz, Helmut Veith. 399-414
- Many-Valued First-Order Logics with Probabilistic SemanticsThomas Lukasiewicz. 415-429