20 search results - page 3 / 4 » Proof Theory for Casari's Comparative Logics |
TLCA
2007
Springer
13 years 12 months ago
2007
Springer
The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calcu...
TPHOL
2008
IEEE
14 years 4 days ago
2008
IEEE
g to the well-known “LCF approach” of secure inferences as abstract datatype constructors in ML [16]; explicit proof terms are also available [8]. Isabelle/Isar provides sophis...
BIRTHDAY
1997
Springer
13 years 10 months ago
1997
Springer
We compare the expressive power on finite models of two extensions of first order logic L with equality. L(Ct) is formed by adding an operator count{x : ϕ}, which builds a term ...
WOLLIC
2009
Springer
14 years 10 days ago
2009
Springer
The paper provides a recipe for adequately representing a very inclusive class of finite-valued logics by way of tableaux. The only requisite for applying the method is that the o...
SIAMCOMP
2008
13 years 5 months ago
2008
Leslie Valiant recently proposed a theory of holographic algorithms. These novel algorithms achieve exponential speed-ups for certain computational problems compared to naive algo...