proof-theory

Problem-solving strategies for proof theory in mathematical logic

⭐2.2kstars🔀157forks📁View on GitHub🕐Updated Jan 10, 2026⬇️2downloads

When & Why to Use This Skill

This Claude skill provides advanced problem-solving strategies for proof theory in mathematical logic. It enables users to automate formal verification, perform structural induction, and analyze logical systems using integrated tools like the Z3 solver and specialized math scratchpads for rigorous proof construction.

Use Cases

  • Formal Verification: Automate the verification of complex mathematical proofs and logical structures using Z3-powered induction and soundness checks.
  • Proof Normalization: Apply advanced logic techniques like Gentzen's Cut Elimination to simplify and normalize proofs within sequent calculus frameworks.
  • Structural Induction: Systematically prove properties of well-founded structures by defining base cases and inductive steps through automated Python-based scripts.
  • Logic System Analysis: Evaluate the completeness and soundness of logical frameworks to ensure every provable statement is valid and vice versa.
  • Mathematical Problem Solving: Utilize a structured decision tree to select the optimal proof strategy, such as proof by contradiction, cases, or direct derivation.
nameproof-theory
description"Problem-solving strategies for proof theory in mathematical logic"
allowed-tools[Bash, Read]

Proof Theory

When to Use

Use this skill when working on proof-theory problems in mathematical logic.

Decision Tree

  1. Proof Strategy Selection

    • Direct proof: assume premises, derive conclusion
    • Proof by contradiction: assume negation, derive false
    • Proof by cases: split on disjunction
    • Induction: base case + inductive step
  2. Structural Induction

    • Define well-founded ordering on structures
    • Base: prove for minimal elements
    • Step: assume for smaller, prove for current
    • z3_solve.py prove "induction_principle"
  3. Cut Elimination

    • Gentzen's Hauptsatz: cuts can be eliminated
    • Subformula property: only subformulas appear
    • Useful for proof normalization
  4. Completeness/Soundness Check

    • Soundness: if provable then valid
    • Completeness: if valid then provable
    • z3_solve.py prove "soundness_theorem"
  5. Proof Verification

    • Check each step follows from rules
    • Verify dependencies are satisfied
    • math_scratchpad.py verify "proof_steps"

Tool Commands

Z3_Induction_Base

uv run python -m runtime.harness scripts/cc_math/z3_solve.py prove "P(0)"

Z3_Induction_Step

uv run python -m runtime.harness scripts/cc_math/z3_solve.py prove "ForAll([n], Implies(P(n), P(n+1)))"

Z3_Soundness

uv run python -m runtime.harness scripts/cc_math/z3_solve.py prove "Implies(derivable(phi), valid(phi))"

Math_Verify

uv run python -m runtime.harness scripts/cc_math/math_scratchpad.py verify "proof_structure"

Cognitive Tools Reference

See .claude/skills/math-mode/SKILL.md for full tool documentation.