Logical Foundations of Computer Science

Third International Symposium, LFCS '94, St. Petersburg, Russia, July 11-14, 1994. Proceedings
1994
ISBN: 978-3-540-58140-6
Verlag: Springer Berlin Heidelberg

Buch, Englisch, Band 813, 397 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 1270 g

Reihe: Lecture Notes in Computer Science

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.

Zielgruppe

Research

Autoren/Hrsg.

Matiyasevich, Yu. V.

Nerode, Anil

Fachgebiete

• Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
• Mathematik | Informatik Mathematik Mathematik Allgemein Mathematische Logik
• Mathematik | Informatik EDV | Informatik Informatik Berechenbarkeitstheorie, Komplexitätstheorie

Inhaltsverzeichnis

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