Skip to main content
skill CX Codex

predicate-logic — Claude Code skill: mathematical logic problem-solving

A skill for tackling predicate logic in mathematical logic. Handles quantifier analysis, normal form conversion, proof construction, and countermodel search.

MIT 1 installs ★ 3,951 updated 2026-01-26

Install into Claude Code · Skills CLI (Vercel) All methods and platforms ↓
npx skills add parcadei/Continuous-Claude-v3 --skill predicate-logic -a claude-code
Open on GitHub

What predicate-logic does

The skill includes tools for quantifier identification (universal and existential), prenex normal form transformation, Skolemization, and resolution-based proof generation. Built on Z3 solver and SymPy.

Ready-made commands let you prove statements, check formula satisfiability, apply universal instantiation, and construct models. Requires Bash for execution and Read access for documentation.

What it helps with

  • prove or refute a statement in predicate logic
  • convert a formula to prenex normal form
  • find a countermodel to an invalid argument
  • apply Skolemization to existential quantifiers
  • check satisfiability of a quantified formula

Example prompts for the agent

  • Prove that ForAll([x], P(x)) implies P(a) using universal instantiation
  • Find a model for Exists([x], And(P(x), Not(Q(x))))
  • Transform a formula into prenex normal form via sympy

How to install predicate-logic

1Skills CLI (Vercel)

npx skills add parcadei/Continuous-Claude-v3 --skill predicate-logic -a claude-code

2Manually: put the files in place

~/.claude/skills/predicate-logic/SKILL.md

Copy the whole skill folder; for one project use .claude/skills/predicate-logic/

Step by step, with commands for each platform: How to install skills in Claude Code: five ways

Questions about predicate-logic

How do I install predicate-logic in Claude Code?

Run npx skills add parcadei/Continuous-Claude-v3 --skill predicate-logic -a claude-code, then check the docs at ~/.claude/skills/predicate-logic/SKILL.md.

What does predicate-logic do?

The skill provides methods for mathematical logic problems: analyzes quantifiers, transforms formulas, builds proofs, and finds countermodels using Z3 solver and SymPy.

Which platforms support predicate-logic?

The skill installs on Claude Code, Codex, Cursor, GitHub Copilot, Gemini CLI, and OpenCode, each with its own installation path.

Source text

SKILL.md · MIT
---
name: predicate-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
```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.

© parcadei · MIT · parcadei/Continuous-Claude-v3

Similar skills

All skills for AI and ML →

From the same set161

The whole set →
tdd tdd — a skill that keeps the agent on a strict red-green-refactor loop: failing test first, minimal code next, then verification. CX Codex +1 474installs system-overview system-overview displays the Continuous Claude architecture, showing memory layers, 9 registered hook types, and session continuity mechanisms. CX Codex +1 474installs proof-theory proof-theory — a skill for mathematical logic proofs and decision trees across strategies. Guides you through direct proof, proof by contradiction, case analysis, and induction; verifies soundness, completeness, and cut elimination. CX Codex +1 1installs propositional-logic Guides solving propositional logic problems using truth tables, Z3 proofs, and semantic tableaux. CX Codex +1 1installs prime-numbers Skill for working with prime numbers in graph and number theory. Offers strategies for primality testing (trial division, Miller-Rabin, AKS), factorization, and applications of Fermat's and Wilson's theorems through Bash and Read tools. CX Codex +1 1installs matrices matrices — a skill for matrix operations: identifies types, performs arithmetic, solves linear systems. Includes decompositions like LU, QR, SVD and works across Claude Code, Codex, Cursor, GitHub Copilot, Gemini CLI, and OpenCode. CX Codex +1 1installs leann-search leann-search runs semantic code queries against a LEANN vector index when exact keyword matches fall short. CX Codex +1 ★ 3,951repo stars natural-transformations This skill guides category-theory work on natural transformations, with Lean 4 notation for checking naturality and applying related constructions. CX Codex +1 ★ 3,951repo stars

Project sponsors

Companies that keep this analytics open