On the proof theory of type two functionals based on primitive recursive operations

DOI10.1002/MALQ.200510029zbMATH Open1106.03048OpenAlexW2042394498MaRDI QIDQ5485397FDOQ5485397

Authors David Steiner, Thomas Strahm 

Publication date 30 August 2006

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.200510029

zbMATH Keywords

proof theoryprimitive recursionapplicative theoriestype-two functionals

Mathematics Subject Classification ID

Second- and higher-order arithmetic and fragments (03F35) Functionals in proof theory (03F10)

Recommendations

• scientific article; zbMATH DE number 1870423
• A proof-theoretic characterization of the basic feasible functionals
• Totality in applicative theories
• scientific article; zbMATH DE number 4099295
• scientific article; zbMATH DE number 432705

Cites Work

• scientific article; zbMATH DE number 3900744 (Why is no real title available?)
• scientific article; zbMATH DE number 1870423 (Why is no real title available?)
• scientific article; zbMATH DE number 2222014 (Why is no real title available?)
• A theory of rules for enumerated classes of functions
• Constructivism in mathematics. An introduction. Volume I
• Polytime, combinatory logic and positive safe induction

Cited In (4)

• Title not available (Why is no real title available?)
• Title not available (Why is no real title available?)
• Title not available (Why is no real title available?)
• Title not available (Why is no real title available?)

This page was built for publication: On the proof theory of type two functionals based on primitive recursive operations

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