A proof-theoretic characterization of the primitive recursive set functions

DOI10.2307/2275441zbMATH Open0761.03016OpenAlexW2088408332MaRDI QIDQ4032873FDOQ4032873

Authors Michael Rathjen

Publication date 1 April 1993

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

Full work available at URL https://doi.org/10.2307/2275441

zbMATH Keywords

cut-eliminationKripke-Platek set theoryprovably recursive functionsprimitive recursive set functionsaxioms of infinity\(\Sigma_ 1\)-foundationsubsystems of KP

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Nonclassical and second-order set theories (03E70) Recursive functions and relations, subrecursive hierarchies (03D20)

Recommendations

• Provably recursive functions of reflection
• scientific article; zbMATH DE number 2186953
• Computer Science Logic
• scientific article; zbMATH DE number 1215495
• A characterization of the \(\Sigma_1\)-definable functions of \(\text{KP}\omega+(\text{uniform AC})\)

Cites work

• scientific article; zbMATH DE number 3861143 (Why is no real title available?)
• scientific article; zbMATH DE number 3356762 (Why is no real title available?)
• On Weak Theories of Sets and Classes which are Based on Strict ∏‐REFLECTION
• The fine structure of the constructible hierarchy
• The syntax and semantics of infinitary languages

Cited in

(23)

• scientific article; zbMATH DE number 3983154 (Why is no real title available?)
• A simple proof of Parsons' theorem
• Functional interpretation of Aczel's constructive set theory
• AN ORDINAL ANALYSIS OF ADMISSIBLE SET THEORY USING RECURSION ON ORDINAL NOTATIONS
• Cobham recursive set functions and weak set theories
• scientific article; zbMATH DE number 3857076 (Why is no real title available?)
• Theories and ordinals in proof theory
• Characterizing the elementary recursive functions by a fragment of Gödel's \(T\)
• Set-theoretic reflection is equivalent to induction over well-founded classes
• scientific article; zbMATH DE number 1889701 (Why is no real title available?)
• A categorical construction of Bachmann–Howard fixed points
• Rudimentary recursion, gentle functions and provident sets
• Interpreting classical theories in constructive ones
• Provably recursive functions of reflection
• Predicatively computable functions on sets
• A recursion-theoretic characterization of instances of $ΒΣ_n$ provable in $П_{n+1}(N)$
• Computable aspects of the Bachmann-Howard principle
• Productive sets and constructively nonpartial-recursive functions
• scientific article; zbMATH DE number 408791 (Why is no real title available?)
• End extending models of set theory via power admissible covers
• Fragments of Kripke-Platek set theory and the metamathematics of \(\alpha \)-recursion theory
• Logical problems of functional interpretations
• A non-well-founded primitive recursive tree provably well-founded for co-r. e. sets

This page was built for publication: A proof-theoretic characterization of the primitive recursive set functions

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