REPOZYTORIUM UNIWERSYTETU
W BIAŁYMSTOKU
UwB

  1. Repozytorium Uniwersytetu w Białymstoku
  2. Czasopisma naukowe / Journals
  3. Formalized Mathematics
  4. Formalized Mathematics, 2004, Volume 12, 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/21456
    Pełny rekord metadanych
    Pole DCWartośćJęzyk
    dc.contributor.authorKorniłowicz, Artur-
    dc.date.accessioned2026-11-06T11:09:04Z-
    dc.date.available2026-11-06T11:09:04Z-
    dc.date.issued2004-
    dc.identifier.citationFormalized Mathematics, Volume 12, Issue 1, Pages 33-37pl
    dc.identifier.issn1426-2630-
    dc.identifier.urihttp://hdl.handle.net/11320/21456-
    dc.descriptionThe paper was written during author’s post-doctoral fellowship granted by Shinshu University, Japan.pl
    dc.descriptionThe author wishes to thank Andrzej Trybulec and Grzegorz Bancerek for their very useful comments during writing this article.pl
    dc.description.abstractA tree of execution of a macroinstruction is defined. It is a tree decorated by the instruction locations of a computer. Successors of each vertex are determined by the set of all possible values of the instruction counter after execution of the instruction placed in the location indicated by given vertex.pl
    dc.language.isoenpl
    dc.publisherUniversity of Białystokpl
    dc.rightsCC BY-SA 4.0-
    dc.rights.urihttps://creativecommons.org/licenses/by-sa/4.0/-
    dc.titleA Tree of Execution of a Macroinstructionpl
    dc.typeArticlepl
    dc.rights.holder© 2005 University of Białystokpl
    dc.rights.holderThis work is licensed under the Creative Commons License.pl
    dc.description.AffiliationUniversity of Białystokpl
    dc.description.referencesGrzegorz Bancerek. Cardinal numbers. Formalized Mathematics, 1(2):377–382, 1990.pl
    dc.description.referencesGrzegorz Bancerek. Introduction to trees. Formalized Mathematics, 1(2):421–427, 1990.pl
    dc.description.referencesGrzegorz Bancerek. The ordinal numbers. Formalized Mathematics, 1(1):91–96, 1990.pl
    dc.description.referencesGrzegorz Bancerek. Sequences of ordinal numbers. Formalized Mathematics, 1(2):281–290, 1990.pl
    dc.description.referencesGrzegorz Bancerek. The well ordering relations. Formalized Mathematics, 1(1):123–129, 1990.pl
    dc.description.referencesGrzegorz Bancerek. Zermelo theorem and axiom of choice. Formalized Mathematics, 1(2):265–267, 1990.pl
    dc.description.referencesGrzegorz Bancerek. K¨onig’s lemma. Formalized Mathematics, 2(3):397–402, 1991.pl
    dc.description.referencesGrzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Formalized Mathematics, 1(1):107–114, 1990.pl
    dc.description.referencesCzesław Byliński. A classical first order language. Formalized Mathematics, 1(4):669–676, 1990.pl
    dc.description.referencesCzesław Byliński. Finite sequences and tuples of elements of a non-empty sets. Formalized Mathematics, 1(3):529–536, 1990.pl
    dc.description.referencesCzesław Byliński. Functions and their basic properties. Formalized Mathematics, 1(1):55–65, 1990.pl
    dc.description.referencesCzesław Byliński. Functions from a set to a set. Formalized Mathematics, 1(1):153–164, 1990.pl
    dc.description.referencesCzesław Byliński. Partial functions. Formalized Mathematics, 1(2):357–367, 1990.pl
    dc.description.referencesCzesław Byliński. Some basic properties of sets. Formalized Mathematics, 1(1):47–53, 1990.pl
    dc.description.referencesAgata Darmochwał. Finite sets. Formalized Mathematics, 1(1):165–167, 1990.pl
    dc.description.referencesAgata Darmochwał and Andrzej Trybulec. Similarity of formulae. Formalized Mathematics, 2(5):635–642, 1991.pl
    dc.description.referencesArtur Korniłowicz. On the composition of macro instructions of standard computers. Formalized Mathematics, 9(2):303–316, 2001.pl
    dc.description.referencesYatsuka Nakamura and Andrzej Trybulec. A mathematical model of CPU. Formalized Mathematics, 3(2):151–160, 1992.pl
    dc.description.referencesYasushi Tanaka. On the decomposition of the states of SCM. Formalized Mathematics, 5(1):1–8, 1996.pl
    dc.description.referencesAndrzej Trybulec. Subsets of complex numbers. To appear in Formalized Mathematics.pl
    dc.description.referencesAndrzej Trybulec. Binary operations applied to functions. Formalized Mathematics, 1(2):329–334, 1990.pl
    dc.description.referencesAndrzej Trybulec. Tarski Grothendieck set theory. Formalized Mathematics, 1(1):9–11, 1990.pl
    dc.description.referencesAndrzej Trybulec and Yatsuka Nakamura. Some remarks on the simple concrete model of computer. Formalized Mathematics, 4(1):51–56, 1993.pl
    dc.description.referencesAndrzej Trybulec, Piotr Rudnicki, and Artur Korniłowicz. Standard ordering of instruction locations. Formalized Mathematics, 9(2):291–301, 2001.pl
    dc.description.referencesZinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67–71, 1990.pl
    dc.description.referencesEdmund Woronowicz. Relations and their basic properties. Formalized Mathematics, 1(1):73–83, 1990.pl
    dc.description.volume12pl
    dc.description.issue1pl
    dc.description.firstpage33pl
    dc.description.lastpage37pl
    dc.identifier.citation2Formalized Mathematicspl
    Występuje w kolekcji(ach):Artykuły naukowe (WInf)
    Formalized Mathematics, 2004, Volume 12, Issue 1

    Pliki w tej pozycji:
    Plik Opis RozmiarFormat 
    A_Tree_of_Execution_of_a_Macroinstruction.pdf93,15 kBAdobe PDFOtwórz
    Pokaż uproszczony widok rekordu Zobacz statystyki


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