arXiv (OAI Expanded)
open access
Simplified proofs of Weak Normalization for propositional logic
We present a new proof of weak normalization for intuitionistic natural deduction. The distinguishing features of this proof are that it works only with cuts rather than cut segments, provides explicit local rules for determining whether to contract a whole proof or reduce one of its subproofs, and
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- One-step Modal Logics, Intuitionistic and Classical, Part 1#740270
- On an extensible rule-based prover for event-B#289664
- An Inconsistency in Adams's Probabilistic Logic of Conditionals#99279
- On Reasoning-Centric LLM-based Automated Theorem Proving#124126
- Two challenges to inductivism#96777
Record · ID 1083765
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive