Basics of Relation Algebra. Jules Desharnais Département d informatique et de génie logiciel Université Laval, Québec, Canada
|
|
- Chastity Waters
- 5 years ago
- Views:
Transcription
1 Basics of Relation Algebra Jules Desharnais Département d informatique et de génie logiciel Université Laval, Québec, Canada
2 Plan 1. Relations on a set 2. Relation algebra 3. Heterogeneous relation algebra 4. References
3 Notation from here
4 1 Relations on a set 1. A relation on a set S is a subset of S S 2. The set of relations on S is P(S S) 3. Notation: srt (s, t) R, V = S S 4. Operations on relations Set-theoretical operations:,, Relational operations,, V Composition (relative product): sq ;Ru ( t : sqt tru) Converse: sr t trs Identity relation: sit s = t
5 Representations of relations: sets of ordered pairs, graphs, matrices Let S def = {1, 2, 3}. Q ; R = Q ;R {(1, 2), (2, 2), (2, 3)} ; {(1, 2), (2, 1), (2, 3)} = {(1, 1), (1, 3), (2, 1), (2, 3)} ; = ( ) ; ( ) = ( )
6 Relations on a set satisfy many laws Increasing priority: (, ), ;, Q R = R Q P (Q R) = (P Q) R (Q R) = Q R I ;R = R P ;(Q R) = P ;Q P ;R P ;(Q R) (P ;Q) ;R (Q ;R) = R ;Q R V ;R;V = V P ;Q R P ;R Q R ;Q P P ;Q R (P R ;Q ) ;(Q P ;R)...
7 2 Relation algebra Relation algebra (RA): Aims at characterizing relations on a set by means of simple equational axioms. It is a structure A = A,,, ;,, I such that (1) Q R = R Q (2) P (Q R) = (P Q) R (3) Q R Q R = Q Boolean algebra axioms
8 2 Relation algebra Relation algebra (RA): Aims at characterizing relations on a set by means of simple equational axioms. It is a structure A = A,,, ;,, I such that (1) Q R = R Q (2) P (Q R) = (P Q) R (3) Q R Q R = Q Another axiomatisation of Boolean algebra: Add,, to the signature, replace Huntington s axiom (3) by Q R = R Q P (Q R) = (P Q) R Q (Q R) = Q Q (Q R) = Q P (Q R) = (P Q) (P R) R = R R = R R R = R R =
9 2 Relation algebra Relation algebra (RA): Aims at characterizing relations on a set by means of simple equational axioms. It is a structure A = A,,, ;,, I such that (1) Q R = R Q (2) P (Q R) = (P Q) R (3) Q R Q R = Q (4) P ;(Q ;R) = (P ;Q) ;R (5) (P Q) ;R = P ;R Q ;R (6) R ;I = R (7) R = R (8) (Q R) = Q R (9) (Q ;R) = R ;Q (10) Q ;Q;R R = R Boolean algebra axioms
10 2 Relation algebra Relation algebra (RA): Aims at characterizing relations on a set by means of simple equational axioms. It is a structure A = A,,, ;,, I such that (1) Q R = R Q (2) P (Q R) = (P Q) R (3) Q R Q R = Q (4) P ;(Q ;R) = (P ;Q) ;R (5) (P Q) ;R = P ;R Q ;R (6) R ;I = R (7) R = R (8) (Q R) = Q R (9) (Q ;R) = R ;Q (10) Q ;Q;R R = R Boolean algebra axioms Ordering Define Q R Q R = R. Then (10) can be written Q ;Q;R R.
11 2 Relation algebra Relation algebra (RA): Aims at characterizing relations on a set by means of simple equational axioms. It is a structure A = A,,, ;,, I such that (1) Q R = R Q (2) P (Q R) = (P Q) R (3) Q R Q R = Q (4) P ;(Q ;R) = (P ;Q) ;R (5) (P Q) ;R = P ;R Q ;R (6) R ;I = R (7) R = R (8) (Q R) = Q R (9) (Q ;R) = R ;Q (10) Q ;Q;R R = R Boolean algebra axioms Derived operators,, Q R = Q R = I I = I I
12 Laws that can be proved from the axioms Relation algebra Corresponding laws, relations on sets P (Q R) = (P Q) R P (Q R) = (P Q) R (Q R) = Q R (Q R) = Q R I ;R = R I ;R = R I = I I = I = V = V ; = V ;V = V P ;(Q R) = P ;Q P ;R P ;(Q R) = P ;Q P ;R P ;Q R P ;R Q P ;Q R P ;R Q R ;Q P R ;Q P P ;Q R (P R ;Q ) ;(Q P ;R) P ;Q R (P R ;Q ) ;(Q P ;R)??? R V ;R;V = V
13 Properties of the equational axiomatisation Because RAs are defined by equations, the class of RAs is a variety: it is closed under products, homomorphic images and subalgebras. def def Example. Consider the relations on S 2 = {1, 2} and S 3 = {1, 2, 3} or, equivalently, the subsets of ( ) ( ) def 1 1 def V 2 = 1 1 and V 3 = Products The set of pairs of relations A 2,3 = {(R 2, R 3 ) R 2 V 2 R 3 V 3 } is an RA with identity (I 2, I 3 ). Operations are defined pointwise. E.g., (Q 2, Q 3 ) ;(R 2, R 3 ) = (Q 2 ;R 2, Q 3 ;R 3 ) and (R 2, R 3 ) = (R 2, R 3 ). The top relation is (V 2, V 3 ) or, on an isomorphic matrix form, V 2,3 =
14 2. Homomorphic images Let f : A 2,3 P(S 2 S 2 ) be defined by f((r 2, R 3 )) = R 2. Then f is a homomorphism. An RA homomorphism is defined by the following properties. f : A B f(q A R) = f(q) B f(r) f(r A ) = f(r) B f(q ; A R) = f(q) ; B f(r) f(r A ) = (f(r)) B f(i A ) = I B f : A 2,3 P(S 2 S 2 ) f((q 2, Q 3 ) (R 2, R 3 )) = Q 2 R 2 f((r 2, R 3 )) = R 2 f((q 2, Q 3 ) ;(R 2, R 3 )) = Q 2 ;R 2 f((r 2, R 3 ) ) = (R 2 ) f((i 2, I 3 )) = I 2 The image of an RA homomorphism is an RA.
15 3. Subalgebras An RA is a subalgebra of an RA B = B,,, ;,, I A = A,,, ;,, I if A B (note: the operations are the same). For instance, {, I, I, },,, ;,, I is a subalgebra of every RA with at least 4 elements. Given B A, a subalgebra can be generated by closing B under the operations of A.
16 Models of the axioms 1. Relations on a set S where the universal relation V is an equivalence relation. For instance, all relations included in V 2,3 = form a relation algebra. Now let R 2,3 = and consider the composition V 2,3 ; R 2,3 ; V 2,3.
17 V 2,3 ; R 2,3 ; V 2,3 = = ; ; V 2,3 Thus, RAs do not in general satisfy the Tarski rule R ;R; =. Those that do are simple RAs (with only two homomorphic images: themselves and the trivial RA with one element; they are not closed under products). For concrete relations on a set S, they are those with V = S S.
18 Models of the axioms 2. Let A = A,,, ;,, I be an RA. Let M n be the set of n n matrices with elements of A as entries. Define the following (red) operations on M n. Operation I Definition (M N)[i, j] def = M[i, j] N[i, j] M[i, j] def = M[i, j] ; (M ;N)[i, j] def = ( k : M[i, k] ;N[k, j]) M [i, j] def = (M[j, i]) { I[i, j] def = I if i = j if i j Then is an RA. M n,,, ;,, I
19 This model can be used for the description of programs. R 1 t 2 t Q 3 4 t t Q R The matrix (graph) represents the control structure. The entries of the matrix (labels of the graph) are relations describing how the state changes by a transition.
20 Expressing properties of relations Property Definition Set-theoretical expression R total R ; = ( x : ( y : xry)) I R ;R R R ;I R functional R ;R I ( x, y, z : xry xrz y = z) (or univalent) R ;I R R reflexive I R ( x : xrx) R antisymmetric R R = I ( x, y : xry yrx x = y) R transitive R ;R R ( x, y, z : xry yrz xrz).. Using the relational instead of the set-theoretical definitions leads to equational proofs that are more compact and easier to verify..
21 Other properties Property Definition Expression R surjective R total R ; = (or ;R = ) I R ;R R R ;I (or R I ;R) R injective R functional R ;R I R ;I R (or I ;R R) R mapping R total R ;I = R (or total function) and functional R bijective R injective I ;R = R and surjective R bijective mapping R ;R = I and R ;R = I R partial order R reflexive, antisymmetric and transitive
22 Representing subsets There are three equivalent ways to represent subsets by relations. 1. Vectors: relations of the form R ;. 2. Covectors: relations of the form ;R. 3. Subidentities (tests, types): relations t such that t I. Example: representation of the subset {1, 2} of {1, 2, 3} 1. Vector {(1, 1), (1, 2), (1, 3), (2, 1), (2, 1), (2, 3)} Covector {(1, 1), (2, 1), (3, 1), (1, 2), (2, 2), (3, 2)} Subidentity {(1, 1), (2, 2)}
23 Vectors, covectors, tests form a Boolean algebra Let A = A,,,, ;,,,, I be an RA (,, added to the signature for simplicity). 1. Vectors: {R ; R A},,,,, is a BA. 2. Covectors: { ;R R A},,,,, is a BA. 3. Tests: For t I, define t def = t I. {t t I},,,,, I is a BA. For this BA, s t = s ;t. Tests occur in structures without and, like Kleene algebra with tests.
24 Correspondence between vectors, covectors and tests 1. Vector to covector: R ; ;R 2. Covector to vector: ;R R ; 3. Test to vector: t t ; 4. Vector to test: R ; I R ; Prerestriction and postrestriction prerestriction postrestriction vector R ; Q covector ;R Q test t ;Q Q ;t
25 Representability 1. An RA is representable if it is isomorphic to a subalgebra of a concrete relation algebra (one that consists of the subsets of an equivalence relation). 2. There exist nonrepresentable RAs (even finite ones). 3. The class of representable RAs can only be axiomatised with an infinite number of axioms.
26 3 Heterogeneous relation algebra Relations between different sets Let S = {1, 2, 3}, T = {a, b} and U = {,, }. Q ; R = Q ;R {(1, b), (2, b)} ; {(a, ), (b, ), (b, )} = {(1, ), (1, ), (2, ), (2, )} 1 a 2 3 b ; a b = ( ) ; ( Composition of matrices is possible if sizes match. ) = ( )
27 Axiomatising heterogeneous relation algebra Same axioms, but add typing and typing rules (the definition can also be based on category theory). 1. R S,T : S T (relation R S,T has type S T). 2. Q S,T R S,T : S T. 3. R S,T : S T. 4. Q S,T ;R T,U : S U. 5. R S,T : T S. 6. Q S,T R U,V is defined only if S = U and T = V. 7. Q S,T ;R U,V is defined only if T = U. 8. There are constants I S,S, S,T, S,T for each S and T. Types are usually omitted from expressions. Thus, different instances of I may have different types (same remark for and ).
28 Laws that can be derived Most laws derivable in the homogeneous setting are also derivable in the heterogeneous setting, but there are exceptions. Example Homogeneous RA law: ; =. Proof = I ; ; Heterogeneous RA: S,T ; T,U = S,U cannot be derived. The above proof cannot be used: S,U = I S,S ; S,U S,T ; T,U S,U. And there is a counterexample. The only relation between sets S and is S, = S, Thus S, ;,S = S, ;,S = S,S S,S unless S =.
29 Direct products (internal) A pair of (projection) relations (π 1, π 2 ) is called a direct product iff (a) π 1 ; π 1 = I π 1 functional and surjective (b) π 2 ; π 2 = I π 2 functional and surjective (c) π 1 ; π 2 = any two elements can be paired (d) π 1 ;π 1 π 2 ;π 2 = I π 1, π 2 total and construct all pairs in a unique way Set model π 1 π 2 def = {((s 1, s 2 ), s 1 ) s 1 S 1 s 2 S 2 } def = {((s 1, s 2 ), s 2 ) s 1 S 1 s 2 S 2 } 1. π 1 ; π 1 = {(s, s) s S 1 } = I S1,S 1 2. π 2 ; π 2 = {(s, s) s S 2 } = I S2,S 2 3. π 1 ; π 2 = S 1 S 2 = V S1,S 2 4. π 1 ;π 1 π 2 ;π 2 = {((s 1, s 2 ), (s 1, s 2)) s 1 S 1 s 2, s 2 S 2 } {((s 1, s 2 ), (s 1, s 2 )) s 1, s 1 S 1 s 2 S 2 } = {((s 1, s 2 ), (s 1, s 2)) s 1, s 2 S 1 s 2 S 2 } = I S1 S 2,S 1 S 2
30 Remark: Direct products for empty types Consider the set model on the previous page. If S 1 = and S 2, then both π 1 and π 2 are empty and π 2 cannot be surjective. If empty types have to be dealt with, only functionality of π 1 and π 2 should be required 1, i.e., π 1 ; π 1 I and π 2 ; π 2 I. 1 Thanks to Michael Winter for pointing that out to me.
31 Tupling and parallel product Set model R 1, R 2 ] def = R 1 ;π 1 R 2 ;π 2 [R 1, R 2 ] def = π 1 ;R 1 ;π 1 π 2 ;R 2 ;π 2 R 1, R 2 ] = {(s, (s 1, s 2 )) sr 1 s 1 sr 2 s 2 } [R 1, R 2 ] = {((s 1, s 2 ), (s 1, s 2)) s 1 R 1 s 1 s 2 R 2 s 2} Compare with the cartesian product: R 1 R 2 = {((s 1, s 1), (s 2, s 2)) s 1 R 1 s 1 s 2 R 2 s 2} Same cardinality, but different structure. More general product π 1 ;R 1 ;ρ 1 π 2 ;R 2 ;ρ 2 where (π 1, π 2 ) and (ρ 1, ρ 2 ) are direct products.
32 Matrix model (an example of parallel product) The axioms: π 1 ; π 1 = I π 2 ; π 2 = I π 1 ; π 2 = π 1 ;π 1 π 2 ;π 2 = I π 1 = π 2 = R 1 = ( ) a b c d R 2 = a,..., m {0, 1} e f g h i j k l m [R 1, R 2 ] = a e a f a g b e b f b g a h a i a j b h b i b j a k a l a m b k b l b m c e c f c g d e d f d g c h c i c j d h d i d j c k c l c m d k d l d m
33 Matrix model (an example of tupling) The axioms: π 1 ; π 1 = I π 2 ; π 2 = I π 1 ; π 2 = π 1 ;π 1 π 2 ;π 2 = I π 1 = π 2 = R 1 = ( ) a b c d R 2 = a,..., j {0, 1} ( e f g h i j ) R 1, R 2 ] = ( a e a f a g b e b f ) b g c h c i c j d h d i d j
34 Unsharpness Let (π 1, π 2 ) be the direct product used in the tuplings and parallel products below. Let [R 1, R 2 def = π 1 ;R 1 π 2 ;R 2. The problem: [Cardoso 1982] Does hold for all relations Q 1, Q 2, R 1, R 2? Q 1, Q 2 ] ;[R 1, R 2 = Q 1 ;R 1 Q 2 ;R 2 1. It holds for concrete algebras of relations and all representable RAs. 2. It holds in RA for many special cases [Zierer 88]. 3. It does not hold in RA [Maddux 1993]. 4. It holds in RA for the special cases Q 1, Q 2 ] ;[R 1, R 2 ] = Q 1 ;R 1, Q 2 ;R 2 ] [Q 1, Q 2 ] ;[R 1, R 2 ] = [Q 1 ;R 1, Q 2 ;R 2 ] [Desharnais 1999]. The last equality was in fact the original problem of Cardoso and it was generalized to the one stated above.
35 Unsharpness Let (π 1, π 2 ) be the direct product used in the tuplings and parallel products below. Let [R 1, R 2 def = π 1 ;R 1 π 2 ;R 2. The problem: [Cardoso 1982] Does hold for all relations Q 1, Q 2, R 1, R 2? Q 1, Q 2 ] ;[R 1, R 2 = Q 1 ;R 1 Q 2 ;R 2 1. It holds for concrete algebras of relations and all representable RAs. 2. It holds in RA for many special cases [Zierer 88]. 3. It does not hold in RA [Maddux 1993]. 4. It holds in RA for the special cases Q 1, Q 2 ] ;[R 1, R 2 ] = Q 1 ;R 1, Q 2 ;R 2 ] [Q 1, Q 2 ] ;[R 1, R 2 ] = [Q 1 ;R 1, Q 2 ;R 2 ] [Desharnais 1999]. The last equality was in fact the original problem of Cardoso and it was generalized to the one stated above.
36 Direct sums (internal) A pair of (injection) relations (σ 1, σ 2 ) is called a direct sum iff (a) σ 1 ;σ 1 = I σ 1 total and injective (b) σ 2 ;σ 2 = I σ 2 total and injective (c) σ 1 ;σ 2 = σ 1 and σ 2 inject elements in disjoint subsets (d) σ 1 ; σ 1 σ 2 ; σ 2 = I σ 1, σ 2 functional and construct all injected elements Set model σ 1 σ 2 def = {(s, (s, 1)) s S 1 } def = {(s, (s, 2)) s S 2 } 1. σ 1 ;σ 1 = I S1,S 1 2. σ 2 ;σ 2 = I S2,S 2 3. σ 1 ;σ 2 = S1,S 2 4. σ 1 ; σ 1 σ 2 ; σ 2 = {((s, 1), (s, 1)) s S 1 } {((s, 2), (s, 2)) s S 2 } = I S1 S 2,S 1 S 2
37 Matrix model (an example of direct sum) The axioms: σ 1 ;σ 1 = I σ 2 ;σ 2 = I σ 1 ;σ 2 = σ 1 ; σ 1 σ 2 ; σ 2 = I R 1 = σ 1 = ( ) ( ) a b c d R 2 = σ 2 = e f g h i j k l m a,..., m {0, 1} σ 1 ; R 1 ;σ 1 σ 2 ; R 2 ;σ 2 = a b c d e f g 0 0 h i j 0 0 k l m
38 Expressivity 1. Maddux, page 33 in [Brink Kahl Schmidt 1997]: An equation is true in every relation algebra iff its translation into a 3-variable sentence can be proved using at most 4 variables. 2. Maddux, page 36 in [Brink Kahl Schmidt 1997]: Already in 1915 Löwenheim presented a proof (taken from a letter by Korselt) that the sentence saying there are at least four elements, namely v 0 v 1 v 2 v 3 ( v 0 Iv 1 v 0 Iv 2 v 1 Iv 2 v 0 Iv 3 v 1 Iv 3 v 2 Iv 3 ) is not equivalent to any relation-algebraic equation. 3. How to increase expressivity? Add projections. Use fork algebra: RA with an additional operator for pairing. See Haeberer et al., Chapter 4 in [Brink Kahl Schmidt 1997].
39 Additional operators 1. Transitive closure : add the axioms [Ng 1984] R R ;R = R ;R (i.e., R R ;R ) (R ;R;R ) = R ;R;R R (R Q) = (R Q) (i.e., monotonicity R (R Q) ) 2. Left residual: largest solution X of X ;Q R Definition by a Galois connection: X ;Q R X R/Q Explicit definition: R/Q = R ;Q 3. Right residual: largest solution X of Q ;X R Definition by a Galois connection: Q ;X R X Q\R Explicit definition: Q\R = Q ;R
40 Complete relation algebras 1. A complete RA is an RA A,,, ;,, I for which (hence T exists too). T exists for all T A 2. In a complete RA, monotonic functions have a least and greatest fixed point. For instance, R can be defined by 3. Useful, e.g., for program semantics. R = (µx : I R ;X). 4. Calculational rules for the manipulation of fixed points can be found in [Backhouse 2000].
41 References [Backhouse 2000] Roland Backhouse. Fixed point calculus. Presented at the Summer School and Workshop on Algebraic and Coalgebraic Methods in the Mathematics of Program Construction, Oxford, April 11 14, Available at [Brink Kahl Schmidt 1997] C. Brink, W. Kahl and G. Schmidt (eds.). Relational Methods in Computer Science, Springer, [Cardoso 1982] R. Cardoso. Untersuchung paralleler Programme mit relationenalgebraischen Methoden. Diplomarbeit, Institut für Informatik, Technische Universität München, [Desharnais 1999] J. Desharnais. Monomorphic characterization of n-ary direct products. Information Sciences An International Journal, 119 (3 4): , October [Hirsch Hodkinson 2002] R. Hirsch and I. Hodkinson. Relation Algebras by Games. Volume 147 of Studies in Logic and the Foundations of Mathematics, North Holland, 2002.
42 [Maddux 1993] R. D. Maddux. On the derivation of identities involving projection functions. Department of Mathematics, Iowa State University, July [Maddux 2006] R. D. Maddux. Relation Algebras, Studies in Logic and the Foundations of Mathematics. Elsevier, [Ng 1984] K. C. Ng. Relation algebras with transitive closure. Ph.D. thesis, University of California, Berkeley, [Schmidt Strohlein 1993] G. Schmidt and T. Ströhlein. Relations and Graphs, EATCS Monographs in Computer Science (Springer-Verlag, Berlin, 1993). [Tarski 1941] A. Tarski. On the calculus of relations. Journal of Symbolic Logic, 6(3):73 89, [Zierer 88] H. Zierer. Programmierung mit Funktionsobjekten: Konstruktive Erzeugung semantischer Bereiche und Anwendung auf die partielle Auswertung. Report TUM-I8803, Institut für Informatik, Technische Universität München, February 1988.
Universität Augsburg
Universität Augsburg Least Reflexive Points of Relations Jules Desharnais and Bernhard Möller Report 2002-13 Juni 2002 Institut für Informatik D-86135 Augsburg Copyright c Jules Desharnais and Bernhard
More informationMATH 433 Applied Algebra Lecture 14: Functions. Relations.
MATH 433 Applied Algebra Lecture 14: Functions. Relations. Cartesian product Definition. The Cartesian product X Y of two sets X and Y is the set of all ordered pairs (x,y) such that x X and y Y. The Cartesian
More informationUniversität Augsburg
Universität Augsburg Properties of Overwriting for Updates in Typed Kleene Algebras Thorsten Ehm Report 2000-7 Dezember 2000 Institut für Informatik D-86135 Augsburg Copyright c Thorsten Ehm Institut für
More informationDemonic fuzzy operators
Demonic fuzzy operators Huda Alrashidi King Saud University Mathematics department P.O.Box 225899, Riyadh 11324 Saudi Arabia halrashidi@ksu.edu.sa Fairouz Tchier King Saud University Mathematics department
More informationInstitut für Informatik D Augsburg
Universität Augsburg Characterizing Determinacy in Kleene Algebras Jules Desharnais and Bernhard Möller Report 2001-3 April 2001 Institut für Informatik D-86135 Augsburg Copyright c Jules Desharnais and
More informationEquational Theory of Kleene Algebra
Introduction to Kleene Algebra Lecture 7 CS786 Spring 2004 February 16, 2004 Equational Theory of Kleene Algebra We now turn to the equational theory of Kleene algebra. This and the next lecture will be
More informationEquational Logic. Chapter Syntax Terms and Term Algebras
Chapter 2 Equational Logic 2.1 Syntax 2.1.1 Terms and Term Algebras The natural logic of algebra is equational logic, whose propositions are universally quantified identities between terms built up from
More informationCanonicity and representable relation algebras
Canonicity and representable relation algebras Ian Hodkinson Joint work with: Rob Goldblatt Robin Hirsch Yde Venema What am I going to do? In the 1960s, Monk proved that the variety RRA of representable
More informationPart II. Logic and Set Theory. Year
Part II Year 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2018 60 Paper 4, Section II 16G State and prove the ǫ-recursion Theorem. [You may assume the Principle of ǫ- Induction.]
More informationaxioms Weak n-ary Relational Products in Allegories Axioms 2014, 3, ; doi: /axioms ISSN
Axioms 2014, 3, 342-357; doi:10.3390/axioms3040342 OPEN ACCESS axioms ISSN 2075-1680 www.mdpi.com/journal/axioms Article Weak n-ary Relational Products in Allegories Bartosz Zieliński * and Paweł Maślanka
More informationCopyright c 2007 Jason Underdown Some rights reserved. statement. sentential connectives. negation. conjunction. disjunction
Copyright & License Copyright c 2007 Jason Underdown Some rights reserved. statement sentential connectives negation conjunction disjunction implication or conditional antecedant & consequent hypothesis
More informationRelations and Equivalence Relations
Relations and Equivalence Relations In this section, we shall introduce a formal definition for the notion of a relation on a set. This is something we often take for granted in elementary algebra courses,
More informationUniversal Algebra for Logics
Universal Algebra for Logics Joanna GRYGIEL University of Czestochowa Poland j.grygiel@ajd.czest.pl 2005 These notes form Lecture Notes of a short course which I will give at 1st School on Universal Logic
More informationRELATION ALGEBRAS. Roger D. MADDUX. Department of Mathematics Iowa State University Ames, Iowa USA ELSEVIER
RELATION ALGEBRAS Roger D. MADDUX Department of Mathematics Iowa State University Ames, Iowa 50011 USA ELSEVIER AMSTERDAM. BOSTON HEIDELBERG LONDON NEW YORK. OXFORD PARIS SAN DIEGO. SAN FRANCISCO. SINGAPORE.
More informationPropositional and Predicate Logic - VII
Propositional and Predicate Logic - VII Petr Gregor KTIML MFF UK WS 2015/2016 Petr Gregor (KTIML MFF UK) Propositional and Predicate Logic - VII WS 2015/2016 1 / 11 Theory Validity in a theory A theory
More informationFoundations of algebra
Foundations of algebra Equivalence relations - suggested problems - solutions P1: There are several relations that you are familiar with: Relations on R (or any of its subsets): Equality. Symbol: x = y.
More informationSeminaar Abstrakte Wiskunde Seminar in Abstract Mathematics Lecture notes in progress (27 March 2010)
http://math.sun.ac.za/amsc/sam Seminaar Abstrakte Wiskunde Seminar in Abstract Mathematics 2009-2010 Lecture notes in progress (27 March 2010) Contents 2009 Semester I: Elements 5 1. Cartesian product
More informationEQUIVALENCE RELATIONS (NOTES FOR STUDENTS) 1. RELATIONS
EQUIVALENCE RELATIONS (NOTES FOR STUDENTS) LIOR SILBERMAN Version 1.0 compiled September 9, 2015. 1.1. List of examples. 1. RELATIONS Equality of real numbers: for some x,y R we have x = y. For other pairs
More informationWeek 4-5: Binary Relations
1 Binary Relations Week 4-5: Binary Relations The concept of relation is common in daily life and seems intuitively clear. For instance, let X be the set of all living human females and Y the set of all
More informationChapter 3. Cartesian Products and Relations. 3.1 Cartesian Products
Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing
More informationWeek 4-5: Binary Relations
1 Binary Relations Week 4-5: Binary Relations The concept of relation is common in daily life and seems intuitively clear. For instance, let X be the set of all living human females and Y the set of all
More informationAMS regional meeting Bloomington, IN April 1, 2017
Joint work with: W. Boney, S. Friedman, C. Laskowski, M. Koerwien, S. Shelah, I. Souldatos University of Illinois at Chicago AMS regional meeting Bloomington, IN April 1, 2017 Cantor s Middle Attic Uncountable
More informationApplications of Regular Algebra to Language Theory Problems. Roland Backhouse February 2001
1 Applications of Regular Algebra to Language Theory Problems Roland Backhouse February 2001 Introduction 2 Examples: Path-finding problems. Membership problem for context-free languages. Error repair.
More informationEconomics 204 Summer/Fall 2017 Lecture 1 Monday July 17, 2017
Economics 04 Summer/Fall 07 Lecture Monday July 7, 07 Section.. Methods of Proof We begin by looking at the notion of proof. What is a proof? Proof has a formal definition in mathematical logic, and a
More informationStatus of Problems Listed in the Book
Status of Problems Listed in the Book R Hirsch and I Hodkinson April 27, 2017 All problems listed here are from Hirsch and Hodkinson Relation Algebras by Games, North Holland, 2002, but some have been
More informationBasic Algebraic Logic
ELTE 2013. September Today Past 1 Universal Algebra 1 Algebra 2 Transforming Algebras... Past 1 Homomorphism 2 Subalgebras 3 Direct products 3 Varieties 1 Algebraic Model Theory 1 Term Algebras 2 Meanings
More informationKleene modules and linear languages
The Journal of Logic and Algebraic Programming 66 (2006) 185 194 THE JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING wwwelseviercom/locate/jlap Kleene modules and linear languages Hans Leiß Centrum für Informations-
More informationIntroduction to Kleene Algebras
Introduction to Kleene Algebras Riccardo Pucella Basic Notions Seminar December 1, 2005 Introduction to Kleene Algebras p.1 Idempotent Semirings An idempotent semiring is a structure S = (S, +,, 1, 0)
More informationAlgebraic Trace Theory
Algebraic Trace Theory EE249 Presented by Roberto Passerone Material from: Jerry R. Burch, Trace Theory for Automatic Verification of Real-Time Concurrent Systems, PhD thesis, CMU, August 1992 October
More information2.2 Lowenheim-Skolem-Tarski theorems
Logic SEP: Day 1 July 15, 2013 1 Some references Syllabus: http://www.math.wisc.edu/graduate/guide-qe Previous years qualifying exams: http://www.math.wisc.edu/ miller/old/qual/index.html Miller s Moore
More informationRefactoring Heterogeneous Relation Algebras around Ordered Categories and Converse
Journal on Relational Methods in Computer Science, Vol. 1, 2004, pp. 277-313 Refactoring Heterogeneous Relation Algebras around Ordered Categories and Converse Wolfram Kahl Department of Computing and
More informationFoundations of Mathematics MATH 220 FALL 2017 Lecture Notes
Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes These notes form a brief summary of what has been covered during the lectures. All the definitions must be memorized and understood. Statements
More informationReal Analysis. Joe Patten August 12, 2018
Real Analysis Joe Patten August 12, 2018 1 Relations and Functions 1.1 Relations A (binary) relation, R, from set A to set B is a subset of A B. Since R is a subset of A B, it is a set of ordered pairs.
More informationLinear Algebra. Chapter 5
Chapter 5 Linear Algebra The guiding theme in linear algebra is the interplay between algebraic manipulations and geometric interpretations. This dual representation is what makes linear algebra a fruitful
More informationKLEENE algebra is an algebraic structure that captures
REPRINTED FROM: 1 Some Applications of Kleene Algebra M. Al-Mousa, F. Tchier and F. Toufic Mathematics department, King Saud University malmousa@ksu.edu.sa, ftchier@ksu.edu.sa, ftoufic@ksu.edu.sa Invited
More informationWeek 4-5: Generating Permutations and Combinations
Week 4-5: Generating Permutations and Combinations February 27, 2017 1 Generating Permutations We have learned that there are n! permutations of {1, 2,...,n}. It is important in many instances to generate
More informationLecture Notes: Selected Topics in Discrete Structures. Ulf Nilsson
Lecture Notes: Selected Topics in Discrete Structures Ulf Nilsson Dept of Computer and Information Science Linköping University 581 83 Linköping, Sweden ulfni@ida.liu.se 2004-03-09 Contents Chapter 1.
More informationSets. A set is a collection of objects without repeats. The size or cardinality of a set S is denoted S and is the number of elements in the set.
Sets A set is a collection of objects without repeats. The size or cardinality of a set S is denoted S and is the number of elements in the set. If A and B are sets, then the set of ordered pairs each
More informationLogics above S4 and the Lebesgue measure algebra
Logics above S4 and the Lebesgue measure algebra Tamar Lando Abstract We study the measure semantics for propositional modal logics, in which formulas are interpreted in the Lebesgue measure algebra M,
More informationVAUGHT S THEOREM: THE FINITE SPECTRUM OF COMPLETE THEORIES IN ℵ 0. Contents
VAUGHT S THEOREM: THE FINITE SPECTRUM OF COMPLETE THEORIES IN ℵ 0 BENJAMIN LEDEAUX Abstract. This expository paper introduces model theory with a focus on countable models of complete theories. Vaught
More informationMathematics Review for Business PhD Students Lecture Notes
Mathematics Review for Business PhD Students Lecture Notes Anthony M. Marino Department of Finance and Business Economics Marshall School of Business University of Southern California Los Angeles, CA 90089-0804
More informationTHE EQUATIONAL THEORIES OF REPRESENTABLE RESIDUATED SEMIGROUPS
TH QUATIONAL THORIS OF RPRSNTABL RSIDUATD SMIGROUPS SZABOLCS MIKULÁS Abstract. We show that the equational theory of representable lower semilattice-ordered residuated semigroups is finitely based. We
More informationIntroduction to Model Theory
Introduction to Model Theory Jouko Väänänen 1,2 1 Department of Mathematics and Statistics, University of Helsinki 2 Institute for Logic, Language and Computation, University of Amsterdam Beijing, June
More informationRelations MATH Relations. Benjamin V.C. Collins, James A. Swenson MATH 2730
MATH 2730 Benjamin V.C. Collins James A. Swenson among integers equals a = b is true for some pairs (a, b) Z Z, but not for all pairs. is less than a < b is true for some pairs (a, b) Z Z, but not for
More informationModule 2: Language of Mathematics
Module 2: Language of Mathematics Theme 1: Sets A set is a collection of objects. We describe a set by listing all of its elements (if this set is finite and not too big) or by specifying a property that
More informationKLEENE algebra is an algebraic structure that captures
UBIQUTIOUS COMPUTING AND COMMUNICATION JOURNAL, VOL. X, NO. X, JANUARY 2012 1 Some Applications of Kleene Algebra M. Al-Mousa,F. Tchier and F. Toufic UBICC Publishers, Saudi Arabia malmousa@ksu.edu.sa,
More informationReport 1 The Axiom of Choice
Report 1 The Axiom of Choice By Li Yu This report is a collection of the material I presented in the first round presentation of the course MATH 2002. The report focuses on the principle of recursive definition,
More informationApproximation Algorithms using Allegories and Coq
Approximation Algorithms using Allegories and Coq Durjay Chowdhury Supervisor: Dr. Michael Winter Submitted in partial fulfilment of the requirements for the degree of Master of Science Department of Computer
More informationRELATIONAL SPECIFICATIONS
ALGEBRAIC METHODS IN LOGIC AND IN COMPUTER SCIENCE BANACH CENTER PUBLICATIONS, VOLUME 28 INSTITUTE OF MATHEMATICS POLISH ACADEMY OF SCIENCES WARSZAWA 1993 RELATIONAL SPECIFICATIONS RUDOLF BERGHAMMER and
More informationRelations --- Binary Relations. Debdeep Mukhopadhyay IIT Madras
Relations --- Binary Relations Debdeep Mukhopadhyay IIT Madras What is a relation? The mathematical concept of relation is based on the common notion of relationships among objects: One box is heavier
More informationContact Relations with Applications
Contact Relations with Applications Gunther Schmidt 1 and Rudolf Berghammer 2 1 Fakultät für Informatik, Universität der Bundeswehr München 85577 Neubiberg, Germany gunther.schmidt@unibw.de 2 Institut
More informationRelation algebras. Robin Hirsch and Ian Hodkinson. Thanks to the organisers for inviting us! And Happy New Year!
Relation algebras Robin Hirsch and Ian Hodkinson Thanks to the organisers for inviting us! And Happy New Year! Workshop outline 1. Introduction to relation algebras 2. Games 3. Monk algebras: completions,
More information9 RELATIONS. 9.1 Reflexive, symmetric and transitive relations. MATH Foundations of Pure Mathematics
MATH10111 - Foundations of Pure Mathematics 9 RELATIONS 9.1 Reflexive, symmetric and transitive relations Let A be a set with A. A relation R on A is a subset of A A. For convenience, for x, y A, write
More informationGenerating Permutations and Combinations
Generating Permutations and Combinations March 0, 005 Generating Permutations We have learned that there are n! permutations of {,,, n} It is important in many instances to generate a list of such permutations
More informationTheorems and Definitions in Group Theory
Theorems and Definitions in Group Theory Shunan Zhao Contents 1 Basics of a group 3 1.1 Basic Properties of Groups.......................... 3 1.2 Properties of Inverses............................. 3
More informationAutomaten und Formale Sprachen Automata and Formal Languages
WS 2014/15 Automaten und Formale Sprachen Automata and Formal Languages Ernst W. Mayr Fakultät für Informatik TU München http://www14.in.tum.de/lehre/2014ws/afs/ Wintersemester 2014/15 AFS Chapter 0 Organizational
More informationBoolean Algebra and Propositional Logic
Boolean Algebra and Propositional Logic Takahiro Kato September 10, 2015 ABSTRACT. This article provides yet another characterization of Boolean algebras and, using this characterization, establishes a
More informationThe theory of integration says that the natural map
In this course we will discuss applications of the Model theory to Algebraic geometry and Analysis. There is long list of examples and I mention only some of applications: 1) Tarski proved the elimination
More informationBoolean Algebra and Propositional Logic
Boolean Algebra and Propositional Logic Takahiro Kato June 23, 2015 This article provides yet another characterization of Boolean algebras and, using this characterization, establishes a more direct connection
More informationON THE LOGIC OF CLOSURE ALGEBRA
Bulletin of the Section of Logic Volume 40:3/4 (2011), pp. 147 163 Ahmet Hamal ON THE LOGIC OF CLOSURE ALGEBRA Abstract An open problem in modal logic is to know if the fusion S4 S4 is the complete modal
More informationMATH 101: ALGEBRA I WORKSHEET, DAY #1. We review the prerequisites for the course in set theory and beginning a first pass on group. 1.
MATH 101: ALGEBRA I WORKSHEET, DAY #1 We review the prerequisites for the course in set theory and beginning a first pass on group theory. Fill in the blanks as we go along. 1. Sets A set is a collection
More informationFoundations of Mathematics
Foundations of Mathematics Andrew Monnot 1 Construction of the Language Loop We must yield to a cyclic approach in the foundations of mathematics. In this respect we begin with some assumptions of language
More informationChapter VI. Relations. Assumptions are the termites of relationships. Henry Winkler
Chapter VI Relations Assumptions are the termites of relationships. Henry Winkler Studying relationships between objects can yield important information about the objects themselves. In the real numbers,
More informationRealization of Coinductive Types
MFPS 2011 Realization of Coinductive Types Dexter Kozen 1,2 Department of Computer Science Cornell University Ithaca, New York 14853 7501, USA Abstract We give an explicit combinatorial construction of
More informationA Note on Superamorphous Sets and Dual Dedekind-Infinity
arxiv:math/9504201v1 [math.lo] 18 Apr 1995 A Note on Superamorphous Sets and Dual Dedekind-Infinity 1 Introduction Martin Goldstern April 3, 1995 In the absence of the axiom of choice there are several
More informationImperial College London Department of Computing. Exploring Canonical Axiomatisations of Representable Cylindric Algebras
Imperial College London Department of Computing Final year project Exploring Canonical Axiomatisations of Representable Cylindric Algebras Author: Jannis Bulian Supervisor: Prof. Ian Hodkinson Second Marker:
More informationOverview of Topics. Finite Model Theory. Finite Model Theory. Connections to Database Theory. Qing Wang
Overview of Topics Finite Model Theory Part 1: Introduction 1 What is finite model theory? 2 Connections to some areas in CS Qing Wang qing.wang@anu.edu.au Database theory Complexity theory 3 Basic definitions
More informationModal logics and their semantics
Modal logics and their semantics Joshua Sack Department of Mathematics and Statistics, California State University Long Beach California State University Dominguez Hills Feb 22, 2012 Relational structures
More informationAn Overview of Residuated Kleene Algebras and Lattices Peter Jipsen Chapman University, California. 2. Background: Semirings and Kleene algebras
An Overview of Residuated Kleene Algebras and Lattices Peter Jipsen Chapman University, California 1. Residuated Lattices with iteration 2. Background: Semirings and Kleene algebras 3. A Gentzen system
More informationForking and Dividing in Random Graphs
Forking and Dividing in Random Graphs Gabriel Conant UIC Graduate Student Conference in Logic University of Notre Dame April 28-29, 2012 Gabriel Conant (UIC) Forking and Dividing in Random Graphs April
More informationDiscrete Mathematics: Lectures 6 and 7 Sets, Relations, Functions and Counting Instructor: Arijit Bishnu Date: August 4 and 6, 2009
Discrete Mathematics: Lectures 6 and 7 Sets, Relations, Functions and Counting Instructor: Arijit Bishnu Date: August 4 and 6, 2009 Our main goal is here is to do counting using functions. For that, we
More informationAlgebraic Trace Theory
Algebraic Trace Theory EE249 Roberto Passerone Material from: Jerry R. Burch, Trace Theory for Automatic Verification of Real-Time Concurrent Systems, PhD thesis, CMU, August 1992 October 21, 2002 ee249
More informationStanford Encyclopedia of Philosophy
Stanford Encyclopedia of Philosophy The Mathematics of Boolean Algebra First published Fri Jul 5, 2002; substantive revision Mon Jul 14, 2014 Boolean algebra is the algebra of two-valued logic with only
More informationCharacterizing the Equational Theory
Introduction to Kleene Algebra Lecture 4 CS786 Spring 2004 February 2, 2004 Characterizing the Equational Theory Most of the early work on Kleene algebra was directed toward characterizing the equational
More informationNotes on Sets, Relations and Functions
PURE MTH 3002 Topology & Analysis III (3246) 2002 Notes on Sets, Relations and Functions These are some notes taken from Mathematical Applications (now Mathematics for Information Technology (MIT)). They
More informationAlgebraic Tractability Criteria for Infinite-Domain Constraint Satisfaction Problems
Algebraic Tractability Criteria for Infinite-Domain Constraint Satisfaction Problems Manuel Bodirsky Institut für Informatik Humboldt-Universität zu Berlin May 2007 CSPs over infinite domains (May 2007)
More informationDISJOINT-UNION PARTIAL ALGEBRAS
Logical Methods in Computer Science Vol. 13(2:10)2017, pp. 1 31 https://lmcs.episciences.org/ Submitted Dec. 07, 2016 Published Jun. 22, 2017 DISJOINT-UNION PARTIAL ALGEBRAS ROBIN HIRSCH AND BRETT MCLEAN
More informationSets, Logic, Relations, and Functions
Sets, Logic, Relations, and Functions Andrew Kay September 28, 2014 Abstract This is an introductory text, not a comprehensive study; these notes contain mainly definitions, basic results, and examples.
More informationSet, functions and Euclidean space. Seungjin Han
Set, functions and Euclidean space Seungjin Han September, 2018 1 Some Basics LOGIC A is necessary for B : If B holds, then A holds. B A A B is the contraposition of B A. A is sufficient for B: If A holds,
More informationMonoids. Definition: A binary operation on a set M is a function : M M M. Examples:
Monoids Definition: A binary operation on a set M is a function : M M M. If : M M M, we say that is well defined on M or equivalently, that M is closed under the operation. Examples: Definition: A monoid
More informationChapter 1. Sets and Numbers
Chapter 1. Sets and Numbers 1. Sets A set is considered to be a collection of objects (elements). If A is a set and x is an element of the set A, we say x is a member of A or x belongs to A, and we write
More informationSUBALGEBRAS AND HOMOMORPHIC IMAGES OF THE RIEGER-NISHIMURA LATTICE
SUBALGEBRAS AND HOMOMORPHIC IMAGES OF THE RIEGER-NISHIMURA LATTICE Guram Bezhanishvili and Revaz Grigolia Abstract In this note we characterize all subalgebras and homomorphic images of the free cyclic
More informationUniversität Augsburg. Institut für Informatik. Separability in Domain Semirings. D Augsburg. Report Dezember 2004
Universität Augsburg à ÊÇÅÍÆ ËÀǼ Separability in Domain Semirings Dexter Kozen Bernhard Möller Report 2004-16 Dezember 2004 Institut für Informatik D-86135 Augsburg Copyright c Dexter Kozen Bernhard Möller
More information1. Foundations of Numerics from Advanced Mathematics. Mathematical Essentials and Notation
1. Foundations of Numerics from Advanced Mathematics Mathematical Essentials and Notation Mathematical Essentials and Notation, October 22, 2012 1 The main purpose of this first chapter (about 4 lectures)
More informationDisjoint n-amalgamation
October 13, 2015 Varieties of background theme: the role of infinitary logic Goals 1 study n- toward 1 existence/ of atomic models in uncountable cardinals. 2 0-1-laws 2 History, aec, and Neo-stability
More informationDecidability of integer multiplication and ordinal addition. Two applications of the Feferman-Vaught theory
Decidability of integer multiplication and ordinal addition Two applications of the Feferman-Vaught theory Ting Zhang Stanford University Stanford February 2003 Logic Seminar 1 The motivation There are
More informationFinite Automata and Regular Languages
Finite Automata and Regular Languages Topics to be covered in Chapters 1-4 include: deterministic vs. nondeterministic FA, regular expressions, one-way vs. two-way FA, minimization, pumping lemma for regular
More informationFINITE, INTEGRAL, AND FINITE-DIMENSIONAL RELATION ALGEBRAS: A BRIEF HISTORY.
FINITE, INTEGRAL, AND FINITE-DIMENSIONAL RELATION ALGEBRAS: A BRIEF HISTORY. ROGER D. MADDUX Abstract. Relation were invented by Tarski and his collaborators in the middle of the twentieth century. The
More informationMINIMAL GENERATING SETS OF GROUPS, RINGS, AND FIELDS
MINIMAL GENERATING SETS OF GROUPS, RINGS, AND FIELDS LORENZ HALBEISEN, MARTIN HAMILTON, AND PAVEL RŮŽIČKA Abstract. A subset X of a group (or a ring, or a field) is called generating, if the smallest subgroup
More informationAxioms of Kleene Algebra
Introduction to Kleene Algebra Lecture 2 CS786 Spring 2004 January 28, 2004 Axioms of Kleene Algebra In this lecture we give the formal definition of a Kleene algebra and derive some basic consequences.
More informationClC (X ) : X ω X } C. (11)
With each closed-set system we associate a closure operation. Definition 1.20. Let A, C be a closed-set system. Define Cl C : : P(A) P(A) as follows. For every X A, Cl C (X) = { C C : X C }. Cl C (X) is
More informationChapter Summary. Sets The Language of Sets Set Operations Set Identities Functions Types of Functions Operations on Functions Computability
Chapter 2 1 Chapter Summary Sets The Language of Sets Set Operations Set Identities Functions Types of Functions Operations on Functions Computability Sequences and Summations Types of Sequences Summation
More information2.1 Sets. Definition 1 A set is an unordered collection of objects. Important sets: N, Z, Z +, Q, R.
2. Basic Structures 2.1 Sets Definition 1 A set is an unordered collection of objects. Important sets: N, Z, Z +, Q, R. Definition 2 Objects in a set are called elements or members of the set. A set is
More informationMULTIRELATIONAL MODELS OF LAZY, MONODIC TREE, AND PROBABILISTIC KLEENE ALGEBRAS
九州大学学術情報リポジトリ Kyushu University Institutional Repository MULTIRELATIONAL MODELS OF LAZY, MONODIC TREE, AND PROBABILISTIC KLEENE ALGEBRAS Furusawa, Hitoshi Department of Mathematics and Computer Science,
More informationRings and Fields Theorems
Rings and Fields Theorems Rajesh Kumar PMATH 334 Intro to Rings and Fields Fall 2009 October 25, 2009 12 Rings and Fields 12.1 Definition Groups and Abelian Groups Let R be a non-empty set. Let + and (multiplication)
More informationPart IA Numbers and Sets
Part IA Numbers and Sets Definitions Based on lectures by A. G. Thomason Notes taken by Dexter Chua Michaelmas 2014 These notes are not endorsed by the lecturers, and I have modified them (often significantly)
More informationAutomata Theory and Formal Grammars: Lecture 1
Automata Theory and Formal Grammars: Lecture 1 Sets, Languages, Logic Automata Theory and Formal Grammars: Lecture 1 p.1/72 Sets, Languages, Logic Today Course Overview Administrivia Sets Theory (Review?)
More informationProbability Measures in Gödel Logic
Probability Measures in Gödel Logic Diego Valota Department of Computer Science University of Milan valota@di.unimi.it Joint work with Stefano Aguzzoli (UNIMI), Brunella Gerla and Matteo Bianchi (UNINSUBRIA)
More informationA strongly rigid binary relation
A strongly rigid binary relation Anne Fearnley 8 November 1994 Abstract A binary relation ρ on a set U is strongly rigid if every universal algebra on U such that ρ is a subuniverse of its square is trivial.
More informationOmega Algebra, Demonic Refinement Algebra and Commands. Peter Höfner Kim Solin Bernhard Möller. Report June 2006
à ÊÇÅÍÆ ËÀǼ Universität Augsburg Omega Algebra, Demonic Refinement Algebra and Commands Peter Höfner Kim Solin Bernhard Möller Report 2006-11 June 2006 Institut für Informatik D-86135 Augsburg Copyright
More information