FreeSlides
Slide deck with story arc and timing
- 499499 downloads
- 205205 likes
- 225225 saves
- Claude Code
- Codex
- Cursor
- and 3 more
Every premium and members-only resource for $9.99/month, as a no-commitment subscription. See the plans
Use this resource to choose and structure a proof strategy in logic
New
Free
In a terminal, from the folder you want:
npx --yes palatekit@latest install proof-strategies-induction-logicWith no option, the skill goes to ~/.agents/skills/; add --agent claude-code (or codex, cursor…) to target an agent.
First time: connect the CLI with
npx --yes palatekit@latest loginThe agent picks the right proof strategy, checks the base case and the induction step with Z3, and draws on Gentzen's cut elimination for formal proofs. You get a structured proof.
Mostly picked by
Updated November 2, 2026
You say
“Prove by induction that the sum of the first n integers is n(n+1)/2.”

Skill published by parcadei under the MIT license, delivered in its original version.
Listed unmodified
« proof-theory » (parcadei, MIT) livré dans sa version d'origine : fiche en français et en anglais par PalateKit.
–
No ratings yet
Loading reviews…