Programs in partial algebras (Q685398): Difference between revisions

In the paper ``programs'' in partial algebras are understood, in an intuitive sense, as a class constructed starting from term operations by using branches, compositions, restrictions, and loops. It is shown that such programs may be regarded as a subclass of implicit operations (in a weak variety of partial algebras considered). However, since arbitrary ``infinite branches'' are allowed, we cannot identify ``programs'' in the sense of the paper with ``recursive programs''. It is proved that programs form a dense subclass of the class of all implicit operations. If a weak variety considered is elementary (i.e. it has a first order description) then programs with a fixed arity form a sheaf on a suitably defined compact and total order disconnected topological space.