Completeness of the normal typed fragment of the \(\lambda\)-system \(U\)

DOI10.1007/BF00262047zbMath0355.02017MaRDI QIDQ1237066

Glen Helman

Publication date: 1977

Published in: Journal of Philosophical Logic (Search for Journal in Brave)

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Combinatory logic and lambda calculus (03B40)

Related Items (5)

Relevant predication. I: The formal theory ⋮ Condensed detachment is complete for relevance logic: A computer-aided proof ⋮ Extracting \(\mathsf{BB'IW}\) inhabitants of simple types from proofs in the sequent calculus \(LT_\to^t\) for implicational ticket entailment ⋮ On analysing relevance constructively ⋮ Types of I-free hereditary right maximal terms

Cites Work

• Combinatory logic. With two sections by William Craig.
• Unnamed Item

This page was built for publication: Completeness of the normal typed fragment of the \(\lambda\)-system \(U\)