The Use of Symbolic Logic in Proving Mathematical Theorems by Means of a Digital Computer

Bernard Meltzbr

A chapter in Foundations of Mathematics, 1969, pp 39-45 from Springer

Abstract: Abstract Unbeknown to most mathematicians and others, the last decade has been marked by the initiation of a major revolution in the development of mathematics and implicitly of the sciences and other disciplines which depend on it. For the advent of large-storage and high-speed digital computers has now made the implementation of Leibniz’s proposal for a universal calculus for carrying out mathematical proofs by rules partially, as we shall see, realizable.

Keywords: Theorem Prove; Conjunctive Normal Form; Automatic Deduction; Proof Procedure; Empty Clause (search for similar items in EconPapers)
Date: 1969
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-3-642-86745-3_4

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

DOI: 10.1007/978-3-642-86745-3_4

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 ().