TY - JOUR
T1 - Composition theorems for generalized sum and recursively defined types
AU - Rabinovich, Alexander
PY - 2005/3/1
Y1 - 2005/3/1
N2 - The notion of a generalized sum and the composition theorem to reduce the monadiac second-order thery of the generalized sum to the monadic second-order theories of the summands and of its index structure are presented. The theorems reduce reasoning about compound data structures to reasoning about their parts. The composition theorem for linear orders is used to obtain decidability results for the monadiac theory of linear orders. It is concluded that the compositional method is useful for the proofs of the limitation of the expressive power and also for the proofs of positive results on the expressive power.
AB - The notion of a generalized sum and the composition theorem to reduce the monadiac second-order thery of the generalized sum to the monadic second-order theories of the summands and of its index structure are presented. The theorems reduce reasoning about compound data structures to reasoning about their parts. The composition theorem for linear orders is used to obtain decidability results for the monadiac theory of linear orders. It is concluded that the compositional method is useful for the proofs of the limitation of the expressive power and also for the proofs of positive results on the expressive power.
UR - http://www.scopus.com/inward/record.url?scp=13944279987&partnerID=8YFLogxK
U2 - 10.1016/j.entcs.2004.04.049
DO - 10.1016/j.entcs.2004.04.049
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???
AN - SCOPUS:13944279987
SN - 1571-0661
VL - 123
SP - 209
EP - 211
JO - Electronic Notes in Theoretical Computer Science
JF - Electronic Notes in Theoretical Computer Science
T2 - Proceedings of the 11th Workshop on Logic, Language, Information and Computation (WoLLIC 2004)
Y2 - 19 July 2004 through 22 July 2004
ER -