Results 1 
7 of
7
GALOIS THEORY FOR SETS OF OPERATIONS CLOSED UNDER PERMUTATION, CYLINDRIFICATION AND COMPOSITION
, 2012
"... A set of operations on A is shown to be the set of linear term operations of some algebra on A if and only if it is closed under permutation of variables, addition of inessential variables and composition and it contains all projections. A Galois framework is introduced to describe the sets of ope ..."
Abstract
 Add to MetaCart
A set of operations on A is shown to be the set of linear term operations of some algebra on A if and only if it is closed under permutation of variables, addition of inessential variables and composition and it contains all projections. A Galois framework is introduced to describe the sets
GALOIS CONNECTION FOR SETS OF OPERATIONS CLOSED UNDER PERMUTATION, CYLINDRIFICATION AND COMPOSITION
, 2010
"... ..."
Semantic foundations of concurrent constraint programming
, 1990
"... Concurrent constraint programming [Sar89,SR90] is a simple and powerful model of concurrent computation based on the notions of storeasconstraint and process as information transducer. The storeasvaluation conception of von Neumann computing is replaced by the notion that the store is a constr ..."
Abstract

Cited by 276 (27 self)
 Add to MetaCart
diagonal elements and “cylindrification ” operations (which mimic the projection of information induced by existential quantifiers). The se;ond contribution is to introduce the notion of determinate concurrent constraint programming languages. The combinators treated are ask, tell, parallel composition
Peirce Algebras
, 1992
"... We present a twosorted algebra, called a Peirce algebra, of relations and sets interacting with each other. In a Peirce algebra, sets can combine with each other as in a Boolean algebra, relations can combine with each other as in a relation algebra, and in addition we have both a relationforming o ..."
Abstract

Cited by 28 (10 self)
 Add to MetaCart
operator on sets (the Peirce product of Boolean modules) and a setforming operator on relations (a cylindrification operation). Two applications of Peirce algebras are given. The first points out that Peirce algebras provide a natural algebraic framework for modelling certain programming constructs
Representable Cylindric Algebras and ManyDimensional Modal Logics
, 2010
"... The equationally expressible properties of the cylindrifications and the diagonals in finitedimensional representable cylindric algebras can be divided into two groups: (i) ‘Onedimensional ’ properties describing individual cylindrifications. These can be fully characterised by finitely many equat ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The equationally expressible properties of the cylindrifications and the diagonals in finitedimensional representable cylindric algebras can be divided into two groups: (i) ‘Onedimensional ’ properties describing individual cylindrifications. These can be fully characterised by finitely many
An Algebraic Perspective of Constraint Logic Programming
 JOURNAL OF LOGIC AND COMPUTATION
, 1995
"... We develop a denotational, fully abstract semantics for constraint logic programming (clp) with respect to successful and failed observables. The denotational approach turns out very useful for the definition of new operators on the language as the counterpart of some abstract operations on the deno ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
on the denotational domain. In particular, by defining our domain as a cylindric Heyting algebra, we can exploit, to this aim, operations of both cylindric algebras (such as cylindrification), and Heyting algebras (such as implication and negation). The former allows us to generalize the clp language by introducing
Characterizing relativized cylindric algebras
 In Andreka et al. [AMN91
, 1991
"... We obtain the class NA of noncommutative cylindric algebras from the class CA of cylindric algebras by weakening the axiom C4 of commutativity of cylindrifications (to C ∗ 4, see below, and we obtain NCA from CA by omitting C4 completely). Some motivation for studying noncommutative cylindric algebr ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We obtain the class NA of noncommutative cylindric algebras from the class CA of cylindric algebras by weakening the axiom C4 of commutativity of cylindrifications (to C ∗ 4, see below, and we obtain NCA from CA by omitting C4 completely). Some motivation for studying noncommutative cylindric