The Fmla-Fmla Axiomatizations of the Exactly True and Non-falsity Logics and Some of Their Cousins

Journal of Philosophical Logic 48 (5):787-808 (2019)
  Copy   BIBTEX

Abstract

In this paper we present a solution of the axiomatization problem for the Fmla-Fmla versions of the Pietz and Rivieccio exactly true logic and the non-falsity logic dual to it. To prove the completeness of the corresponding binary consequence systems we introduce a specific proof-theoretic formalism, which allows us to deal simultaneously with two consequence relations within one logical system. These relations are hierarchically organized, so that one of them is treated as the basic for the resulting logic, and the other is introduced as an extension of this basic relation. The proposed bi-consequences systems allow for a standard Henkin-style canonical model used in the completeness proof. The deductive equivalence of these bi-consequence systems to the corresponding binary consequence systems is proved. We also outline a family of the bi-consequence systems generated on the basis of the first-degree entailment logic up to the classic consequence.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 94,045

External links

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

Through your library

Analytics

Added to PP
2019-12-20

Downloads
18 (#828,658)

6 months
9 (#436,380)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Yaroslav Shramko
Kryvyi Rih State Pedagogical University, Ukraine
Dmitry Zaitsev
Lomonosov Moscow State University
Alexander Belikov
Moscow State University

References found in this work

No references found.

Add more references