The unfolding of non-finitist arithmetic
Copyright policy )The unfolding of non-finitist arithmetic
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
- Department of Mathematics Stanford University United States
- University of Bern Switzerland
- Stanford University United States
Non-finitist arithmetic, First-order arithmetic and fragments, Proof theory in general (including proof-theoretic semantics), Logic, Schematic formal systems, Generalized recursion theory, generalized recursion theory, proof-theoretic analysis, unfolding of schematic formal systems, non-finitist arithmetic, Higher-type and set recursion theory, Predicative analysis, predicative analysis, Abstract and axiomatic computability and recursion theory
Non-finitist arithmetic, First-order arithmetic and fragments, Proof theory in general (including proof-theoretic semantics), Logic, Schematic formal systems, Generalized recursion theory, generalized recursion theory, proof-theoretic analysis, unfolding of schematic formal systems, non-finitist arithmetic, Higher-type and set recursion theory, Predicative analysis, predicative analysis, Abstract and axiomatic computability and recursion theory
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).26 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!