\(\supset\)E is admissible in ``true relevant arithmetic

DOI10.1023/A:1017990121294zbMath0967.03016MaRDI QIDQ1272826

Robert K. Meyer

Publication date: 9 March 1999

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

zbMATH Keywords

relevant arithmetic

Mathematics Subject Classification ID

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

Related Items

The scope of Gödel's first incompleteness theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear logic
• Relevant predication. I: The formal theory
• The semantics of entailment. III
• Beweistheoretische Erfassung der unendlichen Induktion in der Zahlentheorie
• Begründung einer strengen Implikation
• Inconsistent models for relevant arithmetics
• Whither relevant arithmetic?
• On 2nd order intuitionistic propositional calculus with full comprehension
• E, R AND γ
• On Tarski's formalization of predicate logic with identity
• Contributions to the Theory of Optimal Control. A General Procedure for the Computation of Switching Manifolds

This page was built for publication: \(\supset\)E is admissible in ``true relevant arithmetic