Proofs, Programs and Abstract Complexity

DOI10.1007/978-3-540-74915-8_3MaRDI QIDQ3608399zbMATH OpenOpenAlexFDO

Authors Arnold Beckmann

Publication date 5 March 2009

Published in Computer Science Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74915-8_3

zbMATH Keywords

bounded arithmeticdynamic ordinal analysis

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30)

Recommendations

• scientific article; zbMATH DE number 5057388
• Proof theory and ordinal analysis
• scientific article; zbMATH DE number 432700
• scientific article; zbMATH DE number 1390277
• Dynamic ordinal analysis

Cited in

(7)

• scientific article; zbMATH DE number 1980917 (Why is no real title available?)
• Proofs and programs
• scientific article; zbMATH DE number 6315451 (Why is no real title available?)
• Dynamic ordinal analysis
• Proof complexity and beyond. Abstracts from the workshop held August 13--19, 2017
• Generalised dynamic ordinals -- universal measures for implicit computational complexity
• Abstract Combinatorial Programs and Efficient Property Testers

This page was built for publication: Proofs, Programs and Abstract Complexity

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