478 search results - page 4 / 96 » Monads of Regular Theories |
90
Voted
CSL
2008
Springer
15 years 2 months ago
2008
Springer
We survey two basic techniques for showing that the monadic second-order theory of a structure is decidable. In the first approach, one deals with finite fragments of the theory (g...
92
Voted
ENTCS
2007
15 years 6 days ago
2007
Lawvere theories and monads have been the two main category theoretic formulations of universal algebra, Lawvere theories arising in 1963 and the connection with monads being esta...
105
Voted
ICFP
2005
ACM
16 years 6 days ago
2005
ACM
Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. This paper further develops the monad...
117
click to vote
FSTTCS
2009
Springer
15 years 6 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 ...
98
Voted
JSYML
2008
15 years 7 days 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...