REPOZYTORIUM UNIWERSYTETU
W BIAŁYMSTOKU
UwB

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

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/3649
    Pełny rekord metadanych
    Pole DCWartośćJęzyk
    dc.contributor.authorBancerek, Grzegorz-
    dc.date.accessioned2015-12-06T19:05:56Z-
    dc.date.available2015-12-06T19:05:56Z-
    dc.date.issued2012-
    dc.identifier.citationFormalized Mathematics, Volume 20, Issue 3, 2012, Pages 239-256-
    dc.identifier.issn1426-2630-
    dc.identifier.issn1898-9934-
    dc.identifier.urihttp://hdl.handle.net/11320/3649-
    dc.description.abstractWe interoduce a new characterization of algebras of normal forms of term rewriting systems [35] as algerbras of term free in itself (any function from free generators into the algebra generates endomorphism of the algebra). Introduced algebras are free in classes of algebras satisfying some sets of equalities. Their universes are subsets of all terms and the denotations of operation symbols are partially identical with the operations of construction of terms. These algebras are compiler algebras requiring some equalities of terms, e.g., associativity of addition.-
    dc.description.sponsorshipThis work has been supported by the Polish Ministry of Science and Higher Education project “Managing a Large Repository of Computer-verified Mathematical Knowledge” (N N519 385136).-
    dc.language.isoen-
    dc.publisherDe Gruyter Open-
    dc.titleFree Term Algebras-
    dc.typeArticle-
    dc.identifier.doi10.2478/v10037-012-0029-6-
    dc.description.AffiliationFaculty of Computer Science, Białystok Technical University, Wiejska 45A, 15-351 Białystok, Poland-
    dc.description.referencesGrzegorz Bancerek. Cardinal numbers. Formalized Mathematics, 1(2):377-382, 1990.-
    dc.description.referencesGrzegorz Bancerek. Introduction to trees. Formalized Mathematics, 1(2):421-427, 1990.-
    dc.description.referencesGrzegorz Bancerek. König’s theorem. Formalized Mathematics, 1(3):589-593, 1990.-
    dc.description.referencesGrzegorz Bancerek. The ordinal numbers. Formalized Mathematics, 1(1):91-96, 1990.-
    dc.description.referencesGrzegorz Bancerek. Cartesian product of functions. Formalized Mathematics, 2(4):547-552, 1991.-
    dc.description.referencesGrzegorz Bancerek. König’s lemma. Formalized Mathematics, 2(3):397-402, 1991.-
    dc.description.referencesGrzegorz Bancerek. Sets and functions of trees and joining operations of trees. Formalized Mathematics, 3(2):195-204, 1992.-
    dc.description.referencesGrzegorz Bancerek. Joining of decorated trees. Formalized Mathematics, 4(1):77-82, 1993.-
    dc.description.referencesGrzegorz Bancerek. Reduction relations. Formalized Mathematics, 5(4):469-478, 1996.-
    dc.description.referencesGrzegorz Bancerek. Subtrees. Formalized Mathematics, 5(2):185-190, 1996.-
    dc.description.referencesGrzegorz Bancerek. Terms over many sorted universal algebra. Formalized Mathematics, 5(2):191-198, 1996.-
    dc.description.referencesGrzegorz Bancerek. Translations, endomorphisms, and stable equational theories. Formalized Mathematics, 5(4):553-564, 1996.-
    dc.description.referencesGrzegorz Bancerek. Algebra of morphisms. Formalized Mathematics, 6(2):303-310, 1997.-
    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 and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Formalized Mathematics, 1(1):107-114, 1990.[16] Grzegorz Bancerek and Artur Korniłowicz. Yet another construction of free algebra. Formalized Mathematics, 9(4):779-785, 2001.-
    dc.description.referencesGrzegorz Bancerek and Piotr Rudnicki. On defining functions on trees. Formalized Mathematics, 4(1):91-101, 1993.-
    dc.description.referencesGrzegorz Bancerek and Piotr Rudnicki. The set of primitive recursive functions. Formalized Mathematics, 9(4):705-720, 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. 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. Some basic properties of sets. Formalized Mathematics, 1(1):47-53, 1990.-
    dc.description.referencesAgata Darmochwał. Finite sets. Formalized Mathematics, 1(1):165-167, 1990.-
    dc.description.referencesArtur Korniłowicz. Some basic properties of many sorted sets. Formalized Mathematics, 5(3):395-399, 1996.-
    dc.description.referencesArtur Korniłowicz. Equations in many sorted algebras. Formalized Mathematics, 6(3):363-369, 1997.-
    dc.description.referencesMałgorzata Korolkiewicz. Homomorphisms of many sorted algebras. Formalized Mathematics, 5(1):61-65, 1996.-
    dc.description.referencesMałgorzata Korolkiewicz. Many sorted quotient algebra. Formalized Mathematics, 5(1):79-84, 1996.-
    dc.description.referencesJarosław Kotowicz. Functions and finite sequences of real numbers. Formalized Mathematics, 3(2):275-278, 1992.-
    dc.description.referencesAdam Naumowicz. On Segre’s product of partial line spaces. Formalized Mathematics, 9(2):383-390, 2001.-
    dc.description.referencesAndrzej Nedzusiak. Probability. Formalized Mathematics, 1(4):745-749, 1990.-
    dc.description.referencesBeata Padlewska. Families of sets. Formalized Mathematics, 1(1):147-152, 1990.-
    dc.description.referencesBeata Perkowska. Free many sorted universal algebra. Formalized Mathematics, 5(1):67-74, 1996.-
    dc.description.referencesD.M. Gabbay S. Abramsky and T.S.E. Maibaum, editors. Handbook of Logic inComputer Science, chapter Term Rewriting Systems, pages 1-116. Oxford University Press, New York, 1992. http://www.informatik.uni-bremen.de/agbkb/lehre/-rbs/texte/Klop-TR.pdf.-
    dc.description.referencesAndrzej Trybulec. Binary operations applied to functions. Formalized Mathematics, 1(2):329-334, 1990.-
    dc.description.referencesAndrzej Trybulec. Many sorted sets. Formalized Mathematics, 4(1):15-22, 1993.-
    dc.description.referencesAndrzej Trybulec. Many sorted algebras. Formalized Mathematics, 5(1):37-42, 1996.-
    dc.description.referencesAndrzej Trybulec. A scheme for extensions of homomorphisms of many sorted algebras. Formalized Mathematics, 5(2):205-209, 1996.-
    dc.description.referencesZinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67-71, 1990.-
    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.-
    dc.description.referencesEdmund Woronowicz and Anna Zalewska. Properties of binary relations. Formalized Mathematics, 1(1):85-89, 1990.-
    Występuje w kolekcji(ach):Formalized Mathematics, 2012, Volume 20, Issue 3

    Pliki w tej pozycji:
    Plik Opis RozmiarFormat 
    v10037-012-0029-6.pdf316,95 kBAdobe PDFOtwórz
    Pokaż uproszczony widok rekordu Zobacz statystyki


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