Predicate Calculus, Well-Formed Formulas, and Theorems

Monty Newborn ()
Additional contact information
Monty Newborn: McGill University, School of Computer Science

Chapter 2 in Automated Theorem Proving, 2001, pp 7-20 from Springer

Abstract: Abstract When proving a theorem, it is first necessary to write the axioms, the hypotheses, and the conclusion. Deciding what axioms to choose in the first place is crucial to the success of a theorem prover, but that problem is peripheral to the presentation that follows. In general, there is no procedure for deciding what axioms are necessary or sufficient. In some problem domains, standard sets of axioms are known and used. For example, in group theory and in Euclidean geometry, many researchers use the axioms given in Sections 2.5 and 2.6, respectively.

Date: 2001
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4613-0089-2_2

Ordering information: This item can be ordered from
http://www.springer.com/9781461300892

DOI: 10.1007/978-1-4613-0089-2_2

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().