mathematical-proof-logic
From the author
The logical structure of mathematical proof -- how first-order logic, natural deduction, and semantic reasoning combine to produce rigorous mathematical arguments. Covers the logical skeleton of direct proof, contraposition, contradiction, cases, and induction; the role of definitions, lemmas, and theorems; how informal mathematical prose maps to formal deductive structure; and the difference between proof-as-object and proof-as-activity. Use when the question is "why is this a valid proof?" rather than "what proof technique applies?"
Install
npx skills add Tibsfox/gsd-skill-creator --skill mathematical-proof-logic -a claude-code
Installs to .claude/skills/mathematical-proof-logic/ · Each command fetches the skill straight from GitHub with the open skills CLI.
No download: this skill’s licence (Custom or unclear) does not let us redistribute its files. The install commands fetch them from GitHub instead.
Want your agent to suggest skills while you type? See how to use skills from your IDE.
Safety checks on SKILL.md
No warnings.
Why 72
aiqbench computes the trust score from public signals. It is not a security audit, so read a skill before you install it.
Similar skills
Closest to this one by what they do and when they are used.
- proof-techniquesTibsfox/gsd-skill-creatorProof writing and verification techniques for mathematical reasoning. Covers 13 proof strategies with canonical worked examples — direct, contrapositive, contradiction, cases, WLOG, vacuous/trivial, biconditional, counterexample, existence (constructive and non-constructive), uniqueness, induction (weak, strong, structural), pigeonhole/double-counting, and diagonal argument/invariants. Use when writing, verifying, or selecting proof strategies for any mathematical claim.Writing★ 71
- critical-argumentationTibsfox/gsd-skill-creatorPractical argument analysis and construction -- how to identify, evaluate, reconstruct, and build real arguments in natural language. Covers argument identification (premises, conclusions, intermediate steps), charity and steel-manning, argument mapping, the distinction between deductive validity and inductive strength, burden of proof, and the rhetorical context in which arguments operate. Use when the goal is to engage with real-world argument rather than to formalize it.Productivity★ 71
- formal-logicTibsfox/gsd-skill-creatorFormal and informal logic for philosophical reasoning. Covers propositional logic (connectives, truth tables, tautologies), predicate logic (quantifiers, validity), syllogistic logic (Aristotle's original forms), natural deduction (introduction/elimination rules), modal logic (necessity, possibility, possible worlds), and a catalog of 15+ informal fallacies. Use when analyzing arguments, identifying logical form, evaluating validity and soundness, or detecting fallacious reasoning.Other★ 71
- propositional-logicTibsfox/gsd-skill-creatorThe logic of sentential connectives -- and, or, not, if-then, if-and-only-if -- as a formal system. Covers syntax (well-formed formulas), semantics (truth tables), satisfiability, validity, logical equivalence, normal forms (CNF, DNF), natural-deduction rules, and common translation pitfalls. Use when formalizing arguments with propositional structure, checking validity mechanically, or teaching the foundations of formal reasoning.Other★ 71
- predicate-logicTibsfox/gsd-skill-creatorFirst-order logic with quantifiers, predicates, functions, and identity. Covers syntax, interpretation over a domain, the universal and existential quantifiers, quantifier scope and binding, translation from natural language with multi-variable predicates, natural deduction for quantifiers, undecidability at first order, and the soundness/completeness theorems. Use when propositional logic is insufficient -- whenever "for all" or "there exists" matters to the argument.Other★ 71
- lean-formalizewanshuiyin/Auto-claude-code-research-in-sleepDevelop and verify a mathematical proof in Lean, continue an incomplete Lean project, or audit whether it proves the original statement. Connect actual inputs to intermediate lemmas, assemble the target theorem, check its transitive axioms, and provide a reproducible handoff. Use when Lean is requested or a specific proof obligation benefits from formal verification; use proof-writer for ordinary mathematical drafting.Writing★ 18K
Ratings & reviews
—
no reviews
Tried this skill? Rate it to help others. Sign in
Discussion
Join the discussion. Sign in