3. LFCS 1994:
St. Petersburg,
Russia
Anil Nerode, Yuri Matiyasevich (Eds.):
Logical Foundations of Computer Science, Third International Symposium, LFCS'94, St. Petersburg, Russia, July 11-14, 1994, Proceedings.
Lecture Notes in Computer Science 813 Springer 1994, ISBN 3-540-58140-5 BibTeX
@proceedings{DBLP:conf/lfcs/1994,
editor = {Anil Nerode and
Yuri Matiyasevich},
title = {Logical Foundations of Computer Science, Third International
Symposium, LFCS'94, St. Petersburg, Russia, July 11-14, 1994,
Proceedings},
booktitle = {LFCS},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {813},
year = {1994},
isbn = {3-540-58140-5},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
- Farid M. Ablayev:
Lower Bounds for Probabilistic Space Complexity: Communication-Automata Approach.
1-7 BibTeX
- Henrik Reif Andersen:
On Model Checking Infinite-State Systems.
8-17 BibTeX
- Dmitry A. Archangelsky, Michael I. Dekhtyar, Evgeny Kruglov, Ilmir Kh. Musikaev, Mikhail A. Taitslin:
Concurrency Problem for Horn Fragment of Girard's Linear Logic.
18-22 BibTeX
- Sergei N. Artëmov, Vladimir Krupski:
Referential Data Structures and Labeled Modal Logic.
23-33 BibTeX
- Andrea Asperti, Giovanna M. Dore:
Yet Another Correctness Criterion for Multiplicative Linear Logic with MIX.
34-46 BibTeX
- Sergey Berezin, Nikolay V. Shilov:
An Approach to Effective Model-Checking of Real-Time Finite-State Machines in Mu-Calculus.
47-55 BibTeX
- Carolyn Brown, Alan Jeffrey:
Allegories of Circuits.
56-68 BibTeX
- Cheng-Chia Chen, I-Peng Lin:
The Complexity of Propositional Modal Theories and the Complexity of Consistency of Propositional Modal Theories.
69-80 BibTeX
- Alex Dekhtyar:
Multiplicative Linear Logic for Resource Transformation Nets.
81-88 BibTeX
- Michael T. Hallett, Harold T. Wareham:
The Parameterized Complexity of Some Problems in Logic and Linguistics.
89-100 BibTeX
- Didier Galmiche, Guy Perrier:
Foundations of Proof Search Strategies Design in Linear Logic.
101-113 BibTeX
- Xiaolin Ge, Anil Nerode:
On Extreme Points of Convex Compact Turing Located Set.
114-128 BibTeX
- Silvia Ghilezan:
Application of Typed Lambda Calculi in the Untyped Lambda Calculus.
129-139 BibTeX
- Sergei S. Goncharov, S. A. Badaev:
Classes with Pairwise Equivalent Enumerations.
140-141 BibTeX
- Philippe de Groote:
Strong Normalization in a Non-Deterministic Typed Lambda-Calculus.
142-152 BibTeX
- Bernhard Heinemann:
On Expressive Completeness of Modal Logic.
153-163 BibTeX
- Raymond Hoofman:
Comparing Models of the Non-Extensional Typed Lambda-Calculus.
164-172 BibTeX
- Bart Jacobs:
Coalgebras and Approximation.
173-183 BibTeX
- Max I. Kanovich:
Computational and Concurrency Models of Linear Logic.
184-190 BibTeX
- Zurab Khasidashvili:
The Longest Perpetual Reductions in Orthogonal Expression Reduction Systems.
191-203 BibTeX
- Bakhadyr Khoussainov, Anil Nerode:
The Notion of Rank and Games.
204-217 BibTeX
- Mikle Kuchuganov:
A Predicate Logic of Well-Founded Actions.
218-226 BibTeX
- Daniel Leivant:
Predicative Recurrence in Finite Types.
227-239 BibTeX
- Johann A. Makowsky, Y. B. Pnueli:
Arity vs. Alternation in Second Order Logic.
240-252 BibTeX
- Hanno Nickau:
Hereditarily Sequential Functionals.
253-264 BibTeX
- Ulrich Nitsche:
Propositional Linear Temporal Logic and Language Homomorphisms.
265-277 BibTeX
- Ramón Pino Pérez, Christian Even:
An Abstract Property of Confluence Applied to the Study of the Lazy Partial Lambda Calculus.
278-290 BibTeX
- Aida Pliuskeviciene, Regimantas Pliuskevicius, Michal Walicki, Sigurd Meldal:
On Specialization of Derivations in Axiomatic Equality Theories.
291-303 BibTeX
- Vladimir V. Rybakov:
Preserving of Admissible Inference Rules in Modal Logics.
304-315 BibTeX
- Paula Severi, Erik Poll:
Pure Type Systems with Definitions.
316-328 BibTeX
- Tatiana Sidon:
Craig Interpolation Property in Modal Logics with Provability Interpretation.
329-340 BibTeX
- Bonnie Traylor, Michael Gelfond:
Representing Null Values in Logic Programming.
341-352 BibTeX
- Steffen van Bakel, Luigi Liquori, Simona Ronchi Della Rocca, Pawel Urzyczyn:
Comparing Cubes.
353-365 BibTeX
- Wiebe van der Hoek, Bernd van Linder, John-Jules Ch. Meyer:
A Logic of Capabilities.
366-378 BibTeX
- Vincent van Oostrom, Femke van Raamsdonk:
Weak Orthogonality Implies Confluence: The Higher Order Case.
379-392 BibTeX
Copyright © Sat May 16 23:28:44 2009
by Michael Ley (ley@uni-trier.de)