<p> Graphs are defined as a special kind of relational system and an analogue of Birkhoff's Representation Theorem for Universal Algebras is proved. The notion of ultrapower, a specialization of the ultraproducts introduced into Mathematical Logic by Tarski, Scott and others, is demonstrated to provide a unifying framework within which various problems of graph theory and infinite combinatorial mathematics can be formulated and solved. Thus, theorems extending to the infinite case results of N.G.de Bruijn and P.Erdős in graph colouring, and of P. and M. Hall in combinatorial set theory are proved via the method of ultrapowers. Finally, the problem of embedding graphs in certain topological spaces is taken up, and a characterization of infinite connected planar graphs is derived (see Introduction). </p> / Thesis / Doctor of Philosophy (PhD)

In this work a coherent survey of problems connected with relational knowledge representation and methods for achieving relational knowledge representation were presented. Proposed approach was shown on three applications: economic case, biomedical case and benchmark dataset. All crucial definitions were formulated and three main methods for relation identification problem were shown. Moreover, for specific relational models and observations’ types different identification methods were presented. / Double Diploma Programme, polish supervisor: prof. Jerzy Świątek, Wrocław University of Technology