Pages that link to "Item:Q2921120"

The following pages link to Improving legibility of natural deduction proofs is not trivial (Q2921120):

Displayed 8 items.

• 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)
• Multiplication-related classes of complex numbers (Q2113836) ‎ (← links)
• Accessing the Mizar Library with a Weakly Strict Mizar Parser (Q2817295) ‎ (← links)
• Mizar: State-of-the-art and Beyond (Q3453119) ‎ (← links)