Linked from

The 27 pages that link to Automated theorem proving, each with the reason it gives.

• Predicate logicRelated: Proof systems mechanize reasoning from predicate-logic formulas.

• Deductive reasoningRelated: It encodes deductive inference as procedures that machines can apply.

• Logical consequenceRelated: Proof search tests whether a target conclusion is derivable from assumptions.

• Sequent calculusRelated: Sequent rules can be implemented as proof-search steps.

• Proof theoryRelated: Proof calculi provide the rules and structures that theorem provers search.

• Mathematical logicRelated: It applies formal proof systems to make mathematical reasoning partly mechanizable.

• Modus ponensRelated: Proof engines can apply modus ponens as a primitive inference step.

• EntscheidungsproblemRelated: Undecidability rules out a complete terminating prover for all first-order validities.

• Symbolic artificial intelligenceRelated: It applies symbolic inference to determine whether conclusions follow from axioms.

• Logical equivalenceRelated: Provers use equivalence transformations to simplify formulas and expose proof steps.

• Formal logicRelated: It turns logical proof systems into procedures that computers can apply.

• LogicRelated: It turns inference rules into procedures for discovering and checking proofs.

• Principle of explosionRelated: A prover using classical rules can derive arbitrary goals once its premises are inconsistent.

• Universal algebraRelated: Algebraic identities provide structured input for automated reasoning about equations.

• Symbolic logicRelated: Machine proof systems apply symbolic rules to derive and check conclusions.

• Disjunction introductionRelated: Proof search systems encode introduction rules to build candidate conclusions.

• Well-formed formulaRelated: Proof engines require well-formed formulas as inputs to inference procedures.

• Conjunction introductionRelated: Proof search can apply the rule by proving both conjuncts separately.

• Formal fallacyRelated: Formal proof systems let software detect invalid inference steps in symbolic arguments.

• Conjunction eliminationRelated: Proof search systems apply connective rules, including conjunction elimination, to derive goals.

• Deduction theoremRelated: Proof assistants and automated provers use implication introduction as a standard inference step.