Paradoxes of rational agency and formal systems that verify their own soundness
By N. Weaver. 2013
8 citations recorded by the source corpus.
We consider extensions of Peano arithmetic which include an assertibility predicate. Any such system which is arithmetically sound effectively verifies its own soundness. This leads to the resolution of a range of paradoxes involving rational agents who are licensed to act under precisely defined conditions.
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- Dan Dewey
- Stuart J. Russell
- Max Tegmark
- Stuart Armstrong
- Vaishak Belle
- Jan Leike
- Tom Everitt
- Pieter Abbeel
Citations in the corpus
- Research Priorities for Robust and Beneficial Artificial Intelligence (2015, background): “…general setting presents new difficulties, including the challenge that a formal system that is sufficiently powerful cannot use formal methods in the obvious way to gain assurance about the accuracy of functionally similar formal systems, on pain of inconsistency via G¨odel’s incompleteness [55, 56].”