scientific article; zbMATH DE number 4039258

From MaRDI portal
Publication:3777429





[For the entire collection see Zbl 0623.00002.] Modelling in this brief survey paper is understood in two manners. First, in the sense of universal algebra: Let \({\mathfrak D}\) be an algebra with one binary operation ``\(\cdot\). Then an arbitrary algebraic structure \({\mathfrak H}\) may be represented inside \({\mathfrak D}\) by an element \(h\in {\mathfrak D}\), representing the underlying set H of \({\mathfrak H}\) as a retract, namely \(H=\{x\in D:\) \(h\cdot x=h\}\), and an operation \(\gamma\) of \({\mathfrak H}\) may be represented inside \({\mathfrak D}\) (and for elements of H) by an element \(g\in D\) such that (g\(\cdot x)\cdot y\) is that element of H which correponds to the value of \(\gamma\) on x and y. It is shown that slight generalization \(\bar{\mathfrak H}\) of \({\mathfrak H}\) can indeed be embedded in some model of combinatory logic; this representation is uniform in the sense that for any variety V the set of represented elements of V inside \({\mathfrak D}\) corresponds to the set of solutions of a set of equations for h and g in \({\mathfrak D}\). The model of combinatory logic used is understood as a set of formal objects that can be interpreted as cumulative logic programs, a generalization of Horn- clause logic programs. These objects are used for a second kind of modelling, namely that of qualitative models for interacting processes; some examples are given.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3777429)