Skip to main content
SpringerLink
Log in
Book cover

Logical Foundations of Computer Science

4th International Symposium, LFCS'97, Yaroslavl, Russia, July, 6 - 12, 1997, Proceedings

  • Conference proceedings
  • © 1997

Overview

Editors:
  1. Sergei Adian
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Anil Nerode
    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 1234)

Included in the following conference series:

Conference proceedings info: LFCS 1997.

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 (42 papers)

  1. Functions for the general solution of parametric word equations

    • G. S. Makanin, H. Abdulrab, P. Goralcik
    Pages 189-202

  2. A proof procedure for hereditary Harrop formulas with free equality

    • Evgeny Makarov
    Pages 203-213

  3. Basic forward chaining construction for logic programs

    • V. W. Marek, A. Nerode, J. B. Remmel
    Pages 214-225

  4. Decidability and undecidability of the halting problem on Turing machines, a survey

    • Maurice Margenstern
    Pages 226-236

  5. Case study: Additive linear logic and lattices

    • Jean-Yves Marion
    Pages 237-247

  6. Some decision problems for traces

    • Yuri Matiyasevich
    Pages 248-257

  7. Existential instantiation and strong normalization

    • G. Mints
    Pages 258-265

  8. Models for the logic of proofs

    • Alexey Mkrtychev
    Pages 266-275

  9. Interpretation of the full computation tree logic CTL* on sets of infinite sequences

    • Ulrich Nitsche
    Pages 276-282

  10. Type introduction for equational rewriting

    • Hitoshi Ohsaki, Aart Middeldorp
    Pages 283-293

  11. Capturing bisimulation-invariant Ptime

    • Martin Otto
    Pages 294-305

  12. Equivalence of multiplicative fragments of cyclic linear logic and noncommutative linear logic

    • Mati Pentus
    Pages 306-311

  13. A decidable fragment of second order linear logic

    • G. Perrier
    Pages 312-322

  14. Some results on Propositional Dynamic Logic with fixed points

    • Igor Rents, Nikolaj Shilov
    Pages 323-332

  15. Quasi-characteristic inference rules for modal logics

    • Vladimir V. Rybakov
    Pages 333-341

  16. Provability logic with operations on proofs

    • Tatiana Sidon
    Pages 342-353

  17. Formal verification of logic programs: Foundations and implementation

    • Robert F. Stärk
    Pages 354-368

  18. Unification of terms with term-indexed variables

    • Igor L. Tandetnik
    Pages 369-373

  19. Back-forth equivalences for design of concurrent systems

    • Igor V. Tarasyuk
    Pages 374-384

  20. Association nets: An alternative formalization of common thinking

    • G. S. Tseytin
    Pages 385-398
Back to top

Other volumes

  1. Logical Foundations of Computer Science

Keywords

About this book

This book constitutes the refereed proceedings of the 4th International Symposium on Logical Foundations of Computer Science, LFCS'97, held in Yaroslavl, Russia, in July 1997.
The volume presents 42 revised refereed papers carefully selected by the program committee. All current issues of computer science logic are addressed. There is a certain emphasis on reporting the progress achieved by scientists from various parts of the former Soviet Union; but there are also many other strong papers from the international research community.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation