Artwork

محتوای ارائه شده توسط Ludwig-Maximilians-Universität München and MCMP Team. تمام محتوای پادکست شامل قسمت‌ها، گرافیک‌ها و توضیحات پادکست مستقیماً توسط Ludwig-Maximilians-Universität München and MCMP Team یا شریک پلتفرم پادکست آن‌ها آپلود و ارائه می‌شوند. اگر فکر می‌کنید شخصی بدون اجازه شما از اثر دارای حق نسخه‌برداری شما استفاده می‌کند، می‌توانید روندی که در اینجا شرح داده شده است را دنبال کنید.https://fa.player.fm/legal
Player FM - برنامه پادکست
با برنامه Player FM !

A useful method for obtaining alternative formulations of the analytical hierarchy

1:14:05
 
اشتراک گذاری
 

Fetch error

Hmmm there seems to be a problem fetching this series right now. Last successful fetch was on October 13, 2022 23:55 (2y ago)

What now? This series will be checked again in the next day. If you believe it should be working, please verify the publisher's feed link below is valid and includes actual episode links. You can contact support to request the feed be immediately fetched.

Manage episode 293117467 series 2929680
محتوای ارائه شده توسط Ludwig-Maximilians-Universität München and MCMP Team. تمام محتوای پادکست شامل قسمت‌ها، گرافیک‌ها و توضیحات پادکست مستقیماً توسط Ludwig-Maximilians-Universität München and MCMP Team یا شریک پلتفرم پادکست آن‌ها آپلود و ارائه می‌شوند. اگر فکر می‌کنید شخصی بدون اجازه شما از اثر دارای حق نسخه‌برداری شما استفاده می‌کند، می‌توانید روندی که در اینجا شرح داده شده است را دنبال کنید.https://fa.player.fm/legal
Stanislav O. Speranski (Sobolev Institute of Mathematics) gives a talk at the MCMP Colloquium (6 November, 2014) titled "A useful method for obtaining alternative formulations of the analytical hierarchy". Abstract: In mathematical philosophy one often employs various formal systems and structures for solving philosophical tasks. In particular, many important results in Kripke's theory of truth and the like rest on definability techniques from second-order arithmetic. With this in mind, I will present one useful method for obtaining alternative formulations of the analytical hierarchy. The latter plays a key role in foundations of mathematics and theory of computation, being the generally accepted classification of undecidable problems which capture the truth predicate for first-order arithmetic of natural numbers, and whose computational complexities are less than that of second-order true arithmetic. In the course of the presentation I will mention some relevant contributions of J. Robinson, H. Putnam, J.Y. Halpern, I. Korec and others. Further applications, including those dealing with probabilistic logics, will be discussed in the final part of the talk.
  continue reading

22 قسمت

Artwork
iconاشتراک گذاری
 

Fetch error

Hmmm there seems to be a problem fetching this series right now. Last successful fetch was on October 13, 2022 23:55 (2y ago)

What now? This series will be checked again in the next day. If you believe it should be working, please verify the publisher's feed link below is valid and includes actual episode links. You can contact support to request the feed be immediately fetched.

Manage episode 293117467 series 2929680
محتوای ارائه شده توسط Ludwig-Maximilians-Universität München and MCMP Team. تمام محتوای پادکست شامل قسمت‌ها، گرافیک‌ها و توضیحات پادکست مستقیماً توسط Ludwig-Maximilians-Universität München and MCMP Team یا شریک پلتفرم پادکست آن‌ها آپلود و ارائه می‌شوند. اگر فکر می‌کنید شخصی بدون اجازه شما از اثر دارای حق نسخه‌برداری شما استفاده می‌کند، می‌توانید روندی که در اینجا شرح داده شده است را دنبال کنید.https://fa.player.fm/legal
Stanislav O. Speranski (Sobolev Institute of Mathematics) gives a talk at the MCMP Colloquium (6 November, 2014) titled "A useful method for obtaining alternative formulations of the analytical hierarchy". Abstract: In mathematical philosophy one often employs various formal systems and structures for solving philosophical tasks. In particular, many important results in Kripke's theory of truth and the like rest on definability techniques from second-order arithmetic. With this in mind, I will present one useful method for obtaining alternative formulations of the analytical hierarchy. The latter plays a key role in foundations of mathematics and theory of computation, being the generally accepted classification of undecidable problems which capture the truth predicate for first-order arithmetic of natural numbers, and whose computational complexities are less than that of second-order true arithmetic. In the course of the presentation I will mention some relevant contributions of J. Robinson, H. Putnam, J.Y. Halpern, I. Korec and others. Further applications, including those dealing with probabilistic logics, will be discussed in the final part of the talk.
  continue reading

22 قسمت

همه قسمت ها

×
 
Loading …

به Player FM خوش آمدید!

Player FM در سراسر وب را برای یافتن پادکست های با کیفیت اسکن می کند تا همین الان لذت ببرید. این بهترین برنامه ی پادکست است که در اندروید، آیفون و وب کار می کند. ثبت نام کنید تا اشتراک های شما در بین دستگاه های مختلف همگام سازی شود.

 

راهنمای مرجع سریع