Self-reference and incompleteness in a non-monotonic setting (Q1332147)

The autor proves analogues of Gödel's first incompleteness theorem in a nonmonotonic setting. Let \(M\) be the ``tree-representation'' of an axiomatic theory involving nonmonotonic, i.e. inductive or other risky inferences. Suppose that \(M\) is deterministic (it has an effective successor relation) and it satisfies a reflection principle of type \(T\). Then, regardless of what inductive means are available in \(M\), ``there is a sentence of complexity \(T\) or less which is undecidable in the structure'' (p. 447). However, ``there are consistent, complete and deterministic structures containing elementary number theory'' (p. 448). The paper has strong impact in philosophy of mathematics.