Semi-Automated Mathematics

DOI10.1145/321495.321500MaRDI QIDQ5565138zbMATH OpenOpenAlexFDO

Authors J. R. Guard, F. C. Oglesby, J. H. Bennett, L. G. Settle

Publication date 1969

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/321495.321500

zbMATH Keywords

languages, automata, networks

Cited in

(12)

• Unification theory
• Non-resolution theorem proving
• Higher-order unification revisited: Complete sets of transformations
• A man-machine theorem-proving system
• An examination of the geometry theorem machine
• Resolution graphs
• Formalization of real analysis: a survey of proof assistants and libraries
• Struktursätze der Algebra und Kompliziertheit logischer Schemata. III Algebraische Theorien und Verallgemeinerungen
• Associative-commutative deduction with constraints
• Microeconomics and the First Welfare Theorem
• Basic research problems: The problem of choosing the representation, inference rule, and strategy
• The problem of choosing the type of subsumption to use

This page was built for publication: Semi-Automated Mathematics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5565138)