کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
8906108 | 1634013 | 2018 | 16 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Arithmetical conservation results
ترجمه فارسی عنوان
نتایج حفاظت ریاضی
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات (عمومی)
چکیده انگلیسی
In this paper we present a proof of Goodman's Theorem, a classical result in the metamathematics of constructivism, which states that the addition of the axiom of choice to Heyting arithmetic in finite types does not increase the collection of provable arithmetical sentences. Our proof relies on several ideas from earlier proofs by other authors, but adds some new ones as well. In particular, we show how a recent paper by Jaap van Oosten can be used to simplify a key step in the proof. We have also included an interesting corollary for classical systems pointed out to us by Ulrich Kohlenbach.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Indagationes Mathematicae - Volume 29, Issue 1, February 2018, Pages 260-275
Journal: Indagationes Mathematicae - Volume 29, Issue 1, February 2018, Pages 260-275
نویسندگان
Benno van den Berg, Lotte van Slooten,