


default search action
3rd LFCS 1994: St. Petersburg, Russia
- Anil Nerode, Yuri V. Matiyasevich:

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 - Farid M. Ablayev:

Lower Bounds for Probabilistic Space Complexity: Communication-Automata Approach. 1-7 - Henrik Reif Andersen:

On Model Checking Infinite-State Systems. 8-17 - 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 - Sergei N. Artëmov, Vladimir Krupski:

Referential Data Structures and Labeled Modal Logic. 23-33 - Andrea Asperti

, Giovanna M. Dore:
Yet Another Correctness Criterion for Multiplicative Linear Logic with MIX. 34-46 - Sergey Berezin, Nikolay V. Shilov

:
An Approach to Effective Model-Checking of Real-Time Finite-State Machines in Mu-Calculus. 47-55 - Carolyn Brown, Alan Jeffrey:

Allegories of Circuits. 56-68 - Cheng-Chia Chen, I-Peng Lin:

The Complexity of Propositional Modal Theories and the Complexity of Consistency of Propositional Modal Theories. 69-80 - Alex Dekhtyar:

Multiplicative Linear Logic for Resource Transformation Nets. 81-88 - Bruce M. Kapron

, Michael R. Fellows, Rodney G. Downey, Michael T. Hallett
, Harold T. Wareham:
The Parameterized Complexity of Some Problems in Logic and Linguistics. 89-100 - Didier Galmiche, Guy Perrier:

Foundations of Proof Search Strategies Design in Linear Logic. 101-113 - Xiaolin Ge, Anil Nerode:

On Extreme Points of Convex Compact Turing Located Set. 114-128 - Silvia Ghilezan:

Application of Typed Lambda Calculi in the Untyped Lambda Calculus. 129-139 - Sergei S. Goncharov, Serikzhan A. Badaev:

Classes with Pairwise Equivalent Enumerations. 140-141 - Philippe de Groote:

Strong Normalization in a Non-Deterministic Typed Lambda-Calculus. 142-152 - Bernhard Heinemann:

On Expressive Completeness of Modal Logic. 153-163 - Raymond Hoofman:

Comparing Models of the Non-Extensional Typed Lambda-Calculus. 164-172 - Bart Jacobs:

Coalgebras and Approximation. 173-183 - Max I. Kanovich:

Computational and Concurrency Models of Linear Logic. 184-190 - Zurab Khasidashvili:

The Longest Perpetual Reductions in Orthogonal Expression Reduction Systems. 191-203 - Bakhadyr Khoussainov, Anil Nerode:

The Notion of Rank and Games. 204-217 - Mikle Kuchuganov:

A Predicate Logic of Well-Founded Actions. 218-226 - Daniel Leivant:

Predicative Recurrence in Finite Types. 227-239 - Johann A. Makowsky, Y. B. Pnueli:

Arity vs. Alternation in Second Order Logic. 240-252 - Hanno Nickau:

Hereditarily Sequential Functionals. 253-264 - Ulrich Nitsche:

Propositional Linear Temporal Logic and Language Homomorphisms. 265-277 - Ramón Pino Pérez, Christian Even:

An Abstract Property of Confluence Applied to the Study of the Lazy Partial Lambda Calculus. 278-290 - Aida Pliuskeviciene, Regimantas Pliuskevicius, Michal Walicki, Sigurd Meldal:

On Specialization of Derivations in Axiomatic Equality Theories. 291-303 - Vladimir V. Rybakov:

Preserving of Admissible Inference Rules in Modal Logics. 304-315 - Paula Severi, Erik Poll:

Pure Type Systems with Definitions. 316-328 - Tatiana Sidon:

Craig Interpolation Property in Modal Logics with Provability Interpretation. 329-340 - Bonnie Traylor, Michael Gelfond:

Representing Null Values in Logic Programming. 341-352 - Steffen van Bakel, Luigi Liquori, Simona Ronchi Della Rocca, Pawel Urzyczyn:

Comparing Cubes. 353-365 - Wiebe van der Hoek

, Bernd van Linder, John-Jules Ch. Meyer:
A Logic of Capabilities. 366-378 - Vincent van Oostrom

, Femke van Raamsdonk:
Weak Orthogonality Implies Confluence: The Higher Order Case. 379-392

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














