The decidability of a fragment of \(\text{BB}'\text{IW}\)-logic

DOI10.1016/j.tcs.2004.02.002zbMath1044.03005OpenAlexW2161429818MaRDI QIDQ596035

Luís Damas, Marcelo Finger, Sabine Broda, Paulo Silva e Silva

Publication date: 10 August 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.02.002

zbMATH Keywords

decision procedurerewriting-system

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Grammars and rewriting systems (68Q42) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Combinatory logic and lambda calculus (03B40)

Related Items (2)

Ticket Entailment is decidable ⋮ A short note on type-inhabitation: formula-trees vs. game semantics

Uses Software

• Automath

Cites Work

• The finite model property for BCK and BCIW
• Combinatory abstraction using \({\mathbf B}\), \({\mathbf B}^ \prime\) and friends
• Proof finding algorithms for implicational logics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The decidability of a fragment of \(\text{BB}'\text{IW}\)-logic