DagSemProc.07441.4.pdf
- Filesize: 258 kB
- 14 pages
Document
Compatibility of Shelah and Stupp's and of Muchnik's iteration with fragments of monadic second order logic
Author
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 7441
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2008-04-09
Cite AsGet 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
https://doi.org/10.4230/DagSemProc.07441.4
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.
Keywords
- Logic in computer science
- Rabin's tree theorem
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads