A recursion-theoretic characterization of instances of $ΒΣ_n$ provable in $П_{n+1}(N)$

DOI10.4064/FM-129-3-231-236zbMATH Open0658.03035OpenAlexW1011450241MaRDI QIDQ3807195

Zofia Adamowicz

Publication date: 1988

Published in: Fundamenta Mathematicae (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/211664

zbMATH Keywords

provability of arithmetical formulas

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30)

Related Items (2)

An extension of the nondiamond theorem in classical and α-recursion theory ⋮ Another Proof That $\mathcal{BPP}\subseteq \mathcal{PH}$ (and More)

Recommendations

• Title not available (Why is that?) 👍 👎
• A new recursive theorem on \(n\)-extendibility 👍 👎
• On the Existence and Recursion Theoretic Properties of ∑n1-Generic Sets of Reals 👍 👎
• Independence Results for n-Ary Recursion Theorems 👍 👎
• On recursion theory in IΣ₁ 👍 👎
• A combinatorial analysis of functions provably recursive in $ΙΣ_n$ 👍 👎
• A proof-theoretic characterization of the primitive recursive set functions 👍 👎
• A recursion theoretic property of $\mathbf {\Sigma ^1_1}$ equivalence relations 👍 👎
• A Note on BΣ_n and an Intermediate Induction Schema 👍 👎
• Σ_{𝑛}-bounding and Δ_{𝑛}-induction 👍 👎

This page was built for publication: A recursion-theoretic characterization of instances of $ΒΣ_n$ provable in $П_{n+1}(N)$

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