247 search results - page 1 / 50 » A Computational Structure for the Propositional Calculus |
IJCAI
1989
13 years 8 months ago
1989
TLCA
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. We investigate the question of what constitutes a proof when quantifiers and multiplicative units are both present. On the technical level this paper provides two new as...
LPAR
2001
Springer
13 years 11 months ago
2001
Springer
Abstract. The calculus of structures is a framework for specifying logical systems, which is similar to the one-sided sequent calculus but more general. We present a system of infe...
RTA
2010
Springer
13 years 11 months ago
2010
Springer
In usual proof systems, like the sequent calculus, only a very limited way of combining proofs is available through the tree structure. We present in this paper a logicindependent ...
ISMVL
1994
IEEE
13 years 11 months ago
1994
IEEE
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...