Sciweavers

434 search results - page 10 / 87
» Monadic Bounded Algebras
Sort
View
LICS
2006
IEEE
14 years 3 months ago
The Boundedness Problem for Monadic Universal First-Order Logic
We consider the monadic boundedness problem for least fixed points over FO formulae as a decision problem: Given a formula ϕ(X, x), positive in X, decide whether there is a unif...
Martin Otto
AOSD
2012
ACM
12 years 5 months ago
A monadic interpretation of execution levels and exceptions for AOP
Aspect-Oriented Programming (AOP) started fifteen years ago with the remark that modularization of so-called crosscutting functionalities is a fundamental problem for the enginee...
Nicolas Tabareau
STACS
2009
Springer
14 years 4 months ago
Weak MSO with the Unbounding Quantifier
Abstract. A new class of languages of infinite words is introduced, called the maxregular languages, extending the class of ω-regular languages. The class has two equivalent desc...
Mikolaj Bojanczyk
ECCC
2007
109views more  ECCC 2007»
13 years 9 months ago
Logic, Graphs, and Algorithms
Algorithmic meta theorems are algorithmic results that apply to whole families of combinatorial problems, instead of just specific problems. These families are usually defined i...
Martin Grohe
JUCS
2007
100views more  JUCS 2007»
13 years 9 months ago
On BCK Algebras - Part I.a: An Attempt to Treat Unitarily the Algebras of Logic. New Algebras
: Since all the algebras connected to logic have, more or less explicitely, an associated order relation, it follows that they have two presentations, dual to each other. We classi...
Afrodita Iorgulescu