Proszę używać tego identyfikatora do cytowań lub wstaw link do tej pozycji:
http://hdl.handle.net/11320/10836
Pełny rekord metadanych
Pole DC | Wartość | Język |
---|---|---|
dc.contributor.author | Ziobro, Rafał | - |
dc.date.accessioned | 2021-05-04T09:02:38Z | - |
dc.date.available | 2021-05-04T09:02:38Z | - |
dc.date.issued | 2020 | - |
dc.identifier.citation | Formalized Mathematics, Volume 28, Issue 2, Pages 197-210 | pl |
dc.identifier.issn | 1426-2630 | - |
dc.identifier.uri | http://hdl.handle.net/11320/10836 | - |
dc.description.abstract | The use of registrations is useful in shortening Mizar proofs [1], [2], both in terms of formalization time and article space. The proposed system of classes for complex numbers aims to facilitate proofs involving basic arithmetical operations and order checking. It seems likely that the use of self-explanatory adjectives could also improve legibility of these proofs, which would be an important achievement [3]. Additionally, some potentially useful definitions, following those defined for real numbers, are introduced. | pl |
dc.language.iso | en | pl |
dc.publisher | DeGruyter Open | pl |
dc.rights | Attribution-ShareAlike 3.0 Unported (CC BY-SA 3.0) | - |
dc.rights.uri | https://creativecommons.org/licenses/by-sa/3.0/ | - |
dc.subject | complex numbers | pl |
dc.subject | multiplication | pl |
dc.subject | order | pl |
dc.title | Multiplication-Related Classes of Complex Numbers | pl |
dc.type | Article | pl |
dc.rights.holder | © 2020 University of Białymstoku; | - |
dc.rights.holder | CC-BY-SA License ver. 3.0 or later; | - |
dc.identifier.doi | 10.2478/forma-2020-0017 | - |
dc.description.Affiliation | Department of Carbohydrate Technology, University of Agriculture, Krakow, Poland | pl |
dc.description.references | Marco B. Caminati and Giuseppe Rosolini. Custom automations in Mizar. Journal of Automated Reasoning, 50(2):147–160, 2013. | pl |
dc.description.references | Artur Korniłowicz. On rewriting rules in Mizar. Journal of Automated Reasoning, 50(2): 203–210, 2013. | pl |
dc.description.references | Karol Pąk. Improving legibility of natural deduction proofs is not trivial. Logical Methods in Computer Science, 10, 2014. | pl |
dc.identifier.eissn | 1898-9934 | - |
dc.description.volume | 28 | pl |
dc.description.issue | 2 | pl |
dc.description.firstpage | 197 | pl |
dc.description.lastpage | 210 | pl |
dc.identifier.citation2 | Formalized Mathematics | pl |
dc.identifier.orcid | 0000-0001-9681-4380 | - |
Występuje w kolekcji(ach): | Formalized Mathematics, 2020, Volume 28, Issue 2 |
Pliki w tej pozycji:
Plik | Opis | Rozmiar | Format | |
---|---|---|---|---|
10.2478_forma-2020-0017.pdf | 251,88 kB | Adobe PDF | Otwórz |
Pozycja ta dostępna jest na podstawie licencji Licencja Creative Commons CCL