2501 search results - page 84 / 501 » Logics with Rank Operators |
74
Voted
CSL
2000
Springer
15 years 5 months ago
2000
Springer
We study definability of languages in arithmetic and the free monoid by bounded versions of fixed-point and transitive-closure logics. In particular we give logical characterisat...
72
Voted
ISLPED
1996
ACM
15 years 4 months ago
1996
ACM
The power versus frequency performance of a micropipelined conventional CMOS logic family is compared with that of three similarly pipelined energy-recovering logic families. Usin...
94
Voted
IANDC
2010
14 years 11 months ago
2010
This paper studies several applications of the notion of a presentation of a functor by operations and equations. We show that the technically straightforward generalisation of th...
105
Voted
JUCS
2002
15 years 12 days ago
2002
Abstract: In this paper we introduce the concept of the quasi-product of tree automata. In a quasi-product the inputs of the component tree automata are operational symbols in whic...
120
click to vote
LOGCOM
2010
14 years 7 months ago
2010
Gentzen systems are introduced for Spinks and Veroff's substructural logic corresponding to constructive logic with strong negation, and some logics in its vicinity. It has b...