1768 search results - page 17 / 354 » A Logic for Algebraic Effects |
CADE
2008
Springer
14 years 8 months ago
2008
Springer
We consider proof systems for effectively propositional logic. First, we show that propositional resolution for effectively propositional logic may have exponentially longer refuta...
AISC
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. In previous work, we showed the importance of distinguishing "I know that X = Y " from "I don't know that X = Y ". In this paper we look at effec...
PODS
2008
ACM
14 years 8 months ago
2008
ACM
A survey of effective characterizations of tree logics. If L is a logic, then an effective characterization for L is an algorithm, which inputs a tree automaton and replies if the...
TLCA
1993
Springer
14 years 15 days ago
1993
Springer
In this paper we introduce a logic for parametric polymorphism. Just as LCF is a logic for the simply-typed λ-calculus with recursion and arithmetic, our logic is a logic for Sys...
AML
2010
13 years 8 months ago
2010
We show the non-arithmeticity of 1st order theories of lattices of n sentences modulo provable equivalence in a formal theory, of diagonalizable algebras of a wider class of arithm...