Logical Foundations of Computer Science: Third International Symposium, LFCS '94, St. Petersburg, Russia, July 11-14, 1994. Proceedings
Anil Nerode, Yu.V. Matiyasevich
Springer, Jul 22, 1994 - Computers - 392 pages
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.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Concurrency Problem for Horn Fragment of Girards Linear Logic
Yet Another Correctness Criterion for Multiplicative Linear Logic with MIX
An Approach to Effective ModelChecking of RealTime FiniteState
18 other sections not shown
Other editions - View all
A-calculus Abstract algebra algorithm antichain application arguments arity atomic propositions bound Calculus of Constructions called circuit co-cover coalgebras comonad complete complete lattices confluence consider consists construct contains context continuous posets corresponding Craig interpolation cube defined Definition denote derivation elements equivalent example exists EXPTIME extreme points fixed points formula function Hence Higher-Order Rewriting System holds implies induction hypothesis inference rules infinite input isomorphic lambda calculus lambda terms language Lemma Linear Logic maps modal logic morphism multiset node normal form notion obtained occurrences operator orthogonal parameterized complexity Petri Nets PLTL-formula problem Proof Nets proof structure provable prove PSPACE redex reduction relation result rewrite rules satisfying semantics semi-exponent sequence sequential strategies strong normalisation strongly normalizable subformula subset substitution calculus subterm Suppose symbols Theorem Theoretical Computer Science theory type assignment systems typed lambda typed lambda calculus typed system