7 search results - page 2 / 2 » Definability and decidability of binary predicates for time ... |
PODS
2007
ACM
14 years 5 months ago
2007
ACM
The pebble tree automaton and the pebble tree transducer are enhanced by additionally allowing an unbounded number of `invisible' pebbles (as opposed to the usual `visible�...
LOGCOM
2010
13 years 3 days 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...