1209 search results - page 55 / 242 » Universal Algebra and Computer Science |
LICS
2006
IEEE
14 years 2 months ago
2006
IEEE
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...
MFCS
2001
Springer
14 years 1 months ago
2001
Springer
Abstract Marek Chrobak1 , Lawrence L. Larmore2 , and Wojciech Rytter3,4 1 Department of Computer Science, University of California Riverside, CA 92521 2 Department of Computer Scie...
RELMICS
1997
Springer
14 years 26 days ago
1997
Springer
In this paper we extend an earlierapproach to graphicalrelationcalculitowards relational matching, thus allowing proofs with fewer auxiliary steps and concentrating more on the es...
TLCA
1993
Springer
14 years 24 days ago
1993
Springer
In this paper we introduce a logic for parametric polymorphism. Just as LCF is a logic for the simply-typed λ-calculus with recursion and arithmetic, our logic is a logic for Sys...
TCS
2010
13 years 3 months ago
2010
A text is a word together with an additional linear order on it. We study quantitative models for texts, i.e. text series which assign to texts elements of a semiring. We introduc...