Pages that link to "Item:Q5717439"
From MaRDI portal
The following pages link to Mechanizing Mathematical Reasoning (Q5717439):
Displaying 21 items.
- Normal natural deduction proofs (in classical logic) (Q1577339) (← links)
- Natural deduction for non-classical logics (Q1577342) (← links)
- Natural deduction (Q1577346) (← links)
- Goal-oriented proof-search in natural deduction for intuitionistic propositional logic (Q1725847) (← links)
- The polarized \(\lambda\)-calculus (Q1744450) (← links)
- Automated search for Gödel's proofs (Q1772785) (← links)
- Natural deduction in normal modal logic (Q1813231) (← links)
- Human-centered automated proof search (Q2069871) (← links)
- Proofs and countermodels in non-classical logics (Q2254557) (← links)
- Long normal form proof search and counter-model generation (Q2703714) (← links)
- Proofs, Upside Down (Q2937799) (← links)
- Intuitionistic Decision Procedures Since Gentzen (Q3305556) (← links)
- Proof-Search in Natural Deduction Calculus for Classical Propositional Logic (Q3455774) (← links)
- Labelled Natural Deduction for Conditional Logics of Normality (Q4545014) (← links)
- A short proof of the strong normalization of classical natural deduction with disjunction (Q4650284) (← links)
- (Q4939407) (← links)
- NATURAL FORMALIZATION: DERIVING THE CANTOR-BERNSTEIN THEOREM IN ZF (Q5001547) (← links)
- Proofs as Objects (Q5057055) (← links)
- A User-friendly Interface for a Lightweight Verification System (Q5170234) (← links)
- The Cantor–Bernstein theorem: how many proofs? (Q5204798) (← links)
- Partial proof terms in the study of idealized proof search (Q6648177) (← links)