propositional-logic

Classify propositional logic formulas and check satisfiability using Z3 and SymPy.

8|1|Updated Jan 4, 2026

Search Tags:#mathematics #logic #proof #tautology #propositional logic #satisfiability

Ready to run

npx skills add https://github.com/scooter-lacroix/Maestro --skill propositional-logic

💬 Prompt for ChatGPT / Claude Chat▼

Please help me install this Agent Skill.
Skill: propositional-logic
Source: https://github.com/scooter-lacroix/Maestro/tree/main/maestro/skills/math/math/mathematical-logic/propositional-logic
Command: npx skills add https://github.com/scooter-lacroix/Maestro --skill propositional-logic

SYSTEM DOCUMENTATION & REQUIREMENTS

💡 This Skill requires z3-solver, sympy, and includes scripts (resource) and references (resource) components.

What problem does it solve?

This Skill provides strategies and tools to solve problems within propositional logic, a fundamental area of mathematical logic.

Core Features & Use Cases

Formula Classification: Determine if a formula is a tautology, contradiction, or contingent.
Satisfiability Checking: Verify if a given logical formula can be true.
Proof Assistance: Utilize methods like Natural Deduction and Semantic Tableaux.
Use Case: You are given a complex logical statement and need to prove its validity or determine if it's always true.

Quick Start

Use the propositional-logic skill to check if the formula 'p & (p -> q) -> q' is a tautology.

Frequently Asked Questions about propositional-logic

High-intent search queries and answers about installing and using this skill.

FAQPage Schema

How do I check if a propositional logic formula is a tautology or contradiction?▼

To check if a propositional logic formula is a tautology or contradiction, you can use this Skill to classify formulas computationally using Z3 and SymPy, determining if it is always true, always false, or contingent.

What is the best way to verify the satisfiability of a logical formula?▼

The best way to verify the satisfiability of a logical formula is to use a computational solver like Z3, which this Skill utilizes to check if a given propositional logic statement can evaluate to true under any interpretation.

Can I use SymPy and Z3 solver for natural deduction and semantic tableaux proofs?▼

Yes, you can use this Skill with SymPy and Z3 solver for proof assistance, providing computational strategies to construct natural deduction and semantic tableaux proofs for propositional logic statements.

Does this approach work for complex mathematical logic statements or only simple variables?▼

This approach works for complex mathematical logic statements, utilizing symbolic computation through SymPy and the Z3 solver to evaluate compound propositional formulas and determine their validity or satisfiability.

When do I need to use semantic tableaux for propositional logic?▼

You need to use semantic tableaux for propositional logic when you require a systematic proof method to determine the satisfiability or validity of complex logical statements by breaking them down into simpler components.

Why does my propositional logic formula return contingent instead of a tautology?▼

A propositional logic formula returns contingent instead of a tautology because it is neither always true nor always false, meaning its truth value depends on the specific interpretation of its variables.