Methods of lemma extraction in natural deduction proofs
From MaRDI portal
Publication:1945902
Recommendations
Cites work
Cited in
(16)- The role of the Mizar mathematical library for interactive proof development in Mizar
- Formalizing lattice-theoretical aspects of rough and fuzzy sets
- Mechanizing complemented lattices within Mizar type system
- Definitional expansions in Mizar. In memoriam of Andrzej Trybulec, a pioneer of computerized formalization
- Improving legibility of formal proofs based on the close reference principle is NP-hard
- Semi-intelligible Isar proofs from machine-generated proofs
- SAT-enhanced Mizar proof checking
- Initial comparison of formal approaches to fuzzy and rough sets
- Automated Improving of Proof Legibility in the Mizar System
- Accessing the Mizar library with a weakly strict Mizar parser
- Four decades of \textsc{Mizar}. Foreword
- Improving legibility of natural deduction proofs is not trivial
- Mizar: state-of-the-art and beyond
- Automating Boolean set operations in Mizar proof checking with the aid of an external SAT solver
- Extracting Information from Logical Proofs
- Readable formalization of Euler's partition theorem in Mizar
This page was built for publication: Methods of lemma extraction in natural deduction proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1945902)