The unfolding of non-finitist arithmetic
type: Item
instance of: scholarly article
title: The unfolding of non-finitist arithmetic
zbMATH Open document ID: 0959.03048
DOI: 10.1016/S0168-0072(00)00008-7
author: Solomon Feferman
author: Thomas Strahm
published in: Annals of Pure and Applied Logic
publication date: 2001-05-02T00:00:00Z
Mathematics Subject Classification ID: 03F30
Mathematics Subject Classification ID: 03F03
Mathematics Subject Classification ID: 03D75
Mathematics Subject Classification ID: 03D65
zbMATH DE Number: 1501502
zbMATH Keywords: generalized recursion theory
zbMATH Keywords: unfolding of schematic formal systems
zbMATH Keywords: proof-theoretic analysis
zbMATH Keywords: non-finitist arithmetic
zbMATH Keywords: predicative analysis
MaRDI profile type: Publication
cites work: Q3679172
cites work: Reflecting on incompleteness
cites work: Q4202934
cites work: Computation on abstract data types. The extensional approach, with an application to streams
cites work: Q4893132
cites work: Systems of explicit mathematics with non-constructive \(\mu\)-operator. I
cites work: Systems of explicit mathematics with non-constructive \(\mu\)-operator. II
cites work: Systems of explicit mathematics with non-constructive \(\mu\)-operator and join
cites work: Fixed points in Peano arithmetic with ordinals
cites work: The formal language of recursion
cites work: The role of parameters in bar rule and bar induction
cites work: Q4143279
cites work: The non-constructive \(\mu\) operator, fixed point theories with ordinals, and the bar rule
description: scientific article; zbMATH DE number 1501502