Translating Mizar for First Order Theorem Provers

Authors:
Josef Urban
Affiliations:
-
Venue:
MKM '03 Proceedings of the Second International Conference on Mathematical Knowledge Management
Year:
2003

Citing 4
Cited 6

Order-sorted algebra I: equational deduction for multiple inheritance, overloading, exceptions and partial operations

Theoretical Computer Science
Automated theorem proving in software engineering

Automated theorem proving in software engineering
Interpretation of a Mizar-Like Logic in First-Order Logic

Selected Papers from Automated Deduction in Classical and Non-Classical Logics
System Description: Spass Version 1.0.0

CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction

MPTP -- Motivation, Implementation, First Experiments

Journal of Automated Reasoning
Extended Formula Normalization for ε-Retrieval and Sharing of Mathematical Knowledge

Calculemus '07 / MKM '07 Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference
Mizar's soft type system

TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
A note on a formal approach to rough operators

RSCTC'10 Proceedings of the 7th international conference on Rough sets and current trends in computing
Licensing the Mizar mathematical library

MKM'11 Proceedings of the 18th Calculemus and 10th international conference on Intelligent computer mathematics
Theorem proving in large formal mathematics as an emerging AI field

Automated Reasoning and Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The constructor system of the Mizar proof checking system is explained here on examples from Mizar articles, and its translation to untyped first-order syntax is described and discussed. This makes the currently largest library of formalized mathematics available to first-order theorem provers.