Parameter free induction and provably total computable functions
type: Item
instance of: scholarly article
title: Parameter free induction and provably total computable functions
zbMATH Open document ID: 0930.03082
DOI: 10.1016/S0304-3975(98)00305-3
published in: Theoretical Computer Science
publication date: 2000-01-12T00:00:00Z
Mathematics Subject Classification ID: 03F30
Mathematics Subject Classification ID: 03D20
Mathematics Subject Classification ID: 03F45
Mathematics Subject Classification ID: 03B70
zbMATH DE Number: 1387343
zbMATH Keywords: parameter free induction
zbMATH Keywords: provably total computable functions
zbMATH Keywords: reflection principles
zbMATH Keywords: fast growing hierarchy
zbMATH Keywords: Kalmar elementary arithmetic
zbMATH Keywords: provability logic
author: Lev D. Beklemishev
MaRDI profile type: Publication
cites work: Functions provably total in $I^{-}Σ_{n}$
cites work: Iterated local reflection versus iterated consistency
cites work: Proof-theoretic analysis by iterated reflection
cites work: Induction rules, reflection principles, and provably recursive functions
cites work: Q4364507
cites work: Reflection principles and provability algebras in formal arithmetic
cites work: On Σ1‐definable Functions Provably Total in I ∏
cites work: Q4397069
cites work: Q3773880
cites work: Q5286672
cites work: Parameter-Free Universal Induction
cites work: On parameter free induction schemas
cites work: Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems
cites work: The optimality of induction as an axiomatization of arithmetic
cites work: Hierarchies of number-theoretic functions II
cites work: Reflection Principles in Fragments of Peano Arithmetic
cites work: Q5600870
cites work: On n-quantifier induction
cites work: Q3325707
cites work: Q3866106
cites work: Self-reference and modal logic
cites work: Transfinite induction within Peano arithmetic
cites work: On the scheme of induction for bounded arithmetic formulas
Recommended article: Local induction and provably total computable functions
Recommended article: Computer Science Logic
Recommended article: Q4537505
Recommended article: Q4793030
Recommended article: Local Induction and Provably Total Computable Functions: A Case Study
Recommended article: On induction-free provability
Recommended article: Parameter-Free Universal Induction
Recommended article: Q5875420
Recommended article: On A Problem Concerning Parameter Free Induction
Recommended article: Q3773880
description: scientific article; zbMATH DE number 1387343