Characterization of Logics over Ranked Tree Languages

We study the expressive power of the logics EF + F-1 , 2 and boolean combinations of 1 over ranked trees. In particular, we provide effective characterizations of those three logics using algebraic identities. Characterizations had already been obtained for those logics over unranked trees, but both the algebra and the proofs were dependant on the properties of the unranked structure and the problem remained open for ranked trees.

• Type: Conference
• Year: 2008
• Where: CSL
• Authors: Thomas Place
• Keywords: Automated Reasoning, CSL 2008, Effective Characterizations, Logics, Logics Ef