Keywords
- Actual Computer
- Deductive System
- Atomic Formula
- Predicate Symbol
- Proof Theory
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
W. Craig, Linear reasoning. A new form of the Herbrand-Geutzen theorem. Journal of Symbolic Loqic 22 (1957), pp. 250–268.
E. Engeler, Algorithmic properties of structures. Mathematical Systems Theory 1 (1967), pp. 183–195.
E. Engeler, Formal Languages: Automata and Structures, Markham Publ. Co., Chicago, 1968.
E. G. K. Lopez-Escobar, An interpolation theorem for denumerably long formulas. Fundamenta Mathematicae 52 (1965), pp. 253–272.
R. C. Lyndon, Properties preserved under homomorphisms. Pacific Journal of Mathematics 9 (1959), pp. 143–154.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1970 Springer-Verlag
About this paper
Cite this paper
Engeler, E. (1970). Proof theory and the accuracy of computations. In: Laudet, M., Lacombe, D., Nolin, L., Schützenberger, M. (eds) Symposium on Automatic Demonstration. Lecture Notes in Mathematics, vol 125. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0060624
Download citation
DOI: https://doi.org/10.1007/BFb0060624
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-04914-2
Online ISBN: 978-3-540-36262-3
eBook Packages: Springer Book Archive
