کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4661858 1633476 2013 6 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
About Goodmanʼs Theorem
ترجمه فارسی عنوان
درباره قضیه گودمن
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات منطق ریاضی
چکیده انگلیسی

We present a proof of Goodmanʼs Theorem, which is a variation of the proof of Renaldel de Lavalette (1990) [9]. This proof uses in an essential way possibly divergent computations for proving a result which mentions systems involving only terminating computations. Our proof is carried out in a constructive metalanguage. This involves implicitly a covering relation over arbitrary posets in formal topology, which occurs in forcing in set theory in a classical framework, but can also be defined constructively.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Annals of Pure and Applied Logic - Volume 164, Issue 4, April 2013, Pages 437-442