Improving legibility of natural deduction proofs is not trivial

@inproceedings{Pkak2014ImprovingLO,
  title={Improving legibility of natural deduction proofs is not trivial},
  author={Karol Pkak},
  year={2014}
}
In formal proof checking environments such as Mizar it is not merely the validity of mathematical formulas that is evaluated in the process of adoption to the body of accepted formalizations, but also the readability of the proofs that witness validity. As in case of computer programs, such proof scripts may sometimes be more and sometimes be less readable. To better understand the notion of readability of formal proofs, and to assess and improve their readability, we propose in this paper a… 
1 Citations
Multiplication-Related Classes of Complex Numbers
TLDR
The proposed system of classes for complex numbers aims to facilitate proofs involving basic arithmetical operations and order checking, and some potentially useful definitions, following those defined for real numbers, are introduced.