Formalizing Scientifically Applicable Mathematics in a Definitional Framework

نویسندگان

  • Arnon Avron
  • Liron Cohen
چکیده

In [3] a new framework for formalizing mathematics was developed. The main new features of this framework are that it is based on the usual first-order set theoretical foundations of mathematics (in particular, it is type-free), but it reflects real mathematical practice in making an extensive use of statically defined abstract set terms of the form {x |φ}, in the same way they are used in ordinary mathematical discourse. In this paper we outline how the fundamental scientifically applicable mathematics is straightforwardly developed in this framework in the usual way, using a rather weak predicatively acceptable set theory. The key property of the theory is that every object which is used is defined by some closed term of the theory. This allows for a very concrete, computationally-oriented interpretation of the theory. However, the development is not committed to such interpretation, and can easily be extended for handling stronger set theories (including ZF ).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Applicable Mathematics in a Minimal Computational Theory of Sets

In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored. In this work we first improve that framework by enriching it with means for coherently extending by definitions its theories, without destroying its static n...

متن کامل

A Minimal Computational Theory of a Minimal Computational Universe

In [3] a general logical framework for formalizing set theories of different strength was suggested. We here employ that framework, focusing on the exploration of computational theories. That is, theories whose set of closed terms suffices for denoting every concrete set (including infinite ones) that might be needed in applications, as well as for computations with sets. We demonstrate that al...

متن کامل

The Constructive Hilbert Program and the Limits of Martin-Löf Type Theory

Hilbert’s program is one of the truly magnificent projects in the philosophy of mathematics. To carry out this program he founded a new discipline of mathematics, called “Beweistheorie”, which was to perform the task of laying to rest all worries about the foundations of mathematics once and for all1 by securing mathematics via an absolute proof of consistency. The failure of Hilbert’s finitist...

متن کامل

Why a Little Bit Goes a Long Way: Logical Foundations of Scientifically Applicable Mathematics 1

We have good reason to believe our best scientific theories, and mathematical entities are indispensable to those theories, so we have good reason to believe in mathematical entities. Mathematics is thus on an ontological par with natural science. Furthermore, the evidence that confirms scientific theories also confirms the required mathematics, so mathematics and science are on an epistemologi...

متن کامل

Formalizing Mathematics via Predicative and Constructive Approaches

Formalized mathematics and mathematical knowledge management (MKM) are extremely fruitful and quickly expanding fields of research at the intersection of mathematics and computer science. The declared goal of these fields is to develop computerized systems that effectively represent all important mathematical knowledge and techniques, while conforming to the highest standards of mathematical ri...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Formalized Reasoning

دوره 9  شماره 

صفحات  -

تاریخ انتشار 2016