Exponentiation and second-order bounded arithmetic
From MaRDI portal
Publication:922540
DOI10.1016/0168-0072(90)90023-UzbMATH Open0711.03025MaRDI QIDQ922540FDOQ922540
Authors: Jan Krajíček
Publication date: 1990
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Recommendations
Cites Work
Cited In (12)
- Notations for exponentiation.
- Quantified propositional calculus and a second-order theory for NC\(^{\text \textbf{1}}\)
- The equivalence of theories that characterize ALogTime
- Notes on polynomially bounded arithmetic
- Title not available (Why is that?)
- Consistency of circuit evaluation, extended resolution and total NP search problems
- Title not available (Why is that?)
- On induction-free provability
- Implicit proofs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Exponentiation and second-order bounded arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q922540)