Compatibility of Shelah and Stupp's and of Muchnik's iteration with fragments of monadic second order logic

Kuske, Dietrich

doi:10.4230/DagSemProc.07441.4

Document

Compatibility of Shelah and Stupp's and of Muchnik's iteration with fragments of monadic second order logic

Author Dietrich Kuske

Part of: Volume: Dagstuhl Seminar Proceedings, Volume 7441
Part of: Series: Dagstuhl Seminar Proceedings (DagSemProc)
License: Creative Commons Attribution 4.0 International license
Publication Date: 2008-04-09

PDF

File

PDF

DagSemProc.07441.4.pdf

Filesize: 258 kB
14 pages

Document Identifiers

DOI: 10.4230/DagSemProc.07441.4
URN: urn:nbn:de:0030-drops-14078

Subject Classification

Keywords

Logic in computer science
Rabin's tree theorem

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

Abstract

We investigate the relation between the theory of the iterations in
  the sense of Shelah-Stupp and of Muchnik, resp., and the theory of
  the base structure for several logics. These logics are obtained
  from the restriction of set quantification in monadic second order
  logic to certain subsets like, e.g., finite sets, chains, and finite
  unions of chains. We show that these theories of the Shelah-Stupp
  iteration can be reduced to corresponding theories of the base
  structure. This fails for Muchnik's iteration.

Cite As Get BibTex

Dietrich Kuske. Compatibility of Shelah and Stupp's and of Muchnik's iteration with fragments of monadic second order logic. In Algorithmic-Logical Theory of Infinite Structures. Dagstuhl Seminar Proceedings, Volume 7441, pp. 1-14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008) https://doi.org/10.4230/DagSemProc.07441.4

Author Details

Dietrich Kuske

Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail