Equality in computer proof-assistants

Equality is fundamental notion of logic and mathematics as a whole. If computer-supported formalization of knowledge is taken into account, sooner or later one should precisely declare the intended meaning/interpretation of the primitive predicate symbol of equality. In the paper we draw some issues how computerized proof-assistants can deal with this notion, and at the same time, we propose solutions, which are not contradictory with mathematical tradition and readability of source code. Our discussion is illustrated with examples taken from the implementation of the MIZAR system.

[1]  G. Grätzer.  General Lattice Theory , 1978 .

[2]  Adam Grabowski,et al.  On the computer certification of fuzzy numbers , 2013, 2013 Federated Conference on Computer Science and Information Systems.

[3]  Adam Naumowicz,et al.  Improving Mizar Texts with Properties and Requirements , 2004, MKM.

[4]  Carlos Vázquez,et al.  Fuzzy logic rules modeling similarity-based strict equality , 2014, 2014 Federated Conference on Computer Science and Information Systems.

[5]  Marek Chmur.  The Lattice of Real Numbers. The Lattice of Real Functions , 1990 .

[6]  Jr. Hamilton Richards.  Haskell: The Craft of Functional Programming by Simon Thompson, Addison-Wesley, 1996. , 1998 .

[7]  Tamás Mihálydeák,et al.  Fuzziness in partial approximation framework , 2013, 2013 Federated Conference on Computer Science and Information Systems.

[8]  Josef Urban,et al.  Automated reasoning and presentation support for formalizing mathematics in Mizar , 2010, AISC'10/MKM'10/Calculemus'10.

[9]  Freek Wiedijk,et al.  Formal proof -- getting started , 2008 .

[10]  David Corwin.  Galois Theory , 2009 .

[11]  Adam Grabowski,et al.  On the Computer-Assisted Reasoning about Rough Sets , 2004, MSRAS.

[12]  Giuseppe Rosolini,et al.  Custom Automations in Mizar , 2012, Journal of Automated Reasoning.

[13]  R. Sikorski,et al.  The mathematics of metamathematics , 1963 .

[14]  Adam Grabowski,et al.  Automated Discovery of Properties of Rough Sets , 2013, Fundam. Informaticae.

[15]  Karol Pak.  Methods of Lemma Extraction in Natural Deduction Proofs , 2012, Journal of Automated Reasoning.

[16]  Simon Thompson,et al.  Haskell: The Craft of Functional Programming , 1996 .

[17]  Barry Mazur,et al.  Proof and other Dilemmas: When is One Thing Equal to Some Other Thing? , 2008 .

[18]  Ian Stewart,et al.  Galois Theory, 2nd Edition , 1990 .

[19]  Janusz Zalewski,et al.  Rough sets: Theoretical aspects of reasoning about data , 1996 .

[20]  Karol Pak,et al.  Improving legibility of natural deduction proofs is not trivial , 2014, Log. Methods Comput. Sci..

[21]  Adam Grabowski.  Topological Interpretation of Rough Sets , 2014, Formaliz. Math..

[22]  Adam Grabowski,et al.  Rough Set Theory from a Math-Assistant Perspective , 2007, RSEISP.

[23]  Robert LIN,et al.  NOTE ON FUZZY SETS , 2014 .

[24]  Maciej Bartoszuk,et al.  Solving systems of polynomial equations: A novel end condition and root computation method , 2014, 2014 Federated Conference on Computer Science and Information Systems.

[25]  Adam Naumowicz,et al.  Formal Mathematics for Mathematicians , 2012, Journal of Automated Reasoning.

[26]  Piotr Rudnicki,et al.  On Equivalents of Well-Foundedness , 1999, Journal of Automated Reasoning.

[27]  S. Zukowski.  Introduction to Lattice Theory , 1990 .

[28]  William McCune,et al.  Solution of the Robbins Problem , 1997, Journal of Automated Reasoning.

[29]  Adam Naumowicz,et al.  A Brief Overview of Mizar , 2009, TPHOLs.

[30]  Artur Kornilowicz.  Definitional Expansions in Mizar , 2015, Journal of Automated Reasoning.

[31]  B. Balkay,et al.  Introduction to lattice theory , 1965 .

[32]  Adam Grabowski,et al.  Efficient Rough Set Theory Merging , 2014, CS&P.

[33]  Adam Grabowski,et al.  Translating Mathematical Vernacular into Knowledge Repositories , 2005, MKM.

[34]  Artur Kornilowicz.  On Rewriting Rules in Mizar , 2012, Journal of Automated Reasoning.

[35]  Adam Grabowski,et al.  Mechanizing Complemented Lattices Within Mizar Type System , 2015, Journal of Automated Reasoning.

[36]  Adam Naumowicz,et al.  Mizar in a Nutshell , 2010, J. Formaliz. Reason..

[37]  T. Iwiński.  Algebraic approach to rough sets , 1987 .

[38]  Adam Naumowicz,et al.  Mizar: State-of-the-art and Beyond , 2015, CICM.

[39]  James H. Davenport,et al.  A Comparison of Equality in Computer Algebra and Correctness in Mathematical Pedagogy , 2009, Calculemus/MKM.

[40]  Karol Pak.  Improving Legibility of Formal Proofs Based on the Close Reference Principle is NP-Hard , 2015, Journal of Automated Reasoning.

[41]  James H. Davenport.  Equality in Computer Algebra and Beyond , 2002, J. Symb. Comput..

[42]  Adam Naumowicz.  Automating Boolean Set Operations in Mizar Proof Checking with the Aid of an External SAT Solver , 2015, Journal of Automated Reasoning.