Andrzej Trybulec Selected Publications

• Bronis{\l}aw Krakus and Andrzej Trybulec.
  A strongly convex and not contractible metric space.
  Bull. Acad. Pol. Sci., ser. Math., Astr. et Phys., 15(12):855--860, 1967.
  
• Andrzej Trybulec.
  On a class of syntactic relations.
  Nauchno-Tekhnicheskaya Informatsiya, ser 2, (9):34--37, 1967. in Russian.
  
• Andrzej Trybulec.
  Partitions of the vocabulary in languages with fixed paradigms.
  Nauchno-Tekhnicheskaya Informatsiya, ser. 2, (12):40--44, 1967. in Russian.
  
• Andrzej Trybulec.
  Generalization of the concept of derivative partition.
  Nauchno-Tekhnicheskaya Informatsiya, ser. 2, (12), 1969. in Russian.
  
• Andrzej Trybulec.
  Modeling information processes in science.
  Studia Filozoficzne, 75(2):105--112, 1972. in Polish.
  
• Andrzej Trybulec.
  On movable curves.
  Bull. Acad. Pol. Sci., ser. math., astr. et phys., 21(8):727--733, 1973.
  
• Zygmunt Saloni and Andrzej Trybulec.
  Coherence of text and its topology.
  Semiotica, 2(11):101--108, 1974.
  
• Andrzej Trybulec.
  On the uniqueness of the decomposition of movable shapes into a
  product of 1-dimensional shapes.
  Bull. Acad. Pol. Sci., ser. math., astr. et phys., 23(1):69--73,
  1975.
  
• Jerzy Dydak and Andrzej Trybulec.
  On regularly movable compacta.
  Bull. Acad. Pol. Sci., ser math., astr. et phys., 23(8):907--909, 1875.
  
• Andrzej Trybulec.
  A model of causality.
  Studia Logica, 35(1), 1976.
  
• Andrzej Trybulec.
  The mizar$/QC/6000$ logic information language.
  Bull. of Assoc. for Literary and Linguistic Computing, 6(2):136--140, 1978.
  
• Piotr Rudnicki and Andrzej Trybulec.
  A remark on the syntactic partition.
  Fundamenta Informaticae, 4(3):511--515, 1979.
  
• Andrzej Trybulec.
  On a system of computer-aided instruction of logic.
  Bull. of the Section of Logic, Pol. Acad. of Sci., (12):214--220, 1983.
  
• Andrzej Trybulec and Howard Blair.
  Computer assisted reasoning with mizar.
  In Proc. of IJCAI'85, Los Angeles, pages~26--28, 1985.
  
• Andrzej Trybulec and Howard Blair.
  Computer Aided Reasoning, pages~406--412.
  Volume~193 of Lecture Notes in Computer Science, Springer Verlag, 1985.
  
• Andrzej Trybulec.
  Tarski Grothendieck set theory.
  Formalized Mathematics, 1(1):9--11, 1990.
  
• Andrzej Trybulec.
  Built-in concepts.
  Formalized Mathematics, 1(1):13--15, 1990.
  
• Andrzej Trybulec.
  Enumerated sets.
  Formalized Mathematics, 1(1):25--34, 1990.
  
• Andrzej Trybulec.
  Tuples, projections and Cartesian products.
  Formalized Mathematics, 1(1):97--105, 1990.
  
• Andrzej Trybulec.
  Domains and their Cartesian products.
  Formalized Mathematics, 1(1):115--122, 1990.
  
• Andrzej Trybulec and Agata Darmochwa{\l}.
  Boolean domains.
  Formalized Mathematics, 1(1):187--190, 1990.
  
• Piotr Rudnicki and Andrzej Trybulec.
  A first order language.
  Formalized Mathematics, 1(2):303--311, 1990.
  
• Andrzej Trybulec.
  Binary operations applied to functions.
  Formalized Mathematics, 1(2):329--334, 1990.
  
• Andrzej Trybulec.
  Semilattice operations on finite subsets.
  Formalized Mathematics, 1(2):369--376, 1990.
  
• Andrzej Trybulec and Czes{\l}aw Byli{\'n}ski.
  Some properties of real numbers.
  Formalized Mathematics, 1(3):445--449, 1990.
  
• Pawe{\l} Sadowski, Andrzej Trybulec, and Konrad Raczkowski.
  The fundamental logic structure in quantum mechanics.
  Formalized Mathematics, 1(3):489--494, 1990.
  
• Andrzej Trybulec.
  Function domains and Fr{\ae}nkel operator.
  Formalized Mathematics, 1(3):495--500, 1990.
  
• Andrzej Trybulec.
  Finite join and finite meet and dual lattices.
  Formalized Mathematics, 1(5):983--988, 1990.
  
• Grzegorz Bancerek, Agata Darmochwa{\l}, and Andrzej Trybulec.
  Propositional calculus.
  Formalized Mathematics, 2(1):147--150, 1991.
  
• Czes{\l}aw Byli{\'n}ski and Andrzej Trybulec.
  Complex spaces.
  Formalized Mathematics, 2(1):151--158, 1991.
  
• Jan Popio{\l}ek and Andrzej Trybulec.
  Calculus of propositions.
  Formalized Mathematics, 2(2):305--307, 1991.
  
• Andrzej Trybulec.
  Algebra of normal forms.
  Formalized Mathematics, 2(2):237--242, 1991.
  
• Andrzej Trybulec.
  Algebra of normal forms is a Heyting algebra.
  Formalized Mathematics, 2(3):393--396, 1991.
  
• Andrzej Trybulec.
  Natural transformations. Discrete categories.
  Formalized Mathematics, 2(4):467--474, 1991.
  
• Andrzej Trybulec.
  A Borsuk theorem on homotopy types.
  Formalized Mathematics, 2(4):535--545, 1991.
  
• Andrzej Trybulec.
  Isomorphisms of categories.
  Formalized Mathematics, 2(5):629--634, 1991.
  
• Agata Darmochwa{\l} and Andrzej Trybulec.
  Similarity of formulae.
  Formalized Mathematics, 2(5):635--642, 1991.
  
• Andrzej Trybulec.
  Some isomorphisms between functor categories.
  Formalized Mathematics, 3(1):33--40, 1992.
  
• Yatsuka Nakamura and Andrzej Trybulec.
  A mathematical model of CPU.
  Formalized Mathematics, 3(2):151--160, 1992.
  
• Yatsuka Nakamura and Andrzej Trybulec.
  On a mathematical model of programs.
  Formalized Mathematics, 3(2):241--250, 1992.
  
• Bogdan Nowak and Andrzej Trybulec.
  Hahn-Banach theorem.
  Formalized Mathematics, 4(1):29--34, 1993.
  
• Andrzej Trybulec.
  Many-sorted sets.
  Formalized Mathematics, 4(1):15--22, 1993.
  
• Andrzej Trybulec and Yatsuka Nakamura.
  Some remarks on the simple concrete model of computer.
  Formalized Mathematics, 4(1):51--56, 1993.
  
• Andrzej Trybulec and Yatsuka Nakamura.
  Euclid's algorithm.
  Formalized Mathematics, 4(1):57--60, 1993.
  
• Andrzej Trybulec.
  Many sorted algebras.
  Formalized Mathematics, 5(1), 1994.