We present an informational view of classical propositional logic that stems from a kind of informational semantics whereby the meaning of a logical operator is specified solely in terms of the information that is actually possessed by an agent. In this view the inferential power of logical agents is naturally bounded by their limited capability of manipulating “virtual information”, namely information that is not implicitly contained in the data. Although this informational semantics cannot be expressed by any finitely- valued matrix, it can be expressed by a non-deterministic 3-valued matrix that was first introduced by W.V.O. Quine, but ignored by the logical community. Within the general framework presented in [21] we provide an in-depth discussion of this informational semantics and a detailed analysis of a specific infinite hierarchy of tractable approximations to classical propositional logic that is based on it. This hierarchy can be used to model the inferential power of resource-bounded agents and admits of a uniform proof-theoretical characterization that is half-way between a classical version of Natural Deduction and the method of semantic tableaux.
An informational view of classical logic / M. D'Agostino. - In: THEORETICAL COMPUTER SCIENCE. - ISSN 0304-3975. - 606(2015 Nov), pp. 79-97. [10.1016/j.tcs.2015.06.057]
An informational view of classical logic
M. D'AgostinoPrimo
2015
Abstract
We present an informational view of classical propositional logic that stems from a kind of informational semantics whereby the meaning of a logical operator is specified solely in terms of the information that is actually possessed by an agent. In this view the inferential power of logical agents is naturally bounded by their limited capability of manipulating “virtual information”, namely information that is not implicitly contained in the data. Although this informational semantics cannot be expressed by any finitely- valued matrix, it can be expressed by a non-deterministic 3-valued matrix that was first introduced by W.V.O. Quine, but ignored by the logical community. Within the general framework presented in [21] we provide an in-depth discussion of this informational semantics and a detailed analysis of a specific infinite hierarchy of tractable approximations to classical propositional logic that is based on it. This hierarchy can be used to model the inferential power of resource-bounded agents and admits of a uniform proof-theoretical characterization that is half-way between a classical version of Natural Deduction and the method of semantic tableaux.File | Dimensione | Formato | |
---|---|---|---|
TCS2015.pdf
accesso aperto
Descrizione: Articolo Principale
Tipologia:
Pre-print (manoscritto inviato all'editore)
Dimensione
588.69 kB
Formato
Adobe PDF
|
588.69 kB | Adobe PDF | Visualizza/Apri |
1-s2.0-S0304397515005678-main.pdf
accesso riservato
Tipologia:
Publisher's version/PDF
Dimensione
601.19 kB
Formato
Adobe PDF
|
601.19 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.