199 search results - page 36 / 40 » Denotations for Classical Proofs - Preliminary Results |
IJAR
2007
13 years 7 months ago
2007
In order to handle inconsistent knowledge bases in a reasonable way, one needs a logic which allows nontrivial inconsistent theories. Logics of this sort are called paraconsistent...
LICS
2010
IEEE
13 years 6 months ago
2010
IEEE
Alternating timed automata are a powerful extension of classical Alur-Dill timed automata that are closed under all Boolean operations. They have played a key role, among others, ...
JCT
2011
13 years 2 months ago
2011
We show that the number of anti-lecture hall compositions of n with the first entry not exceeding k − 2 equals the number of overpartitions of n with non-overlined parts not con...
SIAMMA
2010
13 years 2 months ago
2010
This work deals with trace theorems for a class of ramified bidimensional domains with a self-similar fractal boundary . The fractal boundary is supplied with a probability measur...
POPL
2010
ACM
14 years 5 months ago
2010
ACM
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...