We suggest a tractable algorithm for assigning probabilities to sentences of firstorder logic and updating those probabilities on the basis of observations. The core technical difficulty is relaxing the constraints of logical consistency in a way that is appropriate for bounded reasoners, without sacrificing the ability to make useful logical inferences or update correctly on evidence. Using this framework, we discuss formalizations of some issues in the epistemology of mathematics. We show how mathematical theories can be understood as latent structure constraining physical observations, and consequently how realistic observations can provide evidence about abstract mathematical facts. We also discuss the relevance of these ideas to general intelligence.
[1]
Abram Demski.
Logical Prior Probability
,
2012,
AGI.
[2]
Jürgen Schmidhuber,et al.
A Family of Gödel Machine Implementations
,
2011,
AGI.
[3]
Marcus Hutter,et al.
Probabilities on Sentences in an Expressive Logic
,
2012,
J. Appl. Log..
[4]
Marcus Hutter,et al.
A Theory of Universal Artificial Intelligence based on Algorithmic Complexity
,
2000,
ArXiv.
[5]
Haim Gaifman,et al.
Reasoning with Limited Resources and Assigning Probabilities to Arithmetical Statements
,
2004,
Synthese.