Operations on polyadic structures
نویسنده
چکیده
Logical translations for simple attribute-value grammars are numerous (Blackburn, 1994). Only a few exist for more complex attribute-value grammars. In particular, lists and set values and manipulation of such data structures seem difficult to capture in logical languages of reasonable expressivity. A new class of logical languages is presented here to meet this need, namely polyadic propositional dynamic logics (PPDLs); the properties of these languages are compared to L ++ (Reape, 1992) and RSRL (Richter, 2004), the two most cited alternatives.
منابع مشابه
Weakly Associative Relation Algebras with Polyadic Composition Operations
We consider n ary relative products jn on subsets of a re exive and symmetric binary relation and de ne a variety of weakly associative relation algebras with polyadic composi tion operations WA A theorem that any A WA is representable over a re exive and symmetric relation is proved We also show that the equational theory of WA is decidable
متن کاملGraph Types for Monadic Mobile Processes
While types for name passing calculi have been studied extensively in the context of sorting of polyadic π-calculus [26, 7, 43, 11, 36, 41, 24, 42, 14, 22], the type abstraction on the corresponding level is not possible in the monadic setting, which was left as an open issue by Milner [26]. We solve this problem with an extension of sorting which captures dynamic aspects of process behaviour i...
متن کاملBare canonicity of representable cylindric and polyadic algebras
We show that for finite n ≥ 3, every first-order axiomatisation of the varieties of representable n-dimensional cylindric algebras, diagonal-free cylindric algebras, polyadic algebras, and polyadic equality algebras contains an infinite number of non-canonical formulas. We also show that the class of structures for each of these varieties is non-elementary. The proofs employ algebras derived fr...
متن کاملA construction of cylindric and polyadic algebras from atomic relation algebras
Given a simple atomic relation algebra A and a finite n ≥ 3, we construct effectively an atomic n-dimensional polyadic equality-type algebra P such that for any subsignature L of the signature of P that contains the boolean operations and cylindrifications, the L-reduct of P is completely representable if and only if A is completely representable. If A is finite then so is P. It follows that th...
متن کاملIntroductory Course on Relation Algebras, Finite-dimensional Cylindric Algebras, and Their Interconnections
These are notes for a short course on relation algebras, nite-dimensional cylindric algebras, and their interconnections, delivered at the Conference on Alge-Relation algebras (RA's) are closely linked to cylindric algebras (CA's) and polyadic equality algebras (PEA's), and yet in certain ways they are quite diierent. The links and diierences allow for constructive interaction between these sub...
متن کامل