Amanote Research

Amanote Research

    RegisterSign In

From Formal Proofs to Mathematical Proofs: A Safe, Incremental Way for Building in First-Order Decision Procedures

IFIP International Federation for Information Processing
doi 10.1007/978-0-387-09680-3_24
Full Text
Open PDF
Abstract

Available in full text

Date

Unknown

Authors
Fréderic BlanquiJean-Pierre JouannaudPierre-Yves Strub
Publisher

Springer US


Related search

Strategic Maneuvering in Mathematical Proofs

Argumentation
LinguisticsPhilosophyLanguage
2008English

Formal Proofs for Theoretical Properties of Newton's Method

Mathematical Structures in Computer Science
MathematicsComputer Science Applications
2011English

From Tests to Proofs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Minimum-Knowledge Interactive Proofs for Decision Problems

SIAM Journal on Computing
MathematicsComputer Science
1989English

Formal Proofs of Code Generation and Verification Tools

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Proofs for Free

Journal of Functional Programming
Software
2012English

Expansion Tree Proofs and Their Conversion to Natural Deduction Proofs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1984English

Proofs and Fundamentals: A First Course in Abstract Mathematics

Choice Reviews Online
2000English

Combining Unification and Rewriting in Proofs for Modal Logics With First-Order Undefinable Frames

2017English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy