Proofs, Programs and Abstract Complexity

DOI10.1007/978-3-540-74915-8_3zbMath1177.03059OpenAlexW1516486485MaRDI QIDQ3608399

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)

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