Skip to main content
SpringerLink
Log in

Logical Foundations of Computer Science

Third International Symposium, LFCS '94, St. Petersburg, Russia, July 11-14, 1994. Proceedings

  • Conference proceedings
  • © 1994

Overview

Editors:
  1. Anil Nerode
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Yu. V. Matiyasevich
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 813)

Included in the following conference series:

Conference proceedings info: LFCS 1994.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (35 papers)

  1. Front Matter

    Download chapter PDF

  2. Lower bounds for probabilistic space complexity: Communication-automata approach

    • Farid Ablayev
    Pages 1-7

  3. On model checking infinite-state systems

    • Henrik Reif Andersen
    Pages 8-17

  4. Concurrency problem for Horn fragment of Girard's Linear Logic

    • Dmitry A. Archangelsky, Mikhail I. Dekhtyar, Evgeny Kruglov, Ilmir Kh. Musikaev, Mikhail A. Taitslin
    Pages 18-22

  5. Referential data structures and labeled modal logic

    • Sergei Artëmov, Vladimir Krupski
    Pages 23-33

  6. Yet another correctness criterion for Multiplicative Linear Logic with MIX

    • Andrea Asperti, Giovanna Dore
    Pages 34-46

  7. An approach to effective model-checking of real-time Finite-State Machines in mu-calculus

    • S. A. Berezin, N. V. Shilov
    Pages 47-55

  8. Allegories of circuits

    • Carolyn Brown, Alan Jeffrey
    Pages 56-68

  9. The complexity of propositional modal theories and the complexity of consistency of propositional modal theories

    • Cheng-Chia Chen, I-Peng Lin
    Pages 69-80

  10. Multiplicative Linear Logic for resource transformation nets

    • Alexander M. Dekhtyar
    Pages 81-88

  11. The parameterized complexity of some problems in logic and linguistics

    • Rodney G. Downey, Michael R. Fellows, Bruce M. Kapron, Michael T. Hallett, H. Todd Wareham
    Pages 89-100

  12. Foundations of proof search strategies design in linear logic

    • D. Galmiche, G. Perrier
    Pages 101-113

  13. On extreme points of convex compact turing located set

    • Xiaolin Ge, Anil Nerode
    Pages 114-128

  14. Application of typed lambda calculi in the untyped lambda calculus

    • Silvia Ghilezan
    Pages 129-139

  15. Classes with pairwise equivalent enumerations

    • S. S. Goncharov, S. A. Badaev
    Pages 140-141

  16. Strong normalization in a non-deterministic typed lambda-calculus

    • Philippe de Groote
    Pages 142-152

  17. On expressive completeness of modal logic

    • Bernhard Heinemann
    Pages 153-163

  18. Comparing models of the non-extensional typed λ-calculus extended abstract

    • R. Hoofman
    Pages 164-172

  19. Coalgebras and approximation

    • Bart Jacobs
    Pages 173-183

  20. Computational and concurrency models of linear logic

    • Max I. Kanovich
    Pages 184-190
Back to top

Other volumes

  1. Logical Foundations of Computer Science

Keywords

About this book

This volume presents the refereed papers accepted for the international symposium Logical Foundations of Computer Science '94, Logic at St. Petersburg, held in St. Petersburg, Russia in July 1994. The symposium was the third in a series of joint efforts of logicians from both the former Soviet Union and the West.
The volume reflects that the interaction of logic and computer science is an especially fertile ground for interdisciplinary work providing mutual understanding and benefits. The totally 35 papers are devoted to topics as linear logic, Horn clauses, model-checking, lambda-calculi, modal logic, and problem complexity.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation