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

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})\)

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)

Cites Work

• The fine structure of the constructible hierarchy
• Title not available (Why is that?)
• Title not available (Why is that?)
• The syntax and semantics of infinitary languages
• On Weak Theories of Sets and Classes which are Based on Strict ∏‐REFLECTION

Cited In (20)

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