predicate-logic

Problem-solving strategies for predicate logic in mathematical logic

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

When & Why to Use This Skill

This Claude skill provides advanced problem-solving strategies for predicate logic within the field of mathematical logic. By leveraging computational tools like Z3 and Sympy, it automates complex tasks such as quantifier analysis, Skolemization, and resolution-based proofs, making it an essential resource for formal verification and academic logic research.

Use Cases

  • Automated Theorem Proving: Validating complex logical arguments by applying resolution rules and universal instantiation through Z3 solvers.
  • Formula Transformation: Converting intricate logical expressions into Prenex Normal Form or Skolemized forms to facilitate standardized mathematical analysis.
  • Countermodel Generation: Constructing specific models to satisfy predicates or finding counterexamples to refute invalid logical conclusions.
  • Formal Specification Analysis: Analyzing the scope of quantifiers and identifying free vs. bound variables in mathematical or software specifications.
namepredicate-logic
description"Problem-solving strategies for predicate logic in mathematical logic"
allowed-tools[Bash, Read]

Predicate Logic

When to Use

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

Decision Tree

  1. Quantifier Analysis

    • Identify: ForAll (universal), Exists (existential)
    • Scope of quantifiers and free/bound variables
    • z3_solve.py prove "ForAll([x], P(x)) implies P(a)"
  2. Prenex Normal Form

    • Move all quantifiers to front
    • Standardize variables to avoid capture
    • sympy_compute.py simplify "prenex(formula)"
  3. Skolemization (for Exists)

    • Replace existential quantifiers with Skolem functions
    • Exists x. P(x) -> P(c) or P(f(y)) depending on scope
    • Needed for resolution-based proofs
  4. Resolution Proof

    • Convert to CNF, negate conclusion
    • Apply resolution rule until empty clause or saturation
    • z3_solve.py prove "resolution_valid"
  5. Model Theory

    • Construct countermodel to refute invalid argument
    • Finite model for finite domain
    • z3_solve.py model "Exists([x], P(x) & Not(Q(x)))"

Tool Commands

Z3_Forall

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

Z3_Exists

uv run python -m runtime.harness scripts/z3_solve.py sat "Exists([x], And(P(x), Not(Q(x))))"

Z3_Universal_Instantiation

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

Z3_Model

uv run python -m runtime.harness scripts/z3_solve.py model "Exists([x], P(x))"

Cognitive Tools Reference

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