Notations for exponentiation.

DOI10.1016/S0304-3975(01)00143-8zbMath1061.03062MaRDI QIDQ1853509

Arnold Beckmann

Publication date: 21 January 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) First-order arithmetic and fragments (03F30) Descriptive complexity and finite models (68Q19) Relative consistency and interpretations (03F25)

Related Items (1)

Ordinal notations and well-orderings in bounded arithmetic

Cites Work

• Proof theory. An introduction
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Notations for exponentiation.