: We describe an algorithm approximatingthe following question: Given two types t1 and t2, are there instances (t1) and (t2) denoting a common element? By answering this question w...
In Mizar, unlike in most other proof assistants, the types are not part of the foundations of the system. Mizar is based on untyped set theory, which means that in Mizar expression...