Evaluate Boolean Expression
Evaluate and simplify Boolean expressions using truth tables, algebraic laws (De Morgan, distributive, absorption, idempotent, consensus), and Karnaugh maps for up to six variables. Use when you need to reduce a Boolean expression to its minimal sum-of-products or product-of-sums form, verify logical equivalence between two expressions, or prepare a minimized function for gate-level implementation.
Install
npx skills add pjt222/agent-almanac --skill evaluate-boolean-expressiongit clone --depth 1 https://github.com/pjt222/agent-almanac.git /tmp/agent-almanac
mkdir -p ~/.claude/skills
cp -r /tmp/agent-almanac/i18n/caveman-lite/skills/evaluate-boolean-expression ~/.claude/skills/evaluate-boolean-expressionPersonal skills live in ~/.claude/skills. Use .claude/skills in a project folder to share a skill with your team.
From the SKILL.md
# Evaluate Boolean Expression Reduce a Boolean expression to its minimal form by parsing it into canonical notation, constructing a truth table, applying algebraic simplification laws, performing Karnaugh map minimization (up to six variables), and verifying that the simplified expression is logically equivalent to the original. ## When to Use - Simplifying a Boolean expression before mapping it to logic gates - Verifying that two Boolean expressions are logically equivalent - Generating a minimal sum-of-products (SOP) or product-of-sums (POS) form - Teaching or reviewing Boolean algebra identities and reduction techniques - Preparing input for the design-logic-circuit skill ## Inputs - **Required**: Boolean expression in any common notation (e.g., `A AND (B OR NOT C)`, `A * (B + C')`, `A & (B | ~C)`) - **Required**: Target form -- minimal SOP, minimal POS, or both - **Optional**: Variable ordering preference for the Karnaugh map - **Optional**: Don't-care conditions (minterms or maxterms that are unspecified) - **Optional**: A second expression to check equivalence against ## Procedure ### Step 1: Parse and Normalize to Canonical Form Convert the input expression into a standard internal representation: 1. **Tokenize**: Identify variables (single letters or short names), operators (AND, OR, NOT, XOR, NAND, NOR), and grouping (parentheses).
Details
- Skill name
evaluate-boolean-expression- Repository
- pjt222/agent-almanac
- Path
i18n/caveman-lite/skills/evaluate-boolean-expression/SKILL.md- License
- MIT
- Repo updated
- 18 November 2026
- Listed in
- BehiSecc/awesome-claude-skills
FAQ
What does the Evaluate Boolean Expression skill do?
Evaluate and simplify Boolean expressions using truth tables, algebraic laws (De Morgan, distributive, absorption, idempotent, consensus), and Karnaugh maps for up to six variables. Use when you need to reduce a Boolean expression to its minimal sum-of-products or product-of-sums form, verify logical equivalence between two expressions, or prepare a minimized function for gate-level implementation.
How do I install the Evaluate Boolean Expression skill?
skills CLI (Claude Code, Cursor, Codex and more): npx skills add pjt222/agent-almanac --skill evaluate-boolean-expression. Skills go in ~/.claude/skills (personal) or .claude/skills (project), and Claude loads them automatically when a task matches the description.
Is Evaluate Boolean Expression popular?
It lives in pjt222/agent-almanac, which has 45 GitHub stars and 4 forks, and is included in 1 curated skill list.
Related skills
Adapt Architecture
45pjt222/agent-almanac
Execute structural metamorphosis using strangler fig migration, chrysalis phases, and interface preservation. Covers transformation planning, parallel running, progressive cutover, rollback design, and post-metamorphosis stabilization for system architecture evolution. Use when assess-form has classified the system as READY for transformation, when migrating from monolith to microservices, when replacing a core subsystem while dependents continue operating, or when any architectural change must be gradual rather than big-bang.
Adaptic
45pjt222/agent-almanac
Master skill composing the 5-step synoptic cycle for panoramic synthesis across multiple domains. Orchestrates meditate, expand-awareness, observe, awareness, integrate-gestalt, and express-insight into a coherent process that produces unified understanding rather than sequential compromise. Use when a problem genuinely spans 3+ domains and the interactions between domains matter more than depth in any one, when sequential analysis feels like compromise rather than integration, or before major architectural decisions affecting multiple stakeholders.
Add Puzzle Type
45pjt222/agent-almanac
Scaffold a new puzzle type across all 10+ pipeline integration points in jigsawR. Creates the core puzzle module, wires it into the unified pipeline (generation, positioning, rendering, adjacency), adds ggpuzzle geom/stat layers, updates DESCRIPTION and config.yml, extends the Shiny app, and creates a comprehensive test suite. Use when adding a completely new puzzle type to the package or following the 10-point integration checklist to ensure nothing is missed end-to-end.
Expand Awareness
45pjt222/agent-almanac
Structured procedure for expanding attention from focused single-domain mode to panoramic multi-domain awareness. The cognitive transition from "focused attention on one problem" to "unfocused attention encompassing all relevant domains simultaneously." Like Baars' Global Workspace — consciousness as broadcast rather than spotlight. Use after meditation has cleared noise, when a problem spans multiple domains that need to be perceived together, when single-domain analysis keeps missing cross-domain connections, or as the opening move before integrate-gestalt synthesizes what is perceived.
Entity Compliance
43AlsKozlov/ru-legal
Корпоративное housekeeping для РФ юр.лиц — ежегодное общее собрание (ст.34 ФЗ-14 ООО / ст.47 ФЗ-208 АО), отчётность в ФНС (бух + налог + бенефициары), СФР, Росстат, обновление ЕГРЮЛ при изменениях, реестр участников / акционеров, раскрытие для ПАО. Annual + event-driven обязательства.
Explore Diophantine Equations
45pjt222/agent-almanac
Solve Diophantine equations (integer-only solutions) including linear, quadratic, and Pell equations. Covers the extended Euclidean algorithm, descent methods, and existence proofs. Use when finding all integer solutions to ax + by = c, solving Pell's equation, generating Pythagorean triples, proving no integer solutions exist via modular constraints, or finding the fundamental solution from which all others are generated.
Browse the most popular Claude skills, all other skills, or write your own with the skills generator.