Skip to main content
SpringerLink
Log in

Logical Foundations of Computer Science - Tver '92

Second International Symposium, Tver, Russia, July 20-24, 1992. Proceedings

  • Conference proceedings
  • © 1992

Overview

Editors:
  1. Anil Nerode
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Mikhail Taitslin
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 620)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (45 papers)

  1. A categorical interpretation of partial function logic and Hoare logic

    • P. M. W. Knijnenburg, F. Nordemann
    Pages 229-240

  2. The polynomial complexity of conjunctive normal form satisfiability, when the number of conjunctions and negations is limited

    • N. K. Kossovsky, A. B. Prokhoroff
    Pages 241-245

  3. Typed λ-calculus with recursive definitions

    • Sergey V. Kotov
    Pages 246-257

  4. Set theoretic foundations for fuzzy set theory, and their applications

    • K. Lano
    Pages 258-268

  5. Constructive specifications of abstract data types using temporal logic

    • Frank Lesske
    Pages 269-280

  6. An interval-based modal logic for system specification

    • Renwei Li, José Carmo
    Pages 281-292

  7. A unifying theory of dependent types: the schematic approach

    • Zhaohui Luo
    Pages 293-304

  8. MSL — A Mathematical Specification Language

    • V. P. Makarov
    Pages 305-313

  9. Partial algebra + order-sorted algebra = galactic algebra

    • Aristide Mégrelis
    Pages 314-325

  10. Minimal negation and Hereditary Harrop formulae

    • Alberto Momigliano
    Pages 326-335

  11. Kleene automata and recursion theory

    • John Mullins
    Pages 336-346

  12. Incremental polymorphic type checking with update

    • Alan Mycroft
    Pages 347-357

  13. Operators on lattices of ω-Herbrand interpretations

    • Jan A. Plaza
    Pages 358-369

  14. Sequential calculus for proving the properties of regular programs

    • Aida Pliuškevičienė
    Pages 370-381

  15. Complete sequential calculi for the first order symmetrical linear temporal logic with until and since

    • Regimantas Pliuškevičius
    Pages 382-393

  16. Non modularity and expressibility for nets of relations (extended abstract)

    • Alexander Rabinovich
    Pages 394-405

  17. Correctness of generic modules

    • Wolfgang Reif
    Pages 406-417

  18. An and-parallelism cooperative scheme for full prolog interpreters on a transputer-based architecture

    • K. Sadi, F. Meunier
    Pages 418-429

  19. A sequent calculus for a first order linear temporal logic with equality

    • Jurate Sakalauskaite
    Pages 430-440

  20. On the expressive power of modal logics on trees

    • Bernd-Holger Schlingloff
    Pages 441-451
Back to top

Keywords

About this book

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.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation