Pages that link to "Item:Q1945902"
From MaRDI portal
The following pages link to Methods of lemma extraction in natural deduction proofs (Q1945902):
Displaying 16 items.
- Four decades of {\textsc{Mizar}}. Foreword (Q286794) (← links)
- Mechanizing complemented lattices within Mizar type system (Q286797) (← links)
- Definitional expansions in Mizar. In memoriam of Andrzej Trybulec, a pioneer of computerized formalization (Q286801) (← links)
- Automating Boolean set operations in Mizar proof checking with the aid of an external SAT solver (Q286803) (← links)
- Improving legibility of formal proofs based on the close reference principle is NP-hard (Q286805) (← links)
- Semi-intelligible Isar proofs from machine-generated proofs (Q287340) (← links)
- The role of the Mizar mathematical library for interactive proof development in Mizar (Q1663215) (← links)
- Initial Comparison of Formal Approaches to Fuzzy and Rough Sets (Q2814146) (← links)
- Accessing the Mizar Library with a Weakly Strict Mizar Parser (Q2817295) (← links)
- Improving legibility of natural deduction proofs is not trivial (Q2921120) (← links)
- Formalizing Lattice-Theoretical Aspects of Rough and Fuzzy Sets (Q3300368) (← links)
- Readable Formalization of Euler’s Partition Theorem in Mizar (Q3453116) (← links)
- Mizar: State-of-the-art and Beyond (Q3453119) (← links)
- Extracting Information from Logical Proofs (Q4051642) (← links)
- Automated Improving of Proof Legibility in the Mizar System (Q5495936) (← links)
- SAT-Enhanced Mizar Proof Checking (Q5495946) (← links)