Restriction in program algebra

• Published in: Logic journal of the IGPL Vol. 31; no. 5; pp. 926 - 960
• Main Authors: Jackson, Marcel, Stokes, Tim
• Format: Journal Article
• Language: English
• Published: Oxford University Press 25.09.2023
• Subjects: finite axiomatization; update; partial function; Override; domain restriction
• ISSN: 1367-0751; 1368-9894
• DOI: 10.1093/jigpal/jzac058

Abstract We provide complete classifications of algebras of partial maps for a significant swathe of combinations of operations not previously classified. Our focus is the many subsidiary operations that arise in recent considerations of the ‘override’ and ‘update’ operations arising in specification languages. These other operations turn out to have an older pedigree: domain restriction, set subtraction and intersection. All signatures considered include domain restriction, at least as a term. Combinations of the operations are classified and given complete axiomatizations with and without the presence of functional composition. Each classification is achieved by way of providing a concrete representation of the corresponding abstract algebras as partial maps acting on special kinds of filters determined with respect to various induced orders. In contrast to many negative results in the broader area, all of the considered combinations lead to finite axiomatizations.