کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6424853 | 1633493 | 2011 | 14 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
The provably terminating operations of the subsystem PETJ of explicit mathematics
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
منطق ریاضی
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
In Spescha and Strahm (2009) [15], a system PET of explicit mathematics in the style of Feferman (1975, 1978) [6,7] is introduced, and in Spescha and Strahm (in press) [16] the addition of the join principle to PET is studied. Changing to intuitionistic logic, it could be shown that the provably terminating operations of PETJi are the polytime functions on binary words. However, although strongly conjectured, it remained open whether the same holds true for the corresponding theory PETJ with classical logic. This note supplements a proof of this conjecture.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Annals of Pure and Applied Logic - Volume 162, Issue 11, November 2011, Pages 934-947
Journal: Annals of Pure and Applied Logic - Volume 162, Issue 11, November 2011, Pages 934-947
نویسندگان
D. Probst,