131 search results - page 13 / 27 » An Equational Re-engineering of Set Theories |
RTA
2010
Springer
13 years 11 months ago
2010
Springer
Rewriting systems on words are very useful in the study of monoids. In good cases, they give finite presentations of the monoids, allowing their manipulation by a computer. Even b...
STOC
2010
ACM
14 years 15 days ago
2010
ACM
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
AR
2010
13 years 6 months ago
2010
Teams of autonomous space robots are needed for future space missions such as the construction of large solar power stations and large space telescopes in earth orbit. This work fo...
AGP
1999
IEEE
13 years 12 months ago
1999
IEEE
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
LICS
1991
IEEE
13 years 11 months ago
1991
IEEE
We present an elementary axiomatisation of synthetic domain theory and show that it is sufficient to deduce the fixed point property and solve domain equations. Models of these a...