Outline of a Theory of Truth as Correctness for Semantic Information
Keywords:
Computer Science, Correctness, Information Theory, Philosophy of Information, Semantic information, Truth
Abstract
The article develops a correctness theory of truth (CTT) for semantic information. After the introduction, in section two, semantic information is shown to be translatable into propositional semantic information (i). In section three, i is polarised into a query (Q) and a result (R), qualified by a specific context, a level of abstraction and a purpose. This polarization is normalised in section four, where [Q + R] is transformed into a Boolean question and its relative yes/no answer [Q + A]. This completes the reduction of the truth of i to the correctness of A. In sections five and six, it is argued that (1) A is the correct answer to Q if and only if (2) A correctly saturates (in a Fregean sense) Q by verifying and validating it (in the computer science’s sense of “verification” and “validation”); that (2) is the case if and only if (3) [Q + A] generates an adequate model (m) of the relevant system (s) identified by Q; that (3) is the case if and only if (4) m is a proxy of s (in the computer science’s sense of “proxy”) and (5) proximal access to m commutes with the distal access to s (in the category theory’s sense of “commutation”); and that (5) is the case if and only if (6) reading/writing (accessing, in the computer science’s technical sense of the term) m enables one to read/write (access) s. The last section draws a general conclusion about the nature of CTT as a theory for systems designers not just systems users.
Published
2009-11-06
Issue
Section
Special Issue: What is Really Information? An Interdisciplinary Approach.
tripleC is a peer-reviewed, open-access journal (ISSN: 1726-670X). All journal content, except where otherwise noted, is licensed under the Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Austria License.