Representability in some systems of second order arithmetic

DOI10.1007/BF02798678zbMATH Open0216.00602MaRDI QIDQ2545877FDOQ2545877

Authors: Peter Aczel 

Publication date: 1970

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

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

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)