On Proving and Discovering Theorems by Computer
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F60076658%3A12410%2F11%3A43882733" target="_blank" >RIV/60076658:12410/11:43882733 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
On Proving and Discovering Theorems by Computer
Original language description
Proofs of mathematics theorems belong to the most difficult part of mathematics. In this paper, basic methods of computer supported discovery and proving are shown. Both DGS and CAS will be used. With DGS we describe a problem and verify some related conjectures. With CAS we do rigorous proofs. The theory of automated geometry theorem proving is demonstrated with examples.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
AM - Pedagogy and education
OECD FORD branch
—
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Electronic Journal of Mathematics & Technology
ISSN
1933-2823
e-ISSN
—
Volume of the periodical
5
Issue of the periodical within the volume
2
Country of publishing house
US - UNITED STATES
Number of pages
25
Pages from-to
1-25
UT code for WoS article
—
EID of the result in the Scopus database
—