Abstract is missing.
- Topological Semantics for Hybrid SystemsSergei N. Artëmov, Jennifer M. Davoren, Anil Nerode. 1-8
- Domain-Free Pure Type SystemsGilles Barthe, Morten Heine Sørensen. 9-20
- Generic Queries over Quasy-o-minimal DomainsOleg V. Belegradek, Alexei P. Stolboushkin, Michael A. Taitslin. 21-32
- Towards Computing Distances Between Programs via Scott DomainsMichael A. Bukatin, Joshua S. Scott. 33-43
- A Safe Recursion Scheme for Exponential TimePeter Clote. 44-52
- Finite Model Theory, Universal Algebra and Graph GrammarsBruno Courcelle. 53-55
- Complexity of Query Answering in Logic Databases with Complex ValuesEvgeny Dantsin, Andrei Voronkov. 56-66
- Recognition of Deductive Data Base StabilityMichael I. Dekhtyar, Alexander Ja. Dikovsky. 67-77
- The Concurrency Complexity for the Horn Fragment of Linear LogicSergey Dudakov. 78-87
- Studying Algorithmic Problems for Free Semi-groups and GroupsValery Durnev. 88-101
- Learning Small Programs with Additional InformationRusins Freivalds, Gints Tervits, Rolf Wiehagen, Carl H. Smith. 102-112
- Cut Elimination for the Second Order Propositional Logic with Hilbert s epsilon-symbol, Extensionality, and Full ComprehensionMichael Gavrilovich. 113-118
- Finite Bases of Admissible Rules for the Logic S52CMikhail Golovanov. 119-129
- An Algebraic Correctness Criterion for Intuitionistic Proof-NetsPhilippe de Groote. 130-140
- Towards a Theory of Recursive Structures (extended abstract)David Harel. 141-144
- On the Complexity of Prefix Formulas in Modal Logic of Subset SpacesBernhard Heinemann. 145-155
- The Undecidability of Second Order Linear Affine LogicAlexey P. Kopylov. 156-166
- Operational Logic of Proofs with Functionality Condition on Proof PredicateVladimir Krupski. 167-177
- On Linear Ordering of Strongly Extensional Finitely-Branching Graphs and Non-well-founded SetsAlexei Lisitsa, Vladimir Yu. Sazonov. 178-188
- Functions for the General Solution of Parametric Word EquationsG. S. Makanin, Habib Abdulrab, Pavel Goralcik. 189-202
- A Proof Procedure for Hereditary Harrop Formulas with Free EqualityEvgeny Makarov. 203-213
- Basic Forward Chaining Construction for Logic ProgramsV. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel. 214-225
- Decidability and Undecidability of the Halting Problem on Turing Machines, a SurveyMaurice Margenstern. 226-236
- Case Study: Additive Linear Logic and LatticesJean-Yves Marion. 237-247
- Some Decision Problems for TracesYuri Matiyasevich. 248-257
- Existential Instantiation and Strong NormalizationGrigori Mints. 258-265
- Models for the Logic of ProofsAlexey Mkrtychev. 266-275
- Interpretation of the Full Computation Tree Logic CTL* on Sets of Infinite SequencesUlrich Nitsche. 276-282
- Type Introduction for Equational RewritingHitoshi Ohsaki, Aart Middeldorp. 283-293
- Capturing Bisimulation-Invariant PtimeMartin Otto. 294-305
- Equivalence of Multiplicative Fragments of Cyclic Linear Logic and Noncommutative Linear LogicMati Pentus. 306-311
- A Decidable Fragment of Second Order Linear LogicGuy Perrier. 312-322
- Some Results on Propositional Dynamic Logic with Fixed PointsIgor Rents, Nikolay V. Shilov. 323-332
- Quasi-Characteristic Inference Rules for Modal LogicsVladimir V. Rybakov. 333-341
- Provability Logic with Operations on ProofsTatiana Sidon. 342-353
- Formal Verification of Logic Programs: Foundations and ImplementationRobert F. Stärk. 354-368
- Unification of Terms with Term-Indexed VariablesIgor L. Tandetnik. 369-373
- Back-Forth Equivalences for Design of Concurrent SystemsIgor V. Tarasyuk. 374-384
- Association Nets: an Alternative Formalization of Common ThinkingGregory S. Tseytin. 385-398
- Simulating eta-expansions with beta-reductions in the Second-Order Polymorphic lambda-calculusHongwei Xi. 399-409
- Logical Schemes for First-Order TheoriesRostislav E. Yavorsky. 410-418
- Verification of PLTL Formulae by Means of Monotone Disjunctive Normal FormsVladimir A. Zakharov. 419-429