Problem-solving strategies for predicate logic in mathematical logic
Scanned 9/12/2026
Install to Claude Code
npx -y skills add thedixitjain/the-mega-skill-library --skill predicate-logic --agent claude-codeInstalls into .claude/skills of the current project.
Are you the author of Predicate Logic?
Add the live security badge to your README — it updates automatically with every re-scan.
[](https://www.skillsdirectory.com/skills/thedixitjain-predicate-logic)More formats (shields.io, HTML) on the badges page.
---
name: predicate-logic
description: "Problem-solving strategies for predicate logic in mathematical logic"
allowed-tools: "[Bash, Read]"
category: general-purpose
source_repo: parcadei/Continuous-Claude-v3
source_path: ".claude/skills/math/mathematical-logic/predicate-logic/SKILL.md"
source_url: https://github.com/parcadei/Continuous-Claude-v3/blob/HEAD/.claude/skills/math/mathematical-logic/predicate-logic/SKILL.md
---
# 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
```bash
uv run python -m runtime.harness scripts/z3_solve.py prove "ForAll([x], Implies(P(x), Q(x)))"
```
### Z3_Exists
```bash
uv run python -m runtime.harness scripts/z3_solve.py sat "Exists([x], And(P(x), Not(Q(x))))"
```
### Z3_Universal_Instantiation
```bash
uv run python -m runtime.harness scripts/z3_solve.py prove "Implies(ForAll([x], P(x)), P(a))"
```
### Z3_Model
```bash
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.
---
**Source:** [`parcadei/Continuous-Claude-v3`](https://github.com/parcadei/Continuous-Claude-v3) → `.claude/skills/math/mathematical-logic/predicate-logic/SKILL.md`
Is this your skill, or is something wrong with this listing? Request removal or report an issue. Author removals are honored within 72 hours.
No comments yet. Be the first to comment!