A post-style proof of completeness theorem for symmetric relatedness logic S

DOI10.18778/0138-0680.47.3.05MaRDI QIDQ4629294zbMATH OpenOpenAlexWikidataFDO

Authors Mateusz Klonowski

Publication date 21 March 2019

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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)

Recommendations

• scientific article; zbMATH DE number 1138594
• scientific article; zbMATH DE number 844484
• scientific article; zbMATH DE number 4061209
• scientific article; zbMATH DE number 4004155
• Post's functional completeness theorem

Cited in

(4)

• Incorporating the relation into the language? A survey of approaches in relating logic
• History of relating logic. The origin and research directions
• Tableaux for logics of content relationship and set-assignment semantics
• Relating Logic and Relating Semantics. History, Philosophical Applications and Some of Technical Problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4629294)