Feferman's completeness theorem

DOI10.1017/BSL.2025.2MaRDI QIDQ6898194zbMATH OpenFDO

Authors Fedor N. Pakhomov, Michael Rathjen, Dino Rossegger

Publication date 18 November 2025

Published in The Bulletin of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/BSL.2025.2

zbMATH Keywords

completeness theoremFefermanreflection principles

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Recursive ordinals and ordinal notations (03F15) First-order arithmetic and fragments (03F30)

Cites work

• A construction for recursive linear orderings
• Computable structures and the hyperarithmetical hierarchy
• Ein System des Verknüpfenden Schliessens
• scientific article; zbMATH DE number 3154788 (Why is no real title available?)
• scientific article; zbMATH DE number 4091484 (Why is no real title available?)
• scientific article; zbMATH DE number 3668596 (Why is no real title available?)
• scientific article; zbMATH DE number 3606451 (Why is no real title available?)
• On the completeness of some transfinite recursive progressions of axiomatic theories
• Pairs of recursive structures
• Proof theoretic analysis by iterated reflection
• Proof-theoretic analysis by iterated reflection
• Reflection ranks and ordinal analysis
• Solution of a problem of Leon Henkin
• Subsystems of second order arithmetic
• Systems of Logic Based on Ordinals^†
• The syntax and semantics of infinitary languages
• Transfinite Progressions: A Second Look at Completeness
• Transfinite recursive progressions of axiomatic theories

Cited in

(1)

• Iterating reflection over intuitionistic arithmetic

This page was built for publication: Feferman's completeness theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6898194)