REPOZYTORIUM UNIWERSYTETU
W BIAŁYMSTOKU
UwB

  1. Repozytorium Uniwersytetu w Białymstoku
  2. Czasopisma naukowe / Journals
  3. Formalized Mathematics
  4. Formalized Mathematics, 2013, Volume 21, Issue 1

Szukanie zaawansowane
  • Zespoły i Kolekcje


  • Zaloguj się
  • Zarejestruj się
  • Mój RUB
  • FAQ
  • Polityka
  • Regulamin
  • DOI
  • Instrukcja
  • Aspekty prawne
  • Open Access
  • Archiwum


  • Kontakt
  • O Dspace
  • Strona Biblioteki
  • Strona Uczelni



    • Proszę używać tego identyfikatora do cytowań lub wstaw link do tej pozycji: http://hdl.handle.net/11320/3668
    Pełny rekord metadanych
    Pole DCWartośćJęzyk
    dc.contributor.authorBancerek, Grzegorz-
    dc.date.accessioned2015-12-09T20:39:05Z-
    dc.date.available2015-12-09T20:39:05Z-
    dc.date.issued2013-
    dc.identifier.citationFormalized Mathematics, Volume 21, Issue 1, 2013, Pages 1-23-
    dc.identifier.issn1426-2630-
    dc.identifier.issn1898-9934-
    dc.identifier.urihttp://hdl.handle.net/11320/3668-
    dc.description.abstractWe analyse three algorithms: exponentiation by squaring, calculation of maximum, and sorting by exchanging in terms of program algebra over an algebra.-
    dc.language.isoen-
    dc.publisherDe Gruyter Open-
    dc.titleAnalysis of Algorithms: An Example of a Sort Algorithm-
    dc.typeArticle-
    dc.identifier.doi10.2478/forma-2013-0001-
    dc.description.AffiliationAssociation of Mizar Users Białystok, Poland-
    dc.description.referencesGrzegorz Bancerek. Mizar analysis of algorithms: Preliminaries. Formalized Mathematics, 15(3):87-110, 2007. doi:10.2478/v10037-007-0011-x.-
    dc.description.referencesGrzegorz Bancerek. Program algebra over an algebra. Formalized Mathematics, 20(4): 309-341, 2012. doi:10.2478/v10037-012-0037-6.-
    dc.description.referencesGrzegorz Bancerek. Cardinal numbers. Formalized Mathematics, 1(2):377-382, 1990.-
    dc.description.referencesGrzegorz Bancerek. Sorting by exchanging. Formalized Mathematics, 19(2):93-102, 2011. doi:10.2478/v10037-011-0015-4.-
    dc.description.referencesGrzegorz Bancerek. Institution of many sorted algebras. Part I: Signature reduct of an algebra. Formalized Mathematics, 6(2):279-287, 1997.-
    dc.description.referencesGrzegorz Bancerek. Complete lattices. Formalized Mathematics, 2(5):719-725, 1991.-
    dc.description.referencesGrzegorz Bancerek. Free term algebras. Formalized Mathematics, 20(3):239-256, 2012. doi:10.2478/v10037-012-0029-6.-
    dc.description.referencesGrzegorz Bancerek. Terms over many sorted universal algebra. Formalized Mathematics, 5(2):191-198, 1996.-
    dc.description.referencesGrzegorz Bancerek. The ordinal numbers. Formalized Mathematics, 1(1):91-96, 1990.-
    dc.description.referencesGrzegorz Bancerek. König’s lemma. Formalized Mathematics, 2(3):397-402, 1991.-
    dc.description.referencesGrzegorz Bancerek. Joining of decorated trees. Formalized Mathematics, 4(1):77-82, 1993.-
    dc.description.referencesGrzegorz Bancerek. Directed sets, nets, ideals, filters, and maps. Formalized Mathematics, 6(1):93-107, 1997.-
    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 and Artur Korniłowicz. Yet another construction of free algebra. Formalized Mathematics, 9(4):779-785, 2001.-
    dc.description.referencesGrzegorz Bancerek and Andrzej Trybulec. Miscellaneous facts about functions. Formalized Mathematics, 5(4):485-492, 1996.-
    dc.description.referencesEwa Burakowska. Subalgebras of many sorted algebra. Lattice of subalgebras. Formalized Mathematics, 5(1):47-54, 1996.-
    dc.description.referencesCzesław Bylinski. Binary operations. Formalized Mathematics, 1(1):175-180, 1990.-
    dc.description.referencesCzesław Bylinski. Finite sequences and tuples of elements of a non-empty sets. Formalized Mathematics, 1(3):529-536, 1990.-
    dc.description.referencesCzesław Bylinski. Functions and their basic properties. Formalized Mathematics, 1(1): 55-65, 1990.-
    dc.description.referencesCzesław Bylinski. Functions from a set to a set. Formalized Mathematics, 1(1):153-164, 1990.-
    dc.description.referencesCzesław Bylinski. Partial functions. Formalized Mathematics, 1(2):357-367, 1990.-
    dc.description.referencesCzesław Bylinski. Galois connections. Formalized Mathematics, 6(1):131-143, 1997.-
    dc.description.referencesAgata Darmochwał. Finite sets. Formalized Mathematics, 1(1):165-167, 1990.-
    dc.description.referencesMałgorzata Korolkiewicz. Homomorphisms of many sorted algebras. Formalized Mathematics, 5(1):61-65, 1996.-
    dc.description.referencesJarosław Kotowicz, Beata Madras, and Małgorzata Korolkiewicz. Basic notation of universal algebra. Formalized Mathematics, 3(2):251-253, 1992.-
    dc.description.referencesRafał Kwiatek. Factorial and Newton coefficients. Formalized Mathematics, 1(5):887-890, 1990.-
    dc.description.referencesTakashi Mitsuishi and Grzegorz Bancerek. Lattice of fuzzy sets. Formalized Mathematics, 11(4):393-398, 2003.-
    dc.description.referencesBeata Perkowska. Free many sorted universal algebra. Formalized Mathematics, 5(1): 67-74, 1996.-
    dc.description.referencesAndrzej Trybulec. Binary operations applied to functions. Formalized Mathematics, 1 (2):329-334, 1990.-
    dc.description.referencesAndrzej Trybulec. A scheme for extensions of homomorphisms of many sorted algebras. Formalized Mathematics, 5(2):205-209, 1996.-
    dc.description.referencesAndrzej Trybulec. Many sorted algebras. Formalized Mathematics, 5(1):37-42, 1996.-
    dc.description.referencesAndrzej Trybulec. Many sorted sets. Formalized Mathematics, 4(1):15-22, 1993.-
    dc.description.referencesMichał J. Trybulec. Integers. Formalized Mathematics, 1(3):501-505, 1990.-
    dc.description.referencesWojciech A. Trybulec. Pigeon hole principle. Formalized Mathematics, 1(3):575-579, 1990.-
    dc.description.referencesWojciech A. Trybulec and Grzegorz Bancerek. Kuratowski - Zorn lemma. Formalized Mathematics, 1(2):387-393, 1990.-
    dc.description.referencesZinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67-71, 1990.-
    dc.description.referencesTetsuya Tsunetou, Grzegorz Bancerek, and Yatsuka Nakamura. Zero-based finite sequences. Formalized Mathematics, 9(4):825-829, 2001.-
    dc.description.referencesEdmund Woronowicz. Many argument relations. Formalized Mathematics, 1(4):733-737, 1990.-
    dc.description.referencesEdmund Woronowicz. Relations and their basic properties. Formalized Mathematics, 1 (1):73-83, 1990.-
    Występuje w kolekcji(ach):Formalized Mathematics, 2013, Volume 21, Issue 1

    Pliki w tej pozycji:
    Plik Opis RozmiarFormat 
    forma-2013-0001.pdf301,58 kBAdobe PDFOtwórz
    Pokaż uproszczony widok rekordu Zobacz statystyki


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