Logical Foundations of Computer Science Third International Symposium, LFCS '94, St. Petersburg, Russia, July 11-14, 1994. Proceedings

Logical Foundations of Computer Science Third International Symposium, LFCS '94, St. Petersburg, Russia, July 11-14, 1994. Proceedings / edited by Anil Nerode, Yu.V. Matiyasevich.

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...

Full description

Saved in:
Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Nerode, Anil (Editor), Matiyasevich, Yu.V (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1994.
Edition:1st ed. 1994.
Series:Lecture Notes in Computer Science, 813
Springer eBook Collection.
Subjects:
Computers.
Mathematical logic.
Computer logic.
Algorithms.
Electronic resources (E-books)
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.
Table of Contents:
  • Lower bounds for probabilistic space complexity: Communication-automata approach
  • On model checking infinite-state systems
  • Concurrency problem for Horn fragment of Girard's Linear Logic
  • Referential data structures and labeled modal logic
  • Yet another correctness criterion for Multiplicative Linear Logic with MIX
  • An approach to effective model-checking of real-time Finite-State Machines in mu-calculus
  • Allegories of circuits
  • The complexity of propositional modal theories and the complexity of consistency of propositional modal theories
  • Multiplicative Linear Logic for resource transformation nets
  • The parameterized complexity of some problems in logic and linguistics
  • Foundations of proof search strategies design in linear logic
  • On extreme points of convex compact turing located set
  • Application of typed lambda calculi in the untyped lambda calculus
  • Classes with pairwise equivalent enumerations
  • Strong normalization in a non-deterministic typed lambda-calculus
  • On expressive completeness of modal logic
  • Comparing models of the non-extensional typed ?-calculus extended abstract
  • Coalgebras and approximation
  • Computational and concurrency models of linear logic
  • The longest perpetual reductions in Orthogonal Expression Reduction Systems
  • The notion of rank and games
  • A predicate logic of well-founded actions
  • Predicative recurrence in finite types
  • Arity vs. alternation in second order logic
  • Hereditarily sequential functionals
  • Propositional linear temporal logic and language homomorphisms
  • An abstract property of confluence applied to the study of the lazy partial lambda calculus
  • On specialization of derivations in axiomatic equality theories
  • Preserving of admissible inference rules in modal logic
  • Pure Type Systems with definitions
  • Craig interpolation property in modal logics with provability interpretation
  • Representing null values in logic programming
  • Comparing cubes
  • A logic of capabilities
  • Weak orthogonality implies confluence: The higher-order case.

Similar Items