131 search results - page 4 / 27 » On Monadic Theories of Monadic Predicates |
135
click to vote
JSYML
2008
15 years 4 months ago
2008
We define a class of finite state automata acting on transfinite sequences, and use these automata to prove that no singular cardinal can be defined by a monadic second order formu...
186
Voted
FROCOS
2009
Springer
15 years 11 months ago
2009
Springer
Motivated by applications in software verification, we explore automated reasoning about the non-disjoint combination of theories of infinitely many finite structures, where the...
132
click to vote
CAV
1999
Springer
15 years 9 months ago
1999
Springer
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
128
click to vote
JCT
2007
15 years 4 months ago
2007
We prove that one can express the vertex-minor relation on finite undirected graphs by formulas of monadic second-order logic (with no edge set quantification) extended with a p...
164
Voted
FSTTCS
2009
Springer
15 years 11 months ago
2009
Springer
The paper focuses on the structure of fundamental sequences of ordinals smaller than ε0. A first result is the construction of a monadic second-order formula identifying a given ...