2021/09/06 by Fedor Pakhomov, Pakhomov, Fedor, Albert Visser +1
Computer Science · Mathematics · #03F25 #Advanced Topology and Set Theory #Computability, Logic, AI Algorithms #F.4.1 #FOS: Mathematics #Logic (math.LO) #Logic, Reasoning, and Knowledge
paper · pdf · doi:10.48550/arxiv.2109.02548
openalex publication_date 2021/09/06 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper we prove that no consistent finitely axiomatized theory one-dimensionally interprets its own extension with predicative comprehension. This constitutes a result with the flavor of the Second Incompleteness Theorem whose formulation is completely arithmetic-free. Probably the most important novel feature that distinguishes our result from the previous results of this kind is that it is applicable to arbitrary weak theories, rather than to extensions of some base theory. The methods used in the proof of the main result yield a new perspective on the notion of sequential theory, in the setting of forcing-interpretations.