Types of I-free hereditary right maximal terms

DOI10.1007/s10992-005-2831-xzbMath1089.03011OpenAlexW1969075264MaRDI QIDQ812102

Katalin Bimbó

Publication date: 23 January 2006

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

Full work available at URL: https://doi.org/10.1007/s10992-005-2831-x

zbMATH Keywords

decidabilitynatural deductionCombinatory logiclambda calculus

Mathematics Subject Classification ID

Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Combinatory logic and lambda calculus (03B40)

Related Items (4)

On the decidability of implicational ticket entailment ⋮ New consecution calculi for \(R^{t}_{\to}\) ⋮ Extracting \(\mathsf{BB'IW}\) inhabitants of simple types from proofs in the sequent calculus \(LT_\to^t\) for implicational ticket entailment ⋮ Ticket Entailment is decidable

Cites Work

• Combinatory logic. With two sections by William Craig.
• Completeness of the normal typed fragment of the \(\lambda\)-system \(U\)
• Combinatory logic. Vol. II
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Types of I-free hereditary right maximal terms