Automated Deduction in Mathematics
Automated Deduction in Mathematics
批准号:
9503445
负责人:
Kenneth Kunen
金额:
$12.0万
依托单位国家:
美国
项目类别:
Standard Grant
财政年份:
1995
资助国家:
美国
项目状态:
已结题
起止时间:
1995-09-01 至 1997-08-31
中文摘要
点击翻译按钮获取中文摘要
英文摘要
This research addresses problems in in two major areas: (1) Theorem Proving: Automated deduction is being used to derive mathematical theorems whose proofs would not be feasible without computer assistance. Two facets of this research are: 1a. Search Strategies. This is part of a continuing effort to improve current theorem proving technology. Specific investigations involve: generation, model generation, and linked resolution. 1b. Specific Theorems. New areas of application are being sought out, and well- known open problems involving single axioms for groups and the Robbins algebra problem are being studied. These two facets are closely related. Improvements in theorem prover technology can be applied to proving better theorems. Conversely, proving new theorems gives a way of demonstrating the power of the technology, and failed attempts to prove a theorem can suggest ways in which the technology can be improved. (2) Verification: Here, one uses a computer program to verify existing mathematical theorems. One goal is to develop verification systems far enough so that they could be used as referees for mathematical papers. Concentration is on: (a) The Boyer-Moore prover. This works finitistic mathematics, and is probably the best known existing verification system. The current system includes the ability to do induction on the ordinal epsilon_0. Extensions of this prover are being examined, with an eye to allowing induction on larger ordinals. (b) A prover for set theory. Within axiomatic set theory (ZFC), one can develop all of mathematics. A verification system based on ZFC is being designed. This system will borrow features already used in the Boyer-Moore prover and other systems, but major new problems will be addressed. One problem is how to encode meta-rules, such as the scheme for transfinite induction. Another is how to allow the user to extend the system by adding type declarations (corresponding to informal mathematical statements such as ``from now on, x,y,z will represent real numbers'').
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
Applied Mathematical Logic
-
批准号:0456653
-
项目类别:Continuing Grant
-
资助金额:$0.0万
-
财政年份:2005
-
负责人:Kenneth Kunen
-
依托单位:
Applied Mathematical Logic
-
批准号:0097881
-
项目类别:Continuing Grant
-
资助金额:$13.6万
-
财政年份:2001
-
负责人:Kenneth Kunen
-
依托单位:
Applied Mathematical Logic
-
批准号:9704520
-
项目类别:Standard Grant
-
资助金额:$18.0万
-
财政年份:1997
-
负责人:Kenneth Kunen
-
依托单位:
Mathematical Sciences: Applied Mathematical Logic
-
批准号:9100665
-
项目类别:Continuing Grant
-
资助金额:$19.26万
-
财政年份:1991
-
负责人:Kenneth Kunen
-
依托单位:
Mathematical Logic and Foundations
-
批准号:8002132
-
项目类别:Continuing Grant
-
资助金额:$3.38万
-
财政年份:1980
-
负责人:Kenneth Kunen
-
依托单位:
海外基金