Journal of Automated Reasoning

, Volume 50, Issue 2, pp 203–210

On Rewriting Rules in Mizar

Open AccessArticle

DOI: 10.1007/s10817-012-9261-6

Cite this article as:
Korniłowicz, A. J Autom Reasoning (2013) 50: 203. doi:10.1007/s10817-012-9261-6

Abstract

This paper presents some tentative experiments in using a special case of rewriting rules in Mizar (Mizar homepage: http://www.mizar.org/): rewriting a term as its subterm. A similar technique, but based on another Mizar mechanism called functor identification (Korniłowicz 2009) was used by Caminati, in his paper on basic first-order model theory in Mizar (Caminati, J Form Reason 3(1):49–77, 2010, Form Math 19(3):157–169, 2011). However for this purpose he was obligated to introduce some artificial functors. The mechanism presented in the present paper looks promising and fits the Mizar paradigm.

Keywords

Proof assistantNatural deductionComputer algebra systemTerm rewritingMizar
Download to read the full article text

Copyright information

© The Author(s) 2012

Authors and Affiliations

  1. 1.Institute of InformaticsUniversity of BiałystokBiałystokPoland