Computer Science – Logic in Computer Science
Scientific paper
2008-02-20
Dans Proceedings of the 25th Annual Symposium on the Theoretical Aspects of Computer Science - STACS 2008, Bordeaux : France (
Computer Science
Logic in Computer Science
Scientific paper
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.
No associations
LandOfFree
Compatibility of Shelah and Stupp's and Muchnik's iteration with fragments of monadic second order logic does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Compatibility of Shelah and Stupp's and Muchnik's iteration with fragments of monadic second order logic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Compatibility of Shelah and Stupp's and Muchnik's iteration with fragments of monadic second order logic will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-647869