Mizar in a Nutshell
Explore this paper's citation graph
Summary
This paper is intended to be a practical reference manual for basic Mizar terminology which may be helpful to get started using the system.
- Type
- article
- Published
- 2010-01-01
- Cited by
- 186
- References
- 20
- Access
- Open access
- OpenAlex
- https://openalex.org/W1789208025
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:34035680
Keywords
Computer science, Terminology, Programming language, Software engineering, Software
References
- Symbolic logic : an introduction
- ENHANCED PROCESSING OF ADJECTIVES IN MIZAR
- Tarski Grothendieck Set Theory
- From insight to proof : Festschrift in honour of Andrzej Trybulec
- On a Practical Way of Describing Formal Deductions
- A Comparison of Mizar and Isar
- Formal Proof Sketches
- Some Features of the Mizar Language
- IZAR : the first 30 years
- Mizar Light for HOL Light
- Three Tactic Theorem Proving
- Improving Mizar Texts with Properties and Requirements
- A Declarative Language for the Coq Proof Assistant
- A Brief Overview of Mizar
- Information Retrieval in MML
- XML-izing Mizar: Making Semantic Processing and Presentation of MML Easy
- A Mizar Mode for HOL
Cited by
- New Developments in Parsing Mizar
- The development of argument and computation and its roots in the LVOV-Warsaw school
- Machine Learning for Automated Reasoning
- Definitional Expansions in Mizar
- Improving Legibility of Formal Proofs Based on the Close Reference Principle is NP-Hard
- Towards automatically categorizing mathematical knowledge
- Automated Discovery of Properties of Rough Sets
- T2Ku: Building a Semantic Wiki of Mathematics
- On the computer certification of fuzzy numbers
- Flexary connectives in Mizar
- Eliciting Implicit Assumptions of Mizar Proofs by Property Omission
- Sentence complexity of theorems in Mizar
- MizAR 40 for Mizar 40
- Efficient Semantic Features for Automated Reasoning over Large Theories
- Equality in computer proof-assistants
- Efficient Rough Set Theory Merging
- Machine Learning in Proof General: Interfacing Interfaces
- Premise Selection for Mathematics by Corpus Analysis and Kernel Methods
- Improving legibility of natural deduction proofs is not trivial
- Custom Automations in Mizar
Related papers
- MPTP 0.2: Design, Implementation, and Initial Experiments
- Premise Selection for Mathematics by Corpus Analysis and Kernel Methods
- MizAR 40 for Mizar 40
- E – a brainiac theorem prover
- Learning-Assisted Automated Reasoning with Flyspeck
- ATP and Presentation Service for Mizar Formalizations
- Methods of Lemma Extraction in Natural Deduction Proofs