Completions of PA and ω-models of KP

Completions of PA and ω-models of KP

by Julia F. Knight

Formal & Physical Sciences Mathematics PBCMathematical foundationsPBCDMathematical logic
🎙 Julia F. Knight 👥 1K 📅 August 22, 2021 ⏱ 44 min 👁 54 📄 lecture 🧭 2026-08-17
Available in: English (current) Français

Keywords

completions of PAω-modelsKripke-Platek set theorycomputable treestree rank

Summary

The talk, presented by Julia F. Knight at the Online International Workshop on Gödel’s Incompleteness Theorems, discusses joint work with Rose Weisshaur and Dan Turetsky on the structure of completions of Peano Arithmetic (PA) and ω-models of Kripke-Platek set theory (KP). The speaker begins by recalling Gödel-Rosser’s incompleteness theorem and introduces two key computable trees: T_PA, whose paths represent completions of PA, and T_KP, whose paths represent complete diagrams of ω-models of KP. She reviews Scott’s theorem characterizing the representable sets of completions of PA as countable Scott sets, and notes that T_PA is universal for binary branching trees. For ω-models of KP, she discusses tree rank and its behavior, showing that in such models, computable trees may have non-standard ranks. She presents results on computing paths through trees using ω-models, including a theorem by Weisshaur on relative ranks, and a counterexample showing that T_KP is not universal. The talk concludes with analogs of Gödel-Rosser for KP and applications to the number of models of completions.

166 words

Critical Evaluation

Value of the Information & Strength of the Argument

The talk presents original research with high value for specialists in mathematical logic. The argumentation is rigorous, building on established results and providing proofs or proof sketches. The speaker carefully explains definitions and theorems, making the content accessible to an expert audience. The use of examples and counterexamples strengthens the argumentation.

Scientific Rigor, Source Quality, Title Accuracy

The talk demonstrates scientific rigor, with clear definitions and references to known theorems (e.g., Scott’s theorem, Barwise’s theorem). The sources are primarily the speaker’s own work and classical results, but no explicit citations are given in the transcript. The title accurately reflects the content. No comments were provided for analysis.

116 words

Title / Content Match

The title accurately reflects the content, which focuses on completions of PA and ω-models of KP.

Quality & Reliability

8/10

The talk is a formal presentation of original research in mathematical logic, with rigorous proofs and references to established theorems. The speaker is an expert, and the content is technically sound. However, the video has low production quality and no peer-review process, and the transcript contains some errors and unclear parts.

Key Moments

Markers derived by PSI from the transcript: the creator did not define chapters.

Cited Sources

Concurring Sources

  • Scott set — Relevant to Scott's theorem on representable sets.

Contribution & Novelties

The talk presents novel results on the structure of ω-models of KP and their relationship to completions of PA, particularly regarding tree ranks and path computability. It extends classical results by Scott and others to the setting of KP.

Pour aller plus loin :

73 words

Radar Profile

The radar profile shows high scores in technical level and information quality, with slightly lower scores in quantity and reliability, reflecting the advanced nature and occasional technical issues in the presentation.

Reliability 8/10