Recommendations
Cites work
- scientific article; zbMATH DE number 3880651 (Why is no real title available?)
- scientific article; zbMATH DE number 3652325 (Why is no real title available?)
- scientific article; zbMATH DE number 3501006 (Why is no real title available?)
- scientific article; zbMATH DE number 3510287 (Why is no real title available?)
- scientific article; zbMATH DE number 3627183 (Why is no real title available?)
- scientific article; zbMATH DE number 3237829 (Why is no real title available?)
- scientific article; zbMATH DE number 3329919 (Why is no real title available?)
- A Decision Procedure for the First Order Theory of Real Addition with Order
- A uniform method for proving lower bounds on the computational complexity of logical theories
- The complexity of logical theories
- The first order properties of products of algebraic systems
- The theory of integer multiplication with order restricted to primes is decidable
- Weak Second‐Order Arithmetic and Finite Automata
Cited in
(4)
This page was built for publication: Exact complexity bounds for ordinal addition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q671516)