Logical omniscience as infeasibility

Annals of Pure and Applied Logic 165 (1):6-25 (2014)
  Copy   BIBTEX

Abstract

Logical theories for representing knowledge are often plagued by the so-called Logical Omniscience Problem. The problem stems from the clash between the desire to model rational agents, which should be capable of simple logical inferences, and the fact that any logical inference, however complex, almost inevitably consists of inference steps that are simple enough. This contradiction points to the fruitlessness of trying to solve the Logical Omniscience Problem qualitatively if the rationality of agents is to be maintained. We provide a quantitative solution to the problem compatible with the two important facets of the reasoning agent: rationality and resource boundedness. More precisely, we provide a test for the logical omniscience problem in a given formal theory of knowledge. The quantitative measures we use are inspired by the complexity theory. We illustrate our framework with a number of examples ranging from the traditional implicit representation of knowledge in modal logic to the language of justification logic, which is capable of spelling out the internal inference process. We use these examples to divide representations of knowledge into logically omniscient and not logically omniscient, thus trying to determine how much information about the reasoning process needs to be present in a theory to avoid logical omniscience.

Other Versions

No versions found

Links

PhilArchive

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2014-01-16

Downloads
128 (#353,718)

6 months
19 (#605,215)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Sergei Artemov
CUNY Graduate Center

Citations of this work

Justification logic.Sergei Artemov - forthcoming - Stanford Encyclopedia of Philosophy.
No Rationality Through Brute-Force.Danilo Fraga Dantas - 2017 - Filosofia Unisinos 18 (3):195-200.
Computational Complexity Theory.Walter Dean - 2015 - Stanford Encyclopedia of Philosophy.

View all 9 citations / Add more citations

References found in this work

Minds, brains, and programs.John Searle - 1980 - Behavioral and Brain Sciences 3 (3):417-57.
Universal grammar.Richard Montague - 1970 - Theoria 36 (3):373--398.
Belief, awareness, and limited reasoning.Ronald Fagin & Joseph Y. Halpern - 1987 - Artificial Intelligence 34 (1):39-76.

View all 18 references / Add more references