Logical Foundations of Computer Science - Tver '92: Second International Symposium, Tver, Russia, July 20-24, 1992. Proceedings

by Anil Nerode (Editor), Mikhail Taitslin (Editor)

Overview

This volume presents the papers selected for the Symposium Logic at Tver '92, held at Sokol, near Tver, Russia in July 1992. It is the second in a series of international symposia on logical foundations of computer science held in Russia. The meeting is a joint effort of scholars from both the former Soviet Union and the West, and indicates a new era of international cooperation. Sponsors of the meeting include: the Association for Computing Machinery, the Association for Symbolic Logic, andthe Committee on Mathematical Foundations of Computer Science of IEEE. The book is a unique source of information on the state of computer science research in the former Soviet Union and presents important discoveries in the area of logical foundations of computer science.

Product Details

ISBN-13:	9783540557074
Publisher:	Springer Berlin Heidelberg
Publication date:	07/16/1992
Series:	Lecture Notes in Computer Science , #620
Edition description:	1992
Pages:	517
Product dimensions:	6.10(w) x 9.17(h) x 0.04(d)

Table of Contents

Modal Linear Logic.- Machine learning of higher order programs.- Quantifying the amount of verboseness (extended abstract).- Strictness logic and polymorphic invariance.- Preference logics and nonmonotonicity in logic programming.- The Ehrenfeucht-Fraïssé games for transitive closure.- Feasibility of finite and infinite paths in data dependent programs.- An interleaving model for real-time systems.- Incremental evaluation of natural semantics specifications.- Denotations for classical proofs -Preliminary results-.- Ordinal arithmetic with list structures (preliminary version).- Many-valued non-monotonic modal logics.- Automated deduction in additive and multiplicative linear logic.- Intensionally stable functions.- A constructive proof that tree are well-quasi-ordered under minors (detailed abstract).- Banishing robust Turing completeness.- Balanced formulas, BCK-minimal formulas and their proofs.- Non-stable models of linear logic.- Ordering optimisations for concurrent logic programs.- A categorical interpretation of partial function logic and Hoare logic.- The polynomial complexity of conjunctive normal form satisfiability, when the number of conjunctions and negations is limited.- Typed—-calculus with recursive definitions.- Set theoretic foundations for fuzzy set theory, and their applications.- Constructive specifications of abstract data types using temporal logic.- An interval-based modal logic for system specification.- A unifying theory of dependent types: the schematic approach.- MSL — A Mathematical Specification Language.- Partial algebra + order-sorted algebra = galactic algebra.- Minimal negation and Hereditary Harrop formulae.- Kleene automata and recursion theory.- Incremental polymorphic type checking with update.- Operators on lattices of?-Herbrand interpretations.- Sequential calculus for proving the properties of regular programs.- Complete sequential calculi for the first order symmetrical linear temporal logic with until and since.- Non modularity and expressibility for nets of relations (extended abstract).- Correctness of generic modules.- An and-parallelism cooperative scheme for full prolog interpreters on a transputer-based architecture.- A sequent calculus for a first order linear temporal logic with equality.- On the expressive power of modal logics on trees.- Propositional dynamic logic with fixed points: Algorithmic tools for verification of finite state machines.- Effective operators and continuity revisited.- Logical characterizations of bounded query classes I: Logspace oracle machines.- Solving equational constraints in polymorphic types.- Gentzen-style and Novikov-style cut-elimination.- Graded modalities in epistemic logic.