4 search results - page 1 / 1 » Metatheoretic Results for a Modal lambda-Calculus |
14
Voted
JFLP
2000
14 years 9 months ago
2000
JUCS
2006
14 years 9 months ago
2006
: Our aim is to discuss what, when and, how deep logic should be taught in the computer science education in connection with the so called "Bologna process". We survey th...
LICS
2008
IEEE
15 years 3 months ago
2008
IEEE
Collapsible pushdown automata (CPDA) are a new kind of higher-order pushdown automata in which every symbol in the stack has a link to a stack situated somewhere below it. In addi...
NDJFL
1998
14 years 9 months ago
1998
Using methods of abstract logic and the theory of valuation, we prove that there is no paraconsistent negation obeying the law of double negation and such that ¬(a ∧ ¬a) is a t...