Computer Aider Reasoning

TL;DR: The implemented theorem prover outperforms humans to a certain extent, retaining logic and calculi generality.

TL;DR: This paper presents an attempt to create a shell for generic interactive proof search and proof assistant software based on it and describes how this shell could be modified for mobile devices.

TL;DR: This work describes basic FV methods: theorem proving, model checking, and equivalence checking with some illustrations from their applications to Alpha microprocessor designs and their ability to apply FV is limited due to capacity limits of existing FV tools and the availability of trained personnel.

TL;DR: The two approaches to automated theorem proving are proof finding and consequence finding as discussed by the authors, where a proof finding program attempts to find a proof for a given given theorem and a consequence-finding program tries to deduce consequences from the axioms and to select "interesting" consequences.

TL;DR: A precise definition is given of a class of inferences in predicate logic which it is proposed to Identify with the class of "obvious" Inferences and a mechanism for Implementing "obviously inference" as a rule of Inference in proof checking systems is discussed.

TL;DR: The language.- Logical syntax.- The logic.- Proof rules.- Programming.- Rules for program statements.- Procedures.- Procedure rules.- Functions.- Function Rules.