Skip to main content
SpringerLink
Log in
Book cover
  • Conference proceedings
  • © 1991

Computer Science Logic

4th Workshop, CSL '90, Heidelberg, Germany, October 1-5, 1990. Proceedings

Editors:

  1. Egon Börger
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Hans Kleine Büning
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Michael M. Richter
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Wolfgang Schönfeld
    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 533)

Sections

Buy it now

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

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

Table of contents (24 papers)

  1. Front Matter

    PDF

  2. Monadic second order logic, tree automata and forbidden minors

    • Stefan Arnborg, Andrzej Proskurowski, Detlef Seese
    Pages 1-16

  3. On the reduction theory for average case complexity

    • Andreas Blass, Yuri Gurevich
    Pages 17-30

  5. A formal operational semantics for languages of type Prolog III

    • E. Börger, Peter H. Schmitt
    Pages 67-79

  7. Decision problems for tarski and presburger arithmetics extended with sets

    • D. Cantone, V. Cutello, J. T. Schwartz
    Pages 95-109

  10. Subclasses of quantified boolean formulas

    • Andreas Flögel, Marek Karpinski, Hans Kleine Büning
    Pages 145-155

  12. Cutting plane versus frege proof systems

    • Andreas Goerdt
    Pages 174-194

  13. RAM with compact memory: a realistic and robust model of computation

    • Etienne Grandjean, J. M. Robson
    Pages 195-233

  16. Interactive proof systems: Provers, rounds, and error bounds

    • Ulrich Hertrampf, Klaus Wagner
    Pages 261-273

  17. Logics for belief dependence

    • Zhisheng Huang
    Pages 274-288

  20. Ramsey's theorem in bounded arithmetic

    • Pavel Pudlák
    Pages 308-317
Back to top

About this book

The workshop Computer Science Logic '90 was held at the Max-Planck-Haus in Heidelberg, Germany, October 1-5, 1990. It was the fourth in a series of worskhops, following CSL '89 at the University of Kaiserslautern (see LNCS 440), CSL '88 at the University of Duisberg (see LNCS 385), and CSL '87 at the University of Karlsruhe (see LNCS 329). This volume contains 24 papers, chosen by means of a review procedure from the 35 papers presented at the workshop, some of which were invited and some selected from a total of 89 submissions. The papers cover a wide range of topics arising from the applications of logic to computer science.
Back to top

Keywords

Back to top

Bibliographic Information

Back to top

Publish with us

Policies and ethics

Back to top
Access via your institution

Buy it now

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

Search

Navigation