A metacompleteness theorem for contraction-free relevant logics

DOI10.1007/BF00935747zbMath0576.03014OpenAlexW1984344621MaRDI QIDQ1064316

John K. Slaney

Publication date: 1984

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00935747

zbMATH Keywords

disjunctionprimenessthree-valued matrix

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45)

Related Items

What is a relevant connective?, Free semantics, Some metacomplete relevant modal logics, Paraconsistent constructive logic with strong negation as a contraction-free relevant logic, Metacompleteness of substructural logics, An algebraic proof of the admissibility of \(\gamma \) in relevant modal logics, METAVALUATIONS, The \(\gamma \)-admissibility of relevant modal logics. I: The method of normal models, Completeness and conservative extension results for some Boolean relevant logics, Gentzenizations of relevant logics without distribution. I, Gentzenizations of relevant logics without distribution. II, Gentzenizations of relevant logics with distribution, The simple consistency of naive set theory using metavaluations, Comparing Contents with Information, The Number of Logical Values, Modal translations in substructural logics, The \(\gamma \)-admissibility of relevant modal logics. II: The method using metavaluations, Gentzenization and decidability of some contraction-less relevant logics, Normalized natural deduction systems for some relevant logics I: The logic DW, FOUR BASIC LOGICAL ISSUES, An incompleteness theorem for modal relevant logics, Notes on stratified semantics, Logic—The Big Picture

Cites Work

• Unnamed Item