Computer Theorem Proving in Math
نویسنده
چکیده
We give an overview of issues surrounding computerverified theorem proving in the standard pure-mathematical context.
منابع مشابه
A short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملA common fixed point theorem for weakly compatible maps satisfying common property (E:A:) and implicit relation in intuitionistic fuzzy metric spaces
In this paper, employing the common property ($E.A$), we prove a common fixed theorem for weakly compatible mappings via an implicit relation in Intuitionistic fuzzy metric space. Our results generalize the results of S. Kumar [S. Kumar, {it Common fixed point theorems in Intuitionistic fuzzy metric spaces using property (E.A)}, J. Indian Math. Soc., 76 (1-4) (2009), 94--103] and C. Alaca et al...
متن کاملRace Against the Teens - Benchmarking Mechanized Math on Pre-university Problems
This paper introduces a benchmark problem library for mechanized math technologies including computer algebra and automated theorem proving. The library consists of pre-university math problems taken from exercise problem books, university entrance exams, and the International Mathematical Olympiads. It thus includes problems in various areas of pre-university math and with a variety of difficu...
متن کاملResolution and the integrality of satisfiability problems
A satis ability problem can be regarded as a nondisjoint union of set covering problems We show that if the resolution method of theorem proving is applied to the satis ability problem its constraint set de nes an integral polytope if and only if the constraint sets of the set covering problems do In this sense resolution reduces the integrality question for the satis ability problem to that fo...
متن کاملProving a Heine-Borel Theorem by Analogy
This paper addresses analogy-driven automated theorem proving that employs a source proof-plan to guide the search for a proof-plan of the target problem. The approach presented uses reformulations that go beyond symbol mappings and that incorporate frequently used re-representations and abstractions. Several realistic math examples were successfully processed by our analogy-driven proof-plan c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003