The actual introduction of a non-reflexive and non-idempotent q-consequence gave birth to the concept of logical three-valuedness based on the idea of noncomplementary categories of rejection and acceptance. A q-consequence may not have bivalent description, the property claimed by Suszko's Thesis on logical two-valuedness, (ST ), of structural logics, i.e. structural consequence operations. Recall that (ST ) shifts logical values over the set of matrix values and it refers to the division of matrix universe into two subsets of designated and undesignated elements using their characteristic functions as logical valuations, cf.[4] The extension of the idea operates with three-valued function, with the third value ascribed to those elements of the matrix which are neither rejected nor accepted. Accordingly, the logical three-valuedness departs naturally from the division of the matrix universe into three subsets and the (ST ) counterpart says that any inference based on a structural q-consequence may have a bivalent or a three-valued description.After a short presentation of the three-valued inferential framework, we discuss a solution for further exploration of the idea leading to logical n-valuedness for n > 3. Apparently, the first step in that direction is easy and it consists of a division of the matrix universe into more than three subsets. The next move, i.e. a definition of a matrix consequence-like relation being neither a consequence nor a q-consequence, seems extremely difficult. Therefore, here we consider only finite linear matrices with one-argument functions "labelling" respective matrix subsets. By means of these functions it is possible to represent a q-consequence as a "partial" Tarski's consequence and, ultimately, to define a logically more-valued consequence-like relation. We believe, that the present partial proposal deserves an attention by itself but also that it may lead to a general approach to logically many-valued inference.
Referential semantics importantly subscribes to the programme of theory of logical calculi. Defined by Wójcicki in [8], it has been subsequently studied in a series of papers of the author, till the full exposition of the framework in [9] and its intuitive characterisation in [10].The aim of the article is to present several generalizations of referential semantics as compared and related to the matrix semantics for propositional logics. We show, in a uniform way, some own generalizations of referentiality: the first, directed to unrestricted cluster referential semantics, [4], its "discrete" version, a counterpart of algebraic semantics and a many-valued referentiality based on matrices, whose elements are functions from the set of indices to a finite n-element set of values, n ≥2, [3]. Next to this we outline pragmatic matrices introduced by Tokarz in [6] as an alternative for cluster referential approach and discuss together all presented versions of referential semantics.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.