Proof finding algorithms for implicational logics (Q1575928)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Proof finding algorithms for implicational logics |
scientific article |
Statements
Proof finding algorithms for implicational logics (English)
0 references
23 August 2000
0 references
Logics considered here include implicational fragments of intuitionistic propositional logic, relevance logics \(R_{\rightarrow}\), \(T_{\rightarrow}\) and \(T_{\rightarrow}-W\), multiplicative linear logic and affine logic. For each of them a restriction on \(\lambda\)-terms providing an equivalent natural deduction formulation is stated, then a corresponding proof search algorithm is described.
0 references
implicative logics
0 references
decision procedures
0 references
implicational fragments
0 references
intuitionistic propositional logic
0 references
relevance logics
0 references
multiplicative linear logic
0 references
affine logic
0 references
restriction on \(\lambda\)-terms
0 references
natural deduction
0 references
proof search algorithm
0 references
