Results 1  10
of
17
The Origin of Relation Algebras in the Development and Axiomatization of the Calculus of Relations
, 1991
"... ..."
Step by Step  Building Representations in Algebraic Logic
 Journal of Symbolic Logic
, 1995
"... We consider the problem of finding and classifying representations in algebraic logic. This is approached by letting two players build a representation using a game. Homogeneous and universal representations are characterised according to the outcome of certain games. The Lyndon conditions defini ..."
Abstract

Cited by 28 (15 self)
 Add to MetaCart
We consider the problem of finding and classifying representations in algebraic logic. This is approached by letting two players build a representation using a game. Homogeneous and universal representations are characterised according to the outcome of certain games. The Lyndon conditions defining representable relation algebras (for the finite case) and a similar schema for cylindric algebras are derived. Countable relation algebras with homogeneous representations are characterised by first order formulas. Equivalence games are defined, and are used to establish whether an algebra is !categorical. We have a simple proof that the perfect extension of a representable relation algebra is completely representable. An important open problem from algebraic logic is addressed by devising another twoplayer game, and using it to derive equational axiomatisations for the classes of all representable relation algebras and representable cylindric algebras. Other instances of this ap...
Introductory Course on Relation Algebras, FiniteDimensional Cylindric Algebras, and Their Interconnections
 Algebraic Logic
, 1990
"... These are notes for a short course on relation algebras, finitedimensional cylindric algebras, and their interconnections, delivered at the Conference on Algebraic Logic, Budapest, Hungary, August 814, 1988, sponsored by the the Janos Bolyai Mathematical Society. ..."
Abstract

Cited by 24 (3 self)
 Add to MetaCart
These are notes for a short course on relation algebras, finitedimensional cylindric algebras, and their interconnections, delivered at the Conference on Algebraic Logic, Budapest, Hungary, August 814, 1988, sponsored by the the Janos Bolyai Mathematical Society.
Complete Representations in Algebraic Logic
 JOURNAL OF SYMBOLIC LOGIC
"... A boolean algebra is shown to be completely representable if and only if it is atomic, whereas it is shown that neither the class of completely representable relation algebras nor the class of completely representable cylindric algebras of any fixed dimension (at least 3) are elementary. ..."
Abstract

Cited by 19 (8 self)
 Add to MetaCart
A boolean algebra is shown to be completely representable if and only if it is atomic, whereas it is shown that neither the class of completely representable relation algebras nor the class of completely representable cylindric algebras of any fixed dimension (at least 3) are elementary.
Characterizing Determinacy in Kleene Algebras
 INFORMATION SCIENCES
, 2000
"... Elements of Kleene algebras can be used, among others, as abstractions of the inputoutput semantics of nondeterministic programs or as models for the association of pointers with their target objects. In the first case, one seeks to distinguish the subclass of elements that correspond to determinist ..."
Abstract

Cited by 11 (5 self)
 Add to MetaCart
Elements of Kleene algebras can be used, among others, as abstractions of the inputoutput semantics of nondeterministic programs or as models for the association of pointers with their target objects. In the first case, one seeks to distinguish the subclass of elements that correspond to deterministic programs. In the second case one is only interested in functional correspondences, since it does not make sense for a pointer to point to two di#erent objects. We discuss several candidate notions of determinacy and clarify their relationship. Some characterizations that are equivalent in the case where the underlying Kleene algebra is an (abstract) relation algebra are not equivalent for general Kleene algebras.
Axiomatising Various Classes of Relation and Cylindric Algebras
 Logic Journal of the IGPL
, 1997
"... We outline a simple approach to axiomatising the class of representable relation algebras, using games. We discuss generalisations of the method to cylindric algebras, homogeneous and complete representations, and atom structures of relation algebras. 1 Introduction Relation algebras are to bina ..."
Abstract

Cited by 8 (5 self)
 Add to MetaCart
We outline a simple approach to axiomatising the class of representable relation algebras, using games. We discuss generalisations of the method to cylindric algebras, homogeneous and complete representations, and atom structures of relation algebras. 1 Introduction Relation algebras are to binary relations what boolean algebras are to unary ones. They are used in artificial intelligence, where, for example, the AllenKoomen temporal planning system checks the consistency of given relations between time intervals. In mathematics, they form a part of algebraic logic. The history of this goes back to the nineteenth century, the early workers including Boole, de Morgan, Peirce, and Schroder; it was studied intensively by Tarski's group (including, at various times, Chin, Givant, Henkin, J'onsson, Lyndon, Maddux, Monk, N'emeti) from around the 1950s, and currently we know of active groups in Amsterdam, Budapest, Rio de Janeiro, South Africa, and the U.S., among other places. Abstract...
A Relational Approach To Optimization Problems
, 1996
"... The main contribution of this thesis is a study of the dynamic programming and greedy strategies for solving combinatorial optimization problems. The study is carried out in the context of a calculus of relations, and generalises previous work by using a loop operator in the imperative programming s ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
The main contribution of this thesis is a study of the dynamic programming and greedy strategies for solving combinatorial optimization problems. The study is carried out in the context of a calculus of relations, and generalises previous work by using a loop operator in the imperative programming style for generating feasible solutions, rather than the fold and unfold operators of the functional programming style. The relationship between fold operators and loop operators is explored, and it is shown how to convert from the former to the latter. This fresh approach provides additional insights into the relationship between dynamic programming and greedy algorithms, and helps to unify previously distinct approaches to solving combinatorial optimization problems. Some of the solutions discovered are new and solve problems which had previously proved difficult. The material is illustrated with a selection of problems and solutions that is a mixture of old and new. Another contribution is the invention of a new calculus, called the graph calculus, which is a useful tool for reasoning in the relational calculus and other nonrelational calculi. The graph
Expressibility of properties of relations
 J. Symbolic Logic
, 1995
"... ABSTRACT. We investigate in an algebraic setting the question in which logical languages the properties integral, permutational, and rigid of algebras of relations can be expressed. 1. ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
ABSTRACT. We investigate in an algebraic setting the question in which logical languages the properties integral, permutational, and rigid of algebras of relations can be expressed. 1.
Provability with Finitely Many Variables
"... For every finite n 4 there is a logically valid sentence 'n with the following properties: 'n contains only 3 variables (each of which occurs many times); 'n contains exactly one nonlogical binary relation symbol (no function symbols, no constants, and no equality symbol); 'n has a proof in firs ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
For every finite n 4 there is a logically valid sentence 'n with the following properties: 'n contains only 3 variables (each of which occurs many times); 'n contains exactly one nonlogical binary relation symbol (no function symbols, no constants, and no equality symbol); 'n has a proof in firstorder logic with equality that contains exactly n variables, but no proof containing only n \Gamma 1 variables. This result was first proved using the machinery of algebraic logic developed in several research monographs and papers. Here we replicate the result and its proof entirely within the realm of (elementary) firstorder binary predicate logic with equality. We need the usual syntax, axioms, and rules of inference to show that 'n has a proof with only n variables. To show that 'n has no proof with only n \Gamma 1 variables we use alternative semantics in place of the usual, standard, settheoretical semantics of firstorder logic.
Finite integral relation algebras
 Universal Algebra and Lattice Theory, Lecture Notes in Mathematics 1149
, 1985
"... Please note that this paper does not exist. It consists entirely of excerpts from the ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Please note that this paper does not exist. It consists entirely of excerpts from the