A remark on functional completeness of binary expansions of Kleene’s strong 3-valued logic

Logic Journal of the IGPL 30 (1):21-33 (2022)
  Copy   BIBTEX

Abstract

A classical result by Słupecki states that a logic L is functionally complete for the 3-element set of truth-values THREE if, in addition to functionally including Łukasiewicz’s 3-valued logic Ł3, what he names the ‘$T$-function’ is definable in L. By leaning upon this classical result, we prove a general theorem for defining binary expansions of Kleene’s strong logic that are functionally complete for THREE.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,672

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

Four-Valued Logics BD and DM4: Expansions.Alexander S. Karpenko - 2017 - Bulletin of the Section of Logic 46 (1/2).
Sentential Falsehood Logic FL4.Sergey Pavlov - 1998 - The Paideia Archive: Twentieth World Congress of Philosophy 8:112-117.
Process algebra with four-valued logic.Jan A. Bergstra & Alban Ponse - 2000 - Journal of Applied Non-Classical Logics 10 (1):27-53.
The Strong Completeness of a System for Kleene's Three‐Valued Logic.John T. Kearns - 1979 - Mathematical Logic Quarterly 25 (3‐6):61-68.

Analytics

Added to PP
2020-07-28

Downloads
16 (#902,419)

6 months
10 (#262,545)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Gemma Robles
Universidad de León
José M. Méndez
Universidad de Salamanca