uu.seUppsala University Publications
Change search
ReferencesLink to record
Permanent link

Direct link
Programming and automating mathematics in the Tarski-Kleene hierarchy
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
2014 (English)In: Journal of Logical and Algebraic Methods in Programming, ISSN 2352-2208, Vol. 83, no 2, 87-102 p.Article in journal (Refereed) Published
Abstract [en]

We present examples from a reference implementation of variants of Kleene algebras and Tarski's relation algebras in the theorem proving environment Isabelle/HOL. For Kleene algebras we show how models can be programmed, including sets of traces and paths, languages, binary relations, max-plus and min-plus algebras, matrices, formal power series. For relation algebras we discuss primarily proof automation in a comprehensive library and present an advanced formalisation example. 

Place, publisher, year, edition, pages
2014. Vol. 83, no 2, 87-102 p.
Keyword [en]
Formalised mathematics, Interactive theorem proving, Kleene algebra, Relation algebra
National Category
Algebra and Logic
URN: urn:nbn:se:uu:diva-229532DOI: 10.1016/j.jlap.2014.02.001ISI: 000338266900002OAI: oai:DiVA.org:uu-229532DiVA: diva2:737106
Available from: 2014-08-11 Created: 2014-08-11 Last updated: 2014-08-11Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Weber, Tjark
By organisation
Computing Science
Algebra and Logic

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 209 hits
ReferencesLink to record
Permanent link

Direct link