3239 search results - page 186 / 648 » A Logical Process Calculus |
125
click to vote
LICS
2002
IEEE
15 years 8 months ago
2002
IEEE
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
120
click to vote
MTDT
1999
IEEE
15 years 7 months ago
1999
IEEE
Continuing improvements in semiconductor fabrication density are enabling new classes of System-on-aChip architectures that combine extensive processing logic and high-density mem...
117
Voted
CTCS
1989
Springer
15 years 7 months ago
1989
Springer
We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of fac...
138
click to vote
AIML
2008
15 years 4 months ago
2008
In 1983, Valentini presented a syntactic proof of cut-elimination for a sequent calculus GLSV for the provability logic GL where we have added the subscript V for "Valentini&q...
153
Voted
ICCD
1999
IEEE
15 years 7 months ago
1999
IEEE
Continuing improvements in semiconductor density are enabling new classes of System-on-a-Chip architectures that combine extensive processing logic and high-density memory. Many o...