On a strengthening of Kotlarski's theorem

2016/12/21 by Evgeny Dashkov, Dashkov, Evgeny
Computer Science · #Advanced Algebra and Logic #Computability, Logic, AI Algorithms #FOS: Mathematics #Logic (math.LO) #Logic, Reasoning, and Knowledge

paper · pdf · doi:10.48550/arxiv.1612.06966

openalex publication_date 2016/12/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Kotlarski's theorem (see H. Kotlarski. Bounded Induction and Satisfaction Classes. Mathematical Logic Quarterly, vol. 32, 31-34, 1986, P. 531--544.) formalized in WKL₀.

Related

• Eberlein-Smulian compactness and Kolmogorov extension theorems; a model theoretic approach
• Satisfaction classes in nonstandard models of first-order arithmetic
• Satisfaction relations for proper classes: Applications in logic and set theory
• Tamarkin's proof of Kontsevich formality theorem
• Another proof of M. Kontsevich formality theorem