Smithery Logo
MCPsSkillsDocsPricing
Login
Smithery Logo

Accelerating the Agent Economy

Resources

DocumentationPrivacy PolicySystem Status

Company

PricingAboutBlog

Connect

© 2026 Smithery. All rights reserved.

    scooter-lacroix

    proof-theory

    scooter-lacroix/proof-theory
    Research
    1 installs

    About

    SKILL.md

    Install

    Install via Skills CLI

    or add to your agent
    • Claude Code
      Claude Code
    • Codex
      Codex
    • OpenClaw
      OpenClaw
    • Cursor
      Cursor
    • Amp
      Amp
    • GitHub Copilot
      GitHub Copilot
    • Gemini CLI
      Gemini CLI
    • Kilo Code
      Kilo Code
    • Junie
      Junie
    • Replit
      Replit
    • Windsurf
      Windsurf
    • Cline
      Cline
    • Continue
      Continue
    • OpenCode
      OpenCode
    • OpenHands
      OpenHands
    • Roo Code
      Roo Code
    • Augment
      Augment
    • Goose
      Goose
    • Trae
      Trae
    • Zencoder
      Zencoder
    • Antigravity
      Antigravity
    ├─
    ├─
    └─

    About

    Problem-solving strategies for proof theory in mathematical logic

    SKILL.md

    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/z3_solve.py prove "P(0)"
    

    Z3_Induction_Step

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

    Z3_Soundness

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

    Math_Verify

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

    Cognitive Tools Reference

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

    Recommended Servers
    Thoughtbox
    Thoughtbox
    InfraNodus Knowledge Graphs & Text Analysis
    InfraNodus Knowledge Graphs & Text Analysis
    Google Sheets
    Google Sheets
    Repository
    scooter-lacroix/maestro
    Files