Programs in partial algebras
type: Item
instance of: scholarly article
title: Programs in partial algebras
zbMATH Open document ID: 0784.08005
DOI: 10.1016/0304-3975(93)90058-2
author: Grzegorz Jarzembski
published in: Theoretical Computer Science
publication date: 1993-10-17T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 08A55
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 08A70
zbMATH DE Number: 417341
zbMATH Keywords: infinite branches
zbMATH Keywords: loops
zbMATH Keywords: implicit operations
zbMATH Keywords: sheaf
zbMATH Keywords: total order disconnected topological space
MaRDI profile type: Publication
full work available at URL: 0304-3975(93)90058-2
OpenAlex ID: W2094455713
cites work: Q3731650
cites work: Q3898534
cites work: Q4200260
cites work: Algebras with a Scheme of Operators
cites work: Finitary spectral algebraic theories
cites work: Weak varieties of partial algebras
cites work: Sheaves of implicit operations in weak varieties of partial algebras
cites work: Q4145861
cites work: Q3222242
description: scientific article; zbMATH DE number 417341