On the quantifier complexity of \(\Delta_{n+1}(T)\)-induction
type: Item
instance of: scholarly article
title: On the quantifier complexity of \(\Delta_{n+1}(T)\)-induction
zbMATH Open document ID: 1061.03065
author: Alejandro Fernández Margarit
author: F. Félix Lara Martin
author: Andrés Cordón-Franco
published in: Archive for Mathematical Logic
publication date: 2004-12-16T00:00:00Z
Mathematics Subject Classification ID: 03F30
zbMATH DE Number: 2123155
zbMATH Keywords: induction
zbMATH Keywords: \(\Delta_{n+1}\)-formulas
zbMATH Keywords: quantifier complexity
MaRDI profile type: Publication
full work available at URL: s00153-003-0198-7
OpenAlex ID: W1523846338
DOI: 10.1007/S00153-003-0198-7
Recommended article: The quantifier complexity of NF
Recommended article: Q3684112
Recommended article: Q3315499
Recommended article: The quantifier complexity of polynomial-size iterated definitions in first-order logic
Recommended article: On the combinatorial and algebraic complexity of quantifier elimination
Recommended article: Σ_{𝑛}-bounding and Δ_{𝑛}-induction
Recommended article: Inductive Complexity of P versus NP Problem
Recommended article: Q4955353
Recommended article: On the exact complexity of evaluating quantified \(k\)-\textsc{cnf}
Recommended article: Inductive Complexity of Goodstein’s Theorem
description: scientific article; zbMATH DE number 2123155