scientific article; zbMATH DE number 5053656

zbMATH Open1098.03067MaRDI QIDQ5488131FDOQ5488131

Authors: Vítězslav Švejdar 

Publication date: 13 September 2006

Full work available at URL: https://eudml.org/doc/22714

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 123920
• Fragments of bounded arithmetic and the lengths of proofs
• scientific article; zbMATH DE number 6451301

zbMATH Keywords

recursive functionsfragments of arithmeticcollection schemelimit lemmaaxiomatisation of arithmetic

Mathematics Subject Classification ID

Hierarchies of computability and definability (03D55) First-order arithmetic and fragments (03F30) Recursive functions and relations, subrecursive hierarchies (03D20)

Cited In (1)

• On the indecomposability of \(\omega^n\)

This page was built for publication:

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