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.
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.
Les mer
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.
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.
Les mer
Springer Book Archives
Springer Book Archives
GPSR Compliance
The European Union's (EU) General Product Safety Regulation (GPSR) is a set of rules that requires consumer products to be safe and our obligations to ensure this.
If you have any concerns about our products you can contact us on ProductSafety@springernature.com.
In case Publisher is established outside the EU, the EU authorized representative is:
Springer Nature Customer Service Center GmbH
Europaplatz 3
69115 Heidelberg, Germany
ProductSafety@springernature.com
Les mer
Produktdetaljer
ISBN
9783540581406
Publisert
1994-06-08
Utgiver
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG; Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Høyde
279 mm
Bredde
216 mm
Aldersnivå
Research, UP, P, 05, 06
Språk
Product language
Engelsk
Format
Product format
Heftet