REPOZYTORIUM UNIWERSYTETU
W BIAŁYMSTOKU
UwB

Proszę używać tego identyfikatora do cytowań lub wstaw link do tej pozycji: http://hdl.handle.net/11320/7835
Pełny rekord metadanych
Pole DCWartośćJęzyk
dc.contributor.authorZiobro, Rafał-
dc.date.accessioned2019-05-21T07:17:59Z-
dc.date.available2019-05-21T07:17:59Z-
dc.date.issued2019-
dc.identifier.citationFormalized Mathematics, Volume 27, Issue 1, Pages 1-13-
dc.identifier.issn1426-2630-
dc.identifier.urihttp://hdl.handle.net/11320/7835-
dc.description.abstractThe coexistence of “classical” finite sequences [1] and their zero-based equivalents finite 0-sequences [6] in Mizar has been regarded as a disadvantage. However the suggested replacement of the former type with the latter [5] has not yet been implemented, despite of several advantages of this form, such as the identity of length and domain operators [4]. On the other hand the number of theorems formalized using finite sequence notation is much larger then of those based on finite 0-sequences, so such translation would require quite an effort. The paper addresses this problem with another solution, using the Mizar system [3], [2]. Instead of removing one notation it is possible to introduce operators which would concatenate sequences of various types, and in this way allow utilization of the whole range of formalized theorems. While the operation could replace existing FS2XFS, XFS2FS commands (by using empty sequences as initial elements) its universal notation (independent on sequences that are concatenated to the initial object) allows to “forget” about the type of sequences that are concatenated on further positions, and thus simplify the proofs.-
dc.language.isoen-
dc.publisherDeGruyter Open-
dc.subjectfinite sequence-
dc.subjectfinite 0-sequence-
dc.subjectconcatenation-
dc.titleConcatenation of Finite Sequences-
dc.typeArticle-
dc.identifier.doi10.2478/forma-2019-0001-
dc.description.AffiliationDepartment of Carbohydrate Technology, University of Agriculture, Krakow, Poland-
dc.description.referencesGrzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Formalized Mathematics, 1(1):107–114, 1990.-
dc.description.referencesGrzegorz Bancerek, Czesław Byliński, Adam Grabowski, Artur Korniłowicz, Roman Matuszewski, Adam Naumowicz, and Karol Pak. 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. Concatenation of finite sequences 13-
dc.description.referencesAdam Grabowski, Artur Korniłowicz, and Adam Naumowicz. Four decades of Mizar. Journal of Automated Reasoning, 55(3):191–198, 2015. doi:10.1007/s10817-015-9345-1.-
dc.description.referencesArtur Kornilowicz. How to define terms in Mizar effectively. Studies in Logic, Grammar and Rhetoric, 18:67–77, 2009.-
dc.description.referencesPiotr Rudnicki and Andrzej Trybulec. On the integrity of a repository of formalized mathematics. In Andrea Asperti, Bruno Buchberger, and James H. Davenport, editors, Mathematical Knowledge Management, volume 2594 of Lecture Notes in Computer Science, pages 162–174. Springer, Berlin, Heidelberg, 2003. doi:10.1007/3-540-36469-2_13.-
dc.description.referencesTetsuya Tsunetou, Grzegorz Bancerek, and Yatsuka Nakamura. Zero-based finite sequences. Formalized Mathematics, 9(4):825–829, 2001.-
dc.description.referencesRafał Ziobro. Fermat’s Little Theorem via divisibility of Newton’s binomial. Formalized Mathematics, 23(3):215–229, 2015. doi:10.1515/forma-2015-0018.-
dc.description.referencesRafał Ziobro. On subnomials. Formalized Mathematics, 24(4):261–273, 2016. doi:10.1515/forma-2016-0022.-
dc.identifier.eissn1898-9934-
dc.description.volume27-
dc.description.issue1-
dc.description.firstpage1-
dc.description.lastpage13-
dc.identifier.citation2Formalized Mathematics-
dc.identifier.orcid0000-0001-9681-4380-
Występuje w kolekcji(ach):Formalized Mathematics, 2019, Volume 27, Issue 1

Pliki w tej pozycji:
Plik Opis RozmiarFormat 
forma_2019_27_1_001.pdf250,4 kBAdobe PDFOtwórz
Pokaż uproszczony widok rekordu Zobacz statystyki


Pozycja ta dostępna jest na podstawie licencji Licencja Creative Commons CCL Creative Commons