W BIAŁYMSTOKU
Proszę używać tego identyfikatora do cytowań lub wstaw link do tej pozycji:
http://hdl.handle.net/11320/15402Pełny rekord metadanych
| Pole DC | Wartość | Język |
|---|---|---|
| dc.contributor.author | Korniłowicz, Artur | - |
| dc.date.accessioned | 2023-10-09T10:39:55Z | - |
| dc.date.available | 2023-10-09T10:39:55Z | - |
| dc.date.issued | 2023 | - |
| dc.identifier.citation | Formalized Mathematics, Volume 31, Issue 1, Pages 23-29 | pl |
| dc.identifier.issn | 1426-2630 | - |
| dc.identifier.uri | http://hdl.handle.net/11320/15402 | - |
| dc.description.abstract | In this paper problems 48, 80, 87, 89, and 124 from [7] are formalized, using the Mizar formalism [1], [2], [4]. The work is natural continuation of [5] and [3] as suggested in [6]. | pl |
| dc.language.iso | en | pl |
| dc.publisher | DeGruyter Open | pl |
| dc.rights | Attribution-ShareAlike 3.0 Unported (CC BY-SA 3.0) | pl |
| dc.rights.uri | https://creativecommons.org/licenses/by-sa/3.0/ | pl |
| dc.subject | number theory | pl |
| dc.subject | divisibility | pl |
| dc.subject | primes | pl |
| dc.title | Elementary Number Theory Problems. Part VII | pl |
| dc.type | Article | pl |
| dc.rights.holder | © 2023 The Author(s) | pl |
| dc.rights.holder | CC BY-SA 3.0 license | pl |
| dc.identifier.doi | 10.2478/forma-2023-0003 | - |
| dc.description.Affiliation | Institute of Computer Science, University of Białystok, Poland | pl |
| dc.description.references | Grzegorz Bancerek, Czesław Byliński, Adam Grabowski, Artur Korniłowicz, Roman Matuszewski, Adam Naumowicz, Karol Pąk, and Josef Urban. Mizar: State-of-the-art and beyond. In Manfred Kerber, Jacques Carette, Cezary Kaliszyk, Florian Rabe, and Volker Sorge, editors, Intelligent Computer Mathematics, volume 9150 of Lecture Notes in Computer Science, pages 261–279. Springer International Publishing, 2015. ISBN 978-3-319-20614-1. doi:10.1007/978-3-319-20615-8_17. | pl |
| dc.description.references | Grzegorz Bancerek, Czesław Byliński, Adam Grabowski, Artur Korniłowicz, Roman Matuszewski, Adam Naumowicz, and Karol Pąk. The role of the Mizar Mathematical Library for interactive proof development in Mizar. Journal of Automated Reasoning, 61(1):9–32, 2018. doi:10.1007/s10817-017-9440-6. | pl |
| dc.description.references | Adam Grabowski. Elementary number theory problems. Part VI. Formalized Mathematics, 30(3):235–244, 2022. doi:10.2478/forma-2022-0019. | pl |
| dc.description.references | Artur Korniłowicz. Flexary connectives in Mizar. Computer Languages, Systems & Structures, 44:238–250, December 2015. doi:10.1016/j.cl.2015.07.002. | pl |
| dc.description.references | Artur Korniłowicz and Adam Naumowicz. Elementary number theory problems. Part V. Formalized Mathematics, 30(3):229–234, 2022. doi:10.2478/forma-2022-0018. | pl |
| dc.description.references | Adam Naumowicz. Dataset description: Formalization of elementary number theory in Mizar. In Christoph Benzmuller and Bruce R. Miller, editors, Intelligent Computer Mathematics – 13th International Conference, CICM 2020, Bertinoro, Italy, July 26–31, 2020,Proceedings, volume 12236 of Lecture Notes in Computer Science, pages 303–308. Springer, 2020. doi:10.1007/978-3-030-53518-6_22. | pl |
| dc.description.references | Wacław Sierpiński. 250 Problems in Elementary Number Theory. Elsevier, 1970. | pl |
| dc.description.references | Li Yan, Xiquan Liang, and Junjie Zhao. Gauss lemma and law of quadratic reciprocity. Formalized Mathematics, 16(1):23–28, 2008. doi:10.2478/v10037-008-0004-4. | pl |
| dc.identifier.eissn | 1898-9934 | - |
| dc.description.volume | 31 | pl |
| dc.description.issue | 1 | pl |
| dc.description.firstpage | 23 | pl |
| dc.description.lastpage | 29 | pl |
| dc.identifier.citation2 | Formalized Mathematics | pl |
| dc.identifier.orcid | 0000-0002-4565-9082 | - |
| Występuje w kolekcji(ach): | Artykuły naukowe (WInf) Formalized Mathematics, 2023, Volume 31, Issue 1 | |
Pliki w tej pozycji:
| Plik | Opis | Rozmiar | Format | |
|---|---|---|---|---|
| 10.2478_forma-2023-0003.pdf | 225,55 kB | Adobe PDF | Otwórz |
Pozycja ta dostępna jest na podstawie licencji Licencja Creative Commons CCL
