Abstract
The paradigm of a chain of inference from axioms is inadequate as an account of proof. A re-analysis of what proof is leads to a proposal for a semantic framework, which in a natural way accommodates abstraction, generalization and specialization involved in proof. It can be applied to other languages than that of mathematics, and in fact appears likely to be useful in considering the problems of free-ranging reasoning in programming languages of artificial intelligence.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1976 Springer-Verlag Wien
About this chapter
Cite this chapter
Meltzer, B. (1976). Proof, Abstraction and Semantics in Mathematics and Artificial Intelligence. In: Marzollo, A. (eds) Topics in Artificial Intelligence. International Centre for Mechanical Sciences, vol 256. Springer, Vienna. https://doi.org/10.1007/978-3-7091-4358-2_1
Download citation
DOI: https://doi.org/10.1007/978-3-7091-4358-2_1
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-81466-6
Online ISBN: 978-3-7091-4358-2
eBook Packages: Springer Book Archive