mathematical-proof-logic
De la autor
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?"
Instalare
npx skills add Tibsfox/gsd-skill-creator --skill mathematical-proof-logic -a claude-code
Se instalează în .claude/skills/mathematical-proof-logic/ · Fiecare comandă descarcă skill-ul direct de pe GitHub cu utilitarul open source skills.
Fără descărcare: licența acestui skill (Personalizată sau neclară) nu ne permite să-i redistribuim fișierele. Comenzile de instalare le iau direct de pe GitHub.
Vrei ca agentul să-ți propună skill-uri în timp ce scrii? Vezi cum folosești skill-urile din IDE.
Verificări de siguranță pe SKILL.md
Niciun avertisment.
De ce 72
aiqbench calculează scorul de încredere din semnale publice. Nu este un audit de securitate, așa că citește un skill înainte să-l instalezi.
Skill-uri similare
Cele mai apropiate de acesta prin ce fac și când sunt folosite.
- 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.Redactare★ 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.Productivitate★ 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.Altele★ 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.Altele★ 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.Altele★ 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.Redactare★ 18K
Note și recenzii
—
nicio recenzie
Ai încercat acest skill? Notează-l ca să-i ajuți pe alții. Autentifică-te
Discuție
Intră în discuție. Autentifică-te