Name
Title | ||
|---|---|---|
Systems of Illative Combinatory Logic Complete for First-Order Propositional and Predicate Calculus |
Abstract | ||
|---|---|---|
Illative combinatory logic consists of the theory of combinators or lambdacalculus extended by extra constants (and corresponding axioms and rules)intended to capture inference. The paper considers systems of illativecombinatory logic that are sound for first order propositional and predicatecalculus. The interpretation from ordinary logic into the illative systemscan be done in two ways: following the propositions-as-types paradigm, inwhich derivations become combinators, or in a more... |
Year | Venue | DocType |
|---|---|---|
1993 | J. Symb. Log. | Journal |
Volume | Issue | Citations |
58 | 3 | 8 |
PageRank | References | Authors |
1.76 | 3 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Henk Barendregt | 1 | 588 | 92.49 |
| Martin W. Bunder | 2 | 64 | 16.78 |
| Wil Dekkers | 3 | 18 | 4.08 |