9 research outputs found
Tarski's Q-relation algebras and Thompson's groups
The connections between Tarski's Q-relation algebras and Thompson's groups F,
T, V, and monoid M are reviewed here, along with Jonsson-Tarski algebras, fork
algebras, true pairing algebras, and tabular relation algebras. All of these
are related to the finitization problem and Tarski's formalization of set
theory without variables. Most of the technical details occur in the variety of
J-algebras, which is obtained from relation algebras by omitting union and
complementation and adopting a set of axioms created by Jonsson. Every relation
algebra or J-algebra that contains a pair of conjugated quasiprojections
satisfying the Domain and Unicity conditions, such as those that arise from
J\'onsson-Tarski algebras or fork algebras, will also contain homomorphic
images of F, T, V, and M. The representability of tabular relation algebras is
extended here to J-algebras, using a notion of tabularity equivalent among
relation algebras to the original definition.Comment: 64 pages, 4 figures, 1 tabl
Complexity of equational theory of relational algebras with standard projection elements
The class of t rue p airing a lgebras is defined to be the class of relation algebras expanded with concrete set theoretical projection functions. The main results of the present paper is that neither the equational theory of nor the first order theory of are decidable. Moreover, we show that the set of all equations valid in is exactly on the level. We consider the class of the relation algebra reducts of ’s, as well. We prove that the equational theory of is much simpler, namely, it is recursively enumerable. We also give motivation for our results and some connections to related work
A proof of the interpretability of P/PML in a relational setting
In [1] we presented the logic P=PML, a formalism suitable for the speci cation and construction of Real-Time systems. The main algebraic result, namely, the interpretability of P/PML into an equa- tional calculus based on w-closure fork algebras (which allows to reason about Real-Time systems in an equational calculus) was stated but not proved because of the lack of space.
In this paper we present a detailed proof of the interpretability theorem, as well as the proof of the representation theorem for w-closure fork alge- bras which provides a very natural semantics based on binary relations for the equational calculus.Eje: TeoríaRed de Universidades con Carreras en Informática (RedUNCI
From Specifications to Programs: A Fork-Algebraic Approach to Bridge the Gap
The development of programs from first-order specifications has as its main difficulty that of dealing with universal quantifiers. This work is focused in that point, i.e., in the construction of programs whose specifications involve universal quantifiers. This task is performed within a relational calculus based on fork algebras. The fact that first-order theories can be translated into equational theories in abstract fork algebras suggests that such work can be accomplished in a satisfactory way. Furthermore, the fact that these abstract algebras are representable guarantees that all properties valid in the standard models are captured by the axiomatization given for them, allowing the reasoning formalism to be shifted back and forth between any model and the abstract algebra. In order to cope with universal quantifiers, a new algebraic operation — relational implication — is introduced. This operation is shown to have deep significance in the relational statement of first-order expressions involving universal quantifiers. Several algebraic properties of the relational implication are stated showing its usefulness in program calculation. Finally, a non-trivial example of derivation is given to asses the merits of the relational implication as an specification tool, and also in calculation steps, where its algebraic properties are clearly appropriate as transformation rules.Laboratorio de Investigación y Formación en Informática Avanzad
A Logic for Real-Time Systems Specification, Its Algebraic Semantics, and Equational Calculus
We present a logic for real time systems specification which is an extension of first order dynamic logic by adding (a) arbitrary atomic actions rather than only assignments, (b) variables over actions which allow to specify systems partially, and (c) explicit time. The logic is algebraized using closure fork algebras and a representation theorem for this class is presented. This allows to define an equational (but infinitary) proof system for the algebraization.Laboratorio de Investigación y Formación en Informática Avanzad
A proof of the interpretability of P/PML in a relational setting
In [1] we presented the logic P=PML, a formalism suitable for the speci cation and construction of Real-Time systems. The main algebraic result, namely, the interpretability of P/PML into an equa- tional calculus based on w-closure fork algebras (which allows to reason about Real-Time systems in an equational calculus) was stated but not proved because of the lack of space.
In this paper we present a detailed proof of the interpretability theorem, as well as the proof of the representation theorem for w-closure fork alge- bras which provides a very natural semantics based on binary relations for the equational calculus.Eje: TeoríaRed de Universidades con Carreras en Informática (RedUNCI
Hyperidentities and Related Concepts, II
This survey article illustrates many important current trends and
perspectives for the field including classification of
hyperidentities, characterizations of algebras with
hyperidentities, functional representations of free algebras,
structure results for bilattices, categorical questions and
applications. However, the paper contains new results and open
problems, too