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

Bulletin of the Section of Logic 47 (3):201 (2018)
  Copy   BIBTEX

Abstract

One of the logic defined by Richard Epstein in a context of an analysis of subject matter relationship is Symmetric Relatedness Logic S. In the monograph [2] we can find some open problems concerning relatedness logic, a Post-style completeness theorem for logic S is one of them. Our paper introduces a solution of this metalogical issue.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,219

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

On the relatedness logic of Richard L. Epstein.Stanislaw Krajewski - 1982 - Bulletin of the Section of Logic 11 (1-2):24-28.
Undecidability and intuitionistic incompleteness.D. C. McCarty - 1996 - Journal of Philosophical Logic 25 (5):559 - 565.
The modal logics of kripke–feferman truth.Carlo Nicolai & Johannes Stern - 2021 - Journal of Symbolic Logic 86 (1):362-396.
Solovay-Type Theorems for Circular Definitions.Shawn Standefer - 2015 - Review of Symbolic Logic 8 (3):467-487.

Analytics

Added to PP
2019-04-25

Downloads
19 (#1,080,556)

6 months
3 (#1,477,354)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Mateusz Klonowski
Nicolaus Copernicus University

References found in this work

No references found.

Add more references