Skip to main content
SpringerLink
Log in

Decidability of S1S and S2S

  • Chapter
  • First Online:
Automata Logics, and Infinite Games

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

Abstract

The purpose of this chapter is to prove the decidability of monadic second-order logic over infinite words and infinite binary trees, denoted S1S and S2S. It is organized as follows.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 59.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 79.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

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

  1. Institut für Mathematische Logik, Universitä Freiburg, Germany

    Mark Weyer

Authors
  1. Mark Weyer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik und Praktische Mathematik, Universität Kiel, Christian-Albrechts-Platz 4, 24118, Kiel, Germany

    Thomas Wilke

  2. Mathematische Grundlagen der Informatik, RWTH Aachen, 52056, Aachen, Germany

    Erich Grädel

  3. Lehrstuhl Informatik VII, RWTH Aachen, 52056, Aachen, Germany

    Wolfgang Thomas

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Weyer, M. (2002). Decidability of S1S and S2S. In: Grädel, E., Thomas, W., Wilke, T. (eds) Automata Logics, and Infinite Games. Lecture Notes in Computer Science, vol 2500. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36387-4_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-36387-4_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00388-5

  • Online ISBN: 978-3-540-36387-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation