Extracting Higher-Order Goals from the Mizar Mathematical Library

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21730%2F16%3A00309758" target="_blank" >RIV/68407700:21730/16:00309758 - isvavai.cz</a>

Result on the web

<a href="http://dx.doi.org/10.1007/978-3-319-42547-4_8" target="_blank" >http://dx.doi.org/10.1007/978-3-319-42547-4_8</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-319-42547-4_8" target="_blank" >10.1007/978-3-319-42547-4_8</a>

Result language

angličtina

Original language name

Extracting Higher-Order Goals from the Mizar Mathematical Library

Original language description

Certain constructs allowed in Mizar articles cannot be represented in first-order logic but can be represented in higher-order logic. We describe a way to obtain higher-order theorem proving problems from Mizar articles that make use of these constructs. In particular, higherorder logic is used to represent schemes, a global choice construct and set level binders. The higher-order automated theorem provers Satallax and LEO-II have been run on collections of these problems and the results are discussed.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

—

Continuities

R - Projekt Ramcoveho programu EK

Publication year

2016

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

Lecture Notes in Computer Science 9791

ISBN

978-3-319-42546-7

ISSN

0302-9743

e-ISSN

—

Number of pages

16

Pages from-to

99-114

Publisher name

Springer

Place of publication

Basel

Event location

Bialystok

Event date

Jul 25, 2016

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

000389402700008