10 search results - page 1 / 2 » On the Expressive Power of Monadic Least Fixed Point Logic |
ICALP
2004
Springer
13 years 10 months ago
2004
Springer
Monadic least fixed point logic MLFP is a natural logic whose expressiveness lies between that of first-order logic FO and monadic second-order logic MSO. In this paper we take ...
CSL
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. We study the succinctness of monadic second-order logic and a variety of monadic fixed point logics on trees. All these languages are known to have the same expressive p...
APAL
2004
13 years 4 months ago
2004
We study the relationship between least and inflationary fixed-point logic. In 1986, Gurevich and Shelah proved that in the restriction to finite structures, the two logics have t...
LICS
1999
IEEE
13 years 9 months ago
1999
IEEE
The ordered conjecture states that least fixed-point logic LFP is strictly more expressive than first-order logic FO on every infinite class of ordered finite structures. It has b...
TCS
2002
13 years 4 months ago
2002
An operation M which constructs from a given structure M a tree-like structure whose domain consists of the finite sequences of elements of M is considered. A notion of automata r...