Sciweavers

2272 search results - page 8 / 455
» A Calculus for
Sort
View
TABLEAUX
2005
Springer
15 years 2 months ago
Clausal Connection-Based Theorem Proving in Intuitionistic First-Order Logic
Abstract. We present a clausal connection calculus for first-order intuitionistic logic. It extends the classical connection calculus by adding prefixes that encode the character...
Jens Otten
ISMVL
1994
IEEE
124views Hardware» more  ISMVL 1994»
15 years 1 months ago
Approximating Propositional Calculi by Finite-Valued Logics
The problem of approximating a propositional calculus is to nd many-valued logics which are sound for the calculus (i.e., all theorems of the calculus are tautologies) with as few...
Matthias Baaz, Richard Zach
FOSSACS
2007
Springer
15 years 3 months ago
The Rewriting Calculus as a Combinatory Reduction System
The last few years have seen the development of the rewriting calculus (also called rho-calculus or ρ-calculus) that uniformly integrates first-order term rewriting and λ-calcul...
Clara Bertolissi, Claude Kirchner
93
Voted
RTA
2010
Springer
15 years 1 months ago
Simulation in the Call-by-Need Lambda-Calculus with letrec
This paper shows the equivalence of applicative similarity and contextual approximation, and hence also of bisimilarity and contextual equivalence, in the deterministic call-by-nee...
Manfred Schmidt-Schauß, David Sabel, Elena M...
CIE
2006
Springer
15 years 1 months ago
LJQ: A Strongly Focused Calculus for Intuitionistic Logic
LJQ is a focused sequent calculus for intuitionistic logic, with
Roy Dyckhoff, Stéphane Lengrand