Representability in some systems of second order arithmetic

DOI10.1007/BF02798678MaRDI QIDQ2545877zbMATH OpenFDO

Authors Peter Aczel

Publication date 1970

Published in Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02798678

Mathematics Subject Classification ID

Second- and higher-order arithmetic and fragments (03F35)

Cites work

• An infinitistic rule of proof
• Hierarchies of Effective Descriptive Set Theory
• Hyperanalytic Predicates
• Recursive Functionals and Quantifiers of Finite Types I
• Recursive Functionals and Quantifiers of Finite Types II
• The classical and the ω-complete arithmetic

Cited in

(5)

• On computability with functionals
• Recursion in Kolmogorov's R-operator and the ordinal σ₃
• Recursion in a quantifier vs. elementary induction
• Hyperarithmetically Encodable Sets
• A proof of Grilliot's theorem

This page was built for publication: Representability in some systems of second order arithmetic

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