2015
DOI: 10.15439/2015f229
|View full text |Cite
|
Sign up to set email alerts
|

Equality in computer proof-assistants

Abstract: Abstract-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 discussi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
14
0

Year Published

2016
2016
2020
2020

Publication Types

Select...
5
5

Relationship

4
6

Authors

Journals

citations
Cited by 22 publications
(14 citation statements)
references
References 31 publications
0
14
0
Order By: Relevance
“…The proofs in our certification contain more steps than the Mizar ones. This is mainly due to the lack of the Mizar automation in our system, e.g., type inference, equational calculus [38], definitional expansions [39]. Additionally, we still have to directly indicate the background information, such as registrations, that are processed automatically by Mizar.…”
Section: A Field Formalizationmentioning
confidence: 99%
“…The proofs in our certification contain more steps than the Mizar ones. This is mainly due to the lack of the Mizar automation in our system, e.g., type inference, equational calculus [38], definitional expansions [39]. Additionally, we still have to directly indicate the background information, such as registrations, that are processed automatically by Mizar.…”
Section: A Field Formalizationmentioning
confidence: 99%
“…On the one hand, it is really natural to have it as a separate field, as it was in case of ortholattices. When it is just a part of the language's signature, it reflects the ordinary mathematical definition [16]. The latter registration would allow for mixed use of the lower approximation instead of interior operator and vice versa.…”
Section: Merging Topologies and Rough Setsmentioning
confidence: 99%
“…This was useful and handy some ten years ago for Mizar developers, but the approach was reimplemented. The mechanism of the identification of ordinary operations on reals with corresponding abstract field operations was discussed in detail in our paper [18]. There we described the usefulness of automatic consideration of core equalities via identify construction, which does not force the mathematician to add them explicitly to the proof.…”
Section: B Ordered Fieldsmentioning
confidence: 99%