Natural Deduction for Three-Valued Regular Logics

Logic and Logical Philosophy 26 (2):197–206 (2017)
  Copy   BIBTEX

Abstract

In this paper, I consider a family of three-valued regular logics: the well-known strong and weak S.C. Kleene’s logics and two intermedi- ate logics, where one was discovered by M. Fitting and the other one by E. Komendantskaya. All these systems were originally presented in the semantical way and based on the theory of recursion. However, the proof theory of them still is not fully developed. Thus, natural deduction sys- tems are built only for strong Kleene’s logic both with one (A. Urquhart, G. Priest, A. Tamminga) and two designated values (G. Priest, B. Kooi, A. Tamminga). The purpose of this paper is to provide natural deduction systems for weak and intermediate regular logics both with one and two designated values.

Links

PhilArchive

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Partiality and its dual.J. Michael Dunn - 2000 - Studia Logica 66 (1):5-40.
Relational Semantics for Kleene Logic and Action Logic.Katalin Bimbó & J. ~Michael Dunn - 2005 - Notre Dame Journal of Formal Logic 46 (4):461-490.
A natural deduction system for first degree entailment.Allard M. Tamminga & Koji Tanaka - 1999 - Notre Dame Journal of Formal Logic 40 (2):258-272.
Rough Sets and 3-Valued Logics.A. Avron & B. Konikowska - 2008 - Studia Logica 90 (1):69-92.

Analytics

Added to PP
2017-10-24

Downloads
1,000 (#12,857)

6 months
487 (#3,046)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Yaroslav Petrukhin
Moscow State University