Sciweavers

131 search results - page 6 / 27
» On Monadic Theories of Monadic Predicates
Sort
View
JAPLL
2006
114views more  JAPLL 2006»
14 years 9 months ago
The monadic second-order logic of graphs XV: On a conjecture by D. Seese
A conjecture by D. Seese states that if a set of graphs has a decidable monadic second-order theory, then it is the image of a set of trees under a transformation defined by monad...
Bruno Courcelle
JLP
2010
59views more  JLP 2010»
14 years 4 months ago
The proof monad
A formalism for expressing the operational semantics of proof languages used in procedural theorem provers is proposed. It is argued that this formalism provides an elegant way to...
Florent Kirchner, César Muñoz
PEPM
2009
ACM
15 years 6 months ago
Designing aspects for side-effect localization
Computation performed in many typical aspects involve side effects. In a purely functional setting, adding such aspects using techniques such as monadification will generally lea...
Kung Chen, Jia-Yin Lin, Shu-Chun Weng, Siau-Cheng ...
LOGCOM
2002
72views more  LOGCOM 2002»
14 years 9 months ago
Definability in Rationals with Real Order in the Background
The paper deals with logically definable families of sets (or point-sets) of rational numbers. In particular we are interested whether the families definable over the real line wi...
Yuri Gurevich, Alexander Moshe Rabinovich
BIRTHDAY
2008
Springer
14 years 10 months ago
Selection and Uniformization Problems in the Monadic Theory of Ordinals: A Survey
Abstract. A formula ψ(Y ) is a selector for a formula ϕ(Y ) in a structure M if there exists a unique Y that satisfies ψ in M and this Y also satisfies ϕ. A formula ψ(X, Y )...
Alexander Rabinovich, Amit Shomrat