A Post-style proof of completeness theorem for symmetric relatedness Logic S

DOI10.18778/0138-0680.47.3.05zbMath1437.03106OpenAlexW2942094858WikidataQ128003999 ScholiaQ128003999MaRDI QIDQ4629294

Mateusz Klonowski

Publication date: 21 March 2019

Published in: Bulletin of the Section of Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.18778/0138-0680.47.3.05

zbMATH Keywords

normal formsrelatedness logicrelating logicpost-style proof of completeness

Mathematics Subject Classification ID

Other nonclassical logic (03B60)

Related Items (4)

Relating Logic and Relating Semantics. History, Philosophical Applications and Some of Technical Problems ⋮ History of Relating Logic. The Origin and Research Directions ⋮ Incorporating the Relation into the Language? ⋮ Tableaux for logics of content relationship and set-assignment semantics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Post-style proof of completeness theorem for symmetric relatedness Logic S