4. LFCS 1997:
Yaroslavl,
Russia
Sergei I. Adian, Anil Nerode (Eds.):
Logical Foundations of Computer Science, 4th International Symposium, LFCS'97, Yaroslavl, Russia, July 6-12, 1997, Proceedings.
Lecture Notes in Computer Science 1234 Springer 1997, ISBN 3-540-63045-7 BibTeX
- Sergei N. Artëmov, Jennifer M. Davoren, Anil Nerode:
Topological Semantics for Hybrid Systems.
1-8 BibTeX
- Gilles Barthe, Morten Heine Sørensen:
Domain-Free Pure Type Systems.
9-20 BibTeX
- Oleg V. Belegradek, Alexei P. Stolboushkin, Michael A. Taitslin:
Generic Queries over Quasy-o-minimal Domains.
21-32 BibTeX
- Michael A. Bukatin, Joshua S. Scott:
Towards Computing Distances Between Programs via Scott Domains.
33-43 BibTeX
- Peter Clote:
A Safe Recursion Scheme for Exponential Time.
44-52 BibTeX
- Bruno Courcelle:
Finite Model Theory, Universal Algebra and Graph Grammars.
53-55 BibTeX
- Evgeny Dantsin, Andrei Voronkov:
Complexity of Query Answering in Logic Databases with Complex Values.
56-66 BibTeX
- Michael I. Dekhtyar, Alexander Ja. Dikovsky:
Recognition of Deductive Data Base Stability.
67-77 BibTeX
- Sergey Dudakov:
The Concurrency Complexity for the Horn Fragment of Linear Logic.
78-87 BibTeX
- Valery Durnev:
Studying Algorithmic Problems for Free Semi-groups and Groups.
88-101 BibTeX
- Rusins Freivalds, Gints Tervits, Rolf Wiehagen, Carl H. Smith:
Learning Small Programs with Additional Information.
102-112 BibTeX
- Michael Gavrilovich:
Cut Elimination for the Second Order Propositional Logic with Hilbert's epsilon-symbol, Extensionality, and Full Comprehension.
113-118 BibTeX
- Mikhail Golovanov:
Finite Bases of Admissible Rules for the Logic S52C.
119-129 BibTeX
- Philippe de Groote:
An Algebraic Correctness Criterion for Intuitionistic Proof-Nets.
130-140 BibTeX
- David Harel:
Towards a Theory of Recursive Structures (extended abstract).
141-144 BibTeX
- Bernhard Heinemann:
On the Complexity of Prefix Formulas in Modal Logic of Subset Spaces.
145-155 BibTeX
- Alexey P. Kopylov:
The Undecidability of Second Order Linear Affine Logic.
156-166 BibTeX
- Vladimir Krupski:
Operational Logic of Proofs with Functionality Condition on Proof Predicate.
167-177 BibTeX
- Alexei Lisitsa, Vladimir Yu. Sazonov:
On Linear Ordering of Strongly Extensional Finitely-Branching Graphs and Non-well-founded Sets.
178-188 BibTeX
- G. S. Makanin, Habib Abdulrab, Pavel Goralcik:
Functions for the General Solution of Parametric Word Equations.
189-202 BibTeX
- Evgeny Makarov:
A Proof Procedure for Hereditary Harrop Formulas with Free Equality.
203-213 BibTeX
- V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel:
Basic Forward Chaining Construction for Logic Programs.
214-225 BibTeX
- Maurice Margenstern:
Decidability and Undecidability of the Halting Problem on Turing Machines, a Survey.
226-236 BibTeX
- Jean-Yves Marion:
Case Study: Additive Linear Logic and Lattices.
237-247 BibTeX
- Yuri Matiyasevich:
Some Decision Problems for Traces.
248-257 BibTeX
- Grigori Mints:
Existential Instantiation and Strong Normalization.
258-265 BibTeX
- Alexey Mkrtychev:
Models for the Logic of Proofs.
266-275 BibTeX
- Ulrich Nitsche:
Interpretation of the Full Computation Tree Logic CTL* on Sets of Infinite Sequences.
276-282 BibTeX
- Hitoshi Ohsaki, Aart Middeldorp:
Type Introduction for Equational Rewriting.
283-293 BibTeX
- Martin Otto:
Capturing Bisimulation-Invariant Ptime.
294-305 BibTeX
- Mati Pentus:
Equivalence of Multiplicative Fragments of Cyclic Linear Logic and Noncommutative Linear Logic.
306-311 BibTeX
- Guy Perrier:
A Decidable Fragment of Second Order Linear Logic.
312-322 BibTeX
- Igor Rents, Nikolay V. Shilov:
Some Results on Propositional Dynamic Logic with Fixed Points.
323-332 BibTeX
- Vladimir V. Rybakov:
Quasi-Characteristic Inference Rules for Modal Logics.
333-341 BibTeX
- Tatiana Sidon:
Provability Logic with Operations on Proofs.
342-353 BibTeX
- Robert F. Stärk:
Formal Verification of Logic Programs: Foundations and Implementation.
354-368 BibTeX
- Igor L. Tandetnik:
Unification of Terms with Term-Indexed Variables.
369-373 BibTeX
- Igor V. Tarasyuk:
Back-Forth Equivalences for Design of Concurrent Systems.
374-384 BibTeX
- Gregory S. Tseytin:
Association Nets: an Alternative Formalization of Common Thinking.
385-398 BibTeX
- Hongwei Xi:
Simulating eta-expansions with beta-reductions in the Second-Order Polymorphic lambda-calculus.
399-409 BibTeX
- Rostislav E. Yavorsky:
Logical Schemes for First-Order Theories.
410-418 BibTeX
- Vladimir A. Zakharov:
Verification of PLTL Formulae by Means of Monotone Disjunctive Normal Forms.
419-429 BibTeX
Acknowledgement:
the information on this page was provided by Andrei Voronkov
Copyright © Sat May 16 23:28:44 2009
by Michael Ley (ley@uni-trier.de)
