Notations for exponentiation.

DOI10.1016/S0304-3975(01)00143-8MaRDI QIDQ1853509zbMATH OpenFDO

Authors Arnold Beckmann

Publication date 21 January 2003

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

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4006252
• Exponentiation and second-order bounded arithmetic
• scientific article; zbMATH DE number 15882
• Finite automata, real time processes and counting problems in bounded arithmetics
• A new “feasible” arithmetic

Cites work

• scientific article; zbMATH DE number 3857078 (Why is no real title available?)
• scientific article; zbMATH DE number 4160722 (Why is no real title available?)
• scientific article; zbMATH DE number 4059391 (Why is no real title available?)
• scientific article; zbMATH DE number 819737 (Why is no real title available?)
• scientific article; zbMATH DE number 227056 (Why is no real title available?)
• scientific article; zbMATH DE number 3305097 (Why is no real title available?)
• scientific article; zbMATH DE number 963569 (Why is no real title available?)
• Proof theory. An introduction

Cited in

(2)

• Infix and postfix notations
• Ordinal notations and well-orderings in bounded arithmetic

This page was built for publication: Notations for exponentiation.

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