Switch to: Citations

References in:

On some formalized conservation results in arithmetic

P. Clote, P. Hájek & J. Paris

Archive for Mathematical Logic 30 (4):201-218 (1990)

Add references

You must login to add references.

A course in mathematical logic.J. L. Bell - 1977 - New York: sole distributors for the U.S.A. and Canada American Elsevier Pub. Co.. Edited by Moshé Machover.details A comprehensive one-year graduate (or advanced undergraduate) course in mathematical logic and foundations of mathematics. No previous knowledge of logic is required; the book is suitable for self-study. Many exercises (with hints) are included. Download Export citation Bookmark 48 citations
On the scheme of induction for bounded arithmetic formulas.A. J. Wilkie & J. B. Paris - 1987 - Annals of Pure and Applied Logic 35 (C):261-302.details Download Export citation Bookmark 96 citations
On recursion theory in I∑.Petr Hájek & Antonín Kučera - 1989 - Journal of Symbolic Logic 54 (2):576 - 589.details It is shown that the low basis theorem is meaningful and provable in I∑ 1 and that the priority-free solution to Post's problem formalizes in this theory. Download Export citation Bookmark 3 citations
On Recursion Theory in $Isum_1$.Petr Hajek & Antonin Kucera - 1989 - Journal of Symbolic Logic 54 (2):576-589.details It is shown that the low basis theorem is meaningful and provable in $I\sum_1$ and that the priority-free solution to Post's problem formalizes in this theory. Download Export citation Bookmark 3 citations

1