On the quantifier complexity of _n+1(T)-induction
From MaRDI portal
Publication:701734
DOI10.1007/S00153-003-0198-7zbMATH Open1061.03065OpenAlexW1523846338MaRDI QIDQ701734FDOQ701734
Authors: Alejandro Fernández Margarit, F. Félix Lara Martin, Andrés Cordón-Franco 
Publication date: 16 December 2004
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00153-003-0198-7
Recommendations
- The quantifier complexity of NF
- scientific article; zbMATH DE number 3906484
- scientific article
- The quantifier complexity of polynomial-size iterated definitions in first-order logic
- On the combinatorial and algebraic complexity of quantifier elimination
- Σ_{𝑛}-bounding and Δ_{𝑛}-induction
- Inductive complexity of P versus NP problem (extended abstract)
- scientific article; zbMATH DE number 1453080
- On the exact complexity of evaluating quantified \(k\)-\textsc{cnf}
- Inductive Complexity of Goodstein’s Theorem
Cited In (12)
- Title not available (Why is that?)
- Induction, minimization and collection for \(\Delta_{n+1}(T)\)-formulas
- On complexity reduction of \(\Sigma_1\) formulas
- Fragments of Arithmetic and true sentences
- Envelopes, indicators and conservativeness
- \(\Delta_ 0\)-complexity of the relation \(y= \prod_{i\leq n} F(i)\)
- On the induction schema for decidable predicates
- Title not available (Why is that?)
- On the limit existence principles in elementary arithmetic and \(\varSigma_{n}^{0}\)-consequences of theories
- On axiom schemes for \(T\)-provably \(\Delta_1\) formulas
- A note on parameter free \(\Pi _{1}\)-induction and restricted exponentiation
- On the Quantifier-Free Dynamic Complexity of Reachability
This page was built for publication: On the quantifier complexity of \(\Delta_{n+1}(T)\)-induction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q701734)
