A note on FDE ``all the way up'' (Q778734)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A note on FDE ``all the way up''
scientific article

    Statements

    A note on FDE ``all the way up'' (English)
    0 references
    0 references
    0 references
    20 July 2020
    0 references
    This paper is heavily due to [\textit{G. Priest}, Log. Anal., Nouv. Sér. 27, 238--243 (1984; Zbl 0554.03016); Australas. J. Log. 11, No. 1, 2--13 (2014; Zbl 1330.03058)] both conceptually and technically. The main results of this reviewed paper are plurivalent extentions of \(\mathrm{FDE}\) (First-degree entailment) and \(\mathrm{FDE}_{\phi}\). First, we shall quote the following from Priest [loc. cit., p.~2]: ``In standard logical semantics, formulas take exactly one of a bunch of semantic values. I shall call such semantics `univalent`. In a plurivalent semantics, by contrast, formulas may take one or more such values (maybe even less than one, but I set possibility aside till the last part of this paper).'' The set of truth values treated in this paper is \(\{t, f, b, n, e\}\). The intuitive meanings of \(t, f, b, n, e\) are ``true only''(\(t\)), ``false only''(\(f\)), ``both true and false''(\(b\)), ``neither true nor false'(\(n\)) and ``a non-designated value''(\(e\)), respectively. \(\mathrm{FDE}\) is characterized by \(tfbn\). So is \(\mathrm{FDE}_{\phi}\) by \(tfbne\). The connectives used are only \(\neg\), \(\wedge\) and \(\vee\). The main result of this paper is the following: Theorem. (Theorem 3 and Theorem 4) If \(\models_0\) is the consequence relation for \(\mathrm{FDE}\) \((\mathrm{FDE}_{\phi})\), and \(\models_{\alpha}\) its corresponding \(\alpha\)-plurivalent extension for any ordinal \(\alpha\), then \[\Sigma \models_{\alpha} A \mbox{ iff }\Sigma \models_0 A.\] This is a result extending [\textit{Y. Shramko} and \textit{H. Wansing}, J. Logic Lang. Inf. 15, No. 4, 403--424 (2006; Zbl 1159.03302)] (indirectly) and [\textit{G. Priest}, Log. Anal., Nouv. Sér. 27, 238--243 (1984; Zbl 0554.03016); Australas. J. Log. 11, No. 1, 2--13 (2014; Zbl 1330.03058)]. The proofs of the results are rather straightforward under the appropriate definitions, using a homomorphism. Remarks. There is no theorem cited as ``Priest [15, Theorem~6]'' in p.~284. Theorem~1 in p.~294 should be Theorem~4.
    0 references
    0 references
    plurivalent logic
    0 references
    paraconsistent logic
    0 references
    paracomplete logic
    0 references
    FDE
    0 references
    first-degree entailment
    0 references
    logical consequence
    0 references

    Identifiers