Epistemic entrenchment and arithmetical
✍
Petr Hájek
📂
Article
📅
1993
🏛
Elsevier Science
🌐
English
⚖ 467 KB
Hfijek, P., Epistemic entrenchment and arithmetical hierarchy (Research Note), Artificial Intelligence 62 (1993) 79-87. If the underlying theory is sufficiently rich (e.g. like first-order arithmetic), then no epistemic entrenchment preorder of sentences is recursively enumerable. Consequently, the