Composition theorems for generalized sum and recursively defined types

Alexander Rabinovich

doi:10.1016/j.entcs.2004.04.049

Composition theorems for generalized sum and recursively defined types

Alexander Rabinovich

School of Computer Science

Research output: Contribution to journal › Conference article › peer-review

Abstract

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.

Original language	English
Pages (from-to)	209-211
Number of pages	3
Journal	Electronic Notes in Theoretical Computer Science
Volume	123
DOIs	https://doi.org/10.1016/j.entcs.2004.04.049
State	Published - 1 Mar 2005
Event	Proceedings of the 11th Workshop on Logic, Language, Information and Computation (WoLLIC 2004) - Duration: 19 Jul 2004 → 22 Jul 2004

Access to Document

10.1016/j.entcs.2004.04.049

Cite this

@article{f40b583846514c9b99454ac1d1263a18,

title = "Composition theorems for generalized sum and recursively defined types",

abstract = "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.",

author = "Alexander Rabinovich",

year = "2005",

month = mar,

day = "1",

doi = "10.1016/j.entcs.2004.04.049",

language = "אנגלית",

volume = "123",

pages = "209--211",

journal = "Electronic Notes in Theoretical Computer Science",

issn = "1571-0661",

publisher = "Elsevier",

note = "null ; Conference date: 19-07-2004 Through 22-07-2004",

}

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 - מאמר מכנס

AN - SCOPUS:13944279987

VL - 123

SP - 209

EP - 211

JO - Electronic Notes in Theoretical Computer Science

JF - Electronic Notes in Theoretical Computer Science

SN - 1571-0661

Y2 - 19 July 2004 through 22 July 2004

ER -

Composition theorems for generalized sum and recursively defined types

Abstract

Access to Document

Other files and links

Fingerprint

Cite this