Predicative provability in set theory

Feferman, S.

doi:10.1090/S0002-9904-1966-11509-4

Bulletin of the American Mathematical Society

The Bulletin publishes expository articles on contemporary mathematical research, written in a way that gives insight to mathematicians who may not be experts in the particular topic. The Bulletin also publishes reviews of selected books in mathematics and short articles in the Mathematical Perspectives section, both by invitation only.

ISSN 1088-9485 (online) ISSN 0273-0979 (print)

The 2020 MCQ for Bulletin of the American Mathematical Society is 0.84.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

Predicative provability in set theory
HTML articles powered by AMS MathViewer

by S. Feferman PDF

Bull. Amer. Math. Soc. 72 (1966), 486-489

References

Solomon Feferman, Systems of predicative analysis, J. Symbolic Logic 29 (1964), 1–30. MR 193006, DOI 10.2307/2269764
S. Feferman and G. Kreisel, Persistent and invariant formulas relative to theories of higher order, Bull. Amer. Math. Soc. 72 (1966), 480–485. MR 193007, DOI 10.1090/S0002-9904-1966-11507-0

Additional Information

Journal: Bull. Amer. Math. Soc. 72 (1966), 486-489
DOI: https://doi.org/10.1090/S0002-9904-1966-11509-4
MathSciNet review: 0193008