REPOZYTORIUM UNIWERSYTETU
W BIAŁYMSTOKU
UwB

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

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/3711
    Pełny rekord metadanych
    Pole DCWartośćJęzyk
    dc.contributor.authorBancerek, Grzegorz-
    dc.date.accessioned2015-12-09T20:40:51Z-
    dc.date.available2015-12-09T20:40:51Z-
    dc.date.issued2014-
    dc.identifier.citationFormalized Mathematics, Volume 22, Issue 2, 2014, Pages 125-155-
    dc.identifier.issn1426-2630-
    dc.identifier.issn1898-9934-
    dc.identifier.urihttp://hdl.handle.net/11320/3711-
    dc.description.abstractTwo construction functors: simple term with a variable and compound term with an operation and argument terms and schemes of term induction are introduced. The degree of construction as a number of used operation symbols is defined. Next, the term context is investigated. An x-context is a term which includes a variable x once only. The compound term is x-context iff the argument terms include an x-context once only. The context induction is shown and used many times. As a key concept, the context substitution is introduced. Finally, the translations and endomorphisms are expressed by context substitution.-
    dc.language.isoen-
    dc.publisherDe Gruyter Open-
    dc.subjectconstruction degree-
    dc.subjectcontext-
    dc.subjecttranslation-
    dc.subjectendomorphism-
    dc.titleTerm Context-
    dc.typeArticle-
    dc.identifier.doi10.2478/forma-2014-0015-
    dc.description.AffiliationBancerek Grzegorz - Association of Mizar Users Białystok, Poland-
    dc.description.referencesGrzegorz Bancerek. Towards the construction of a model of Mizar concepts. Formalized Mathematics, 16(2):207–230, 2008. doi:10.2478/v10037-008-0027-x.-
    dc.description.referencesGrzegorz Bancerek. Cardinal numbers. Formalized Mathematics, 1(2):377–382, 1990.-
    dc.description.referencesGrzegorz Bancerek. Cardinal arithmetics. Formalized Mathematics, 1(3):543–547, 1990.-
    dc.description.referencesGrzegorz Bancerek. König’s theorem. Formalized Mathematics, 1(3):589–593, 1990.-
    dc.description.referencesGrzegorz Bancerek. On powers of cardinals. Formalized Mathematics, 3(1):89–93, 1992.-
    dc.description.referencesGrzegorz Bancerek. Algebra of morphisms. Formalized Mathematics, 6(2):303–310, 1997.-
    dc.description.referencesGrzegorz Bancerek. Tarski’s classes and ranks. Formalized Mathematics, 1(3):563–567, 1990.-
    dc.description.referencesGrzegorz Bancerek. Cartesian product of functions. Formalized Mathematics, 2(4):547– 552, 1991.-
    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. 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. Translations, endomorphisms, and stable equational theories. Formalized Mathematics, 5(4):553–564, 1996.-
    dc.description.referencesGrzegorz Bancerek. The fundamental properties of natural numbers. Formalized Mathematics, 1(1):41–46, 1990.-
    dc.description.referencesGrzegorz Bancerek. The ordinal numbers. Formalized Mathematics, 1(1):91–96, 1990.-
    dc.description.referencesGrzegorz Bancerek. Veblen hierarchy. Formalized Mathematics, 19(2):83–92, 2011. doi:10.2478/v10037-011-0014-5.-
    dc.description.referencesGrzegorz Bancerek. Reduction relations. Formalized Mathematics, 5(4):469–478, 1996.-
    dc.description.referencesGrzegorz Bancerek. Introduction to trees. Formalized Mathematics, 1(2):421–427, 1990.-
    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. Subtrees. Formalized Mathematics, 5(2):185–190, 1996.-
    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 Piotr Rudnicki. On defining functions on trees. Formalized Mathematics, 4(1):91–101, 1993.-
    dc.description.referencesGrzegorz Bancerek and Andrzej Trybulec. Miscellaneous facts about functions. Formalized Mathematics, 5(4):485–492, 1996.-
    dc.description.referencesCzesław Byliński. Finite sequences and tuples of elements of a non-empty sets. Formalized Mathematics, 1(3):529–536, 1990.-
    dc.description.referencesCzesław Byliński. Functions and their basic properties. Formalized Mathematics, 1(1): 55–65, 1990.-
    dc.description.referencesCzesław Byliński. Functions from a set to a set. Formalized Mathematics, 1(1):153–164, 1990. Term context 155-
    dc.description.referencesCzesław Byliński. The modification of a function by a function and the iteration of the composition of a function. Formalized Mathematics, 1(3):521–527, 1990.-
    dc.description.referencesCzesław Byliński. Graphs of functions. Formalized Mathematics, 1(1):169–173, 1990.-
    dc.description.referencesCzesław Byliński. Partial functions. Formalized Mathematics, 1(2):357–367, 1990.-
    dc.description.referencesCzesław Byliński. 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.referencesAndrzej Kondracki. Basic properties of rational numbers. Formalized Mathematics, 1(5): 841–845, 1990.-
    dc.description.referencesAndrzej Kondracki. The Chinese Remainder Theorem. Formalized Mathematics, 6(4): 573–577, 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. Convergent real sequences. Upper and lower bound of sets of real numbers. Formalized Mathematics, 1(3):477–481, 1990.-
    dc.description.referencesYatsuka Nakamura. Determinant of some matrices of field elements. Formalized Mathematics, 14(1):1–5, 2006. doi:10.2478/v10037-006-0001-4.-
    dc.description.referencesHiroyuki Okazaki, Yuichi Futa, and Yasunari Shidama. Constructing binary Huffman tree. Formalized Mathematics, 21(2):133–143, 2013. doi:10.2478/forma-2013-0015.-
    dc.description.referencesBeata Perkowska. Free many sorted universal algebra. Formalized Mathematics, 5(1): 67–74, 1996.-
    dc.description.referencesKarol Pąk. Abstract simplicial complexes. Formalized Mathematics, 18(1):95–106, 2010. doi:10.2478/v10037-010-0013-y.-
    dc.description.referencesAndrzej Trybulec. Domains and their Cartesian products. Formalized Mathematics, 1(1): 115–122, 1990.-
    dc.description.referencesAndrzej Trybulec. Function domains and Frænkel operator. Formalized Mathematics, 1 (3):495–500, 1990.-
    dc.description.referencesAndrzej Trybulec. Binary operations applied to functions. Formalized Mathematics, 1 (2):329–334, 1990.-
    dc.description.referencesAndrzej Trybulec. Tuples, projections and Cartesian products. Formalized Mathematics, 1(1):97–105, 1990.-
    dc.description.referencesAndrzej Trybulec. On the sets inhabited by numbers. Formalized Mathematics, 11(4): 341–347, 2003.-
    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. Non-contiguous substrings and one-to-one finite sequences. Formalized Mathematics, 1(3):569–573, 1990.-
    dc.description.referencesWojciech A. Trybulec. Pigeon hole principle. Formalized Mathematics, 1(3):575–579, 1990.-
    dc.description.referencesZinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67–71, 1990.-
    dc.description.referencesEdmund Woronowicz. Relations and their basic properties. Formalized Mathematics, 1 (1):73–83, 1990.-
    dc.description.referencesEdmund Woronowicz. Relations defined on sets. Formalized Mathematics, 1(1):181–186, 1990.-
    Występuje w kolekcji(ach):Formalized Mathematics, 2014, Volume 22, Issue 2

    Pliki w tej pozycji:
    Plik Opis RozmiarFormat 
    forma-2014-0015.pdf430,61 kBAdobe PDFOtwórz
    Pokaż uproszczony widok rekordu Zobacz statystyki


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