L. Henkin, J.D. Monk, A. Tarski, Cylindric Algebras Part 2, North-Holland, Amsterdam (1985).  Home/Search   Document Not in Database   Summary   Related Articles   Check

....) De nition 1.4.3 (Free variables) Let C be a constraint system over V and c a constraint of C. A variable v is (essentially) free in c when 9 x c 6= c. We denote with fv(c) the set of free variables in c. The set of free variables in c is sometimes called the dimension set of c, according to [HMT71] In Proposition 1.4.4 we show some properties that are satis ed by free variables. Those properties are used to prove the results presented in the rst part of the dissertation. Proposition 1.4.4 Free variables satisfy the following conditions: 1. fv(c t d) fv(c) fv(d) 2. fv(9 x c) ....

....subject to the E1 c w 9 x c, E2 9 x is monotonic, E3 9 x (c t 9 x d) 9 x c t 9 x d, E4 9 x 9 y c = 9 y 9 x c, D1 xx = D2 if y 6= x; z then xz = 9 y ( xy t yz ) D3 if x 6= y then xy t 9 x (c t xy ) w c. Our de nition is almost the same as the one given for cylindric algebras in [HMT71] but we use upper semilattices instead of boolean algebras for the underlying partially ordered set C. Note that condition E2 for cylindric semilattices is redundant. Actually, if c v d then 9 x c v d and therefore 9 x c t d = d. By E3 9 x d = 9 x (9 x c t d) 9 x c t 9 x d which means that ....

[Article contains additional citation context not shown here]

L. Henkin, J. D. Monk, and A. Tarski. Cylindric Algebras Part I. North{Holland, Amsterdam, 1971.

....H ) refers to this fact. d g De nition 2.4 Throughout this paper, G denotes the following set. G = f[i=j] i; j 2 g [ fsuc; predg: The following theorem summarizes the main results of this section. Gwdf refers to the name generalized weak diagonal free cylindric set al..gebra used in [HMTI] to denote the H free reduct of our class. The de nition makes perfect sense for the case when V is only a generalized weak Cartesian space (or even any subset of U for some set U) For brevity, we will not discuss here the more general cases. Theorem 2.5 (i) ICdfG is a nite schema ....

....ICdfH is a quasi variety, provided that H satis es some properties. Furthermore, we give a set Qx of quasi equations that axiomatize ICdfH over IGwdfH . Results 2.19 and 2.20 were obtained jointly with Istv an N emeti. De nition 2.18 (i) Let n 2 , f 0 ; n 1 g . We recall from [HMTI] that c ( x = c 0 : c n 1 x. In [Sa87] a simple proof is given to the fact that ICdf G is closed under SPUp, i.e. it forms a quasi variety. Finite schema axiomatizability is not proved there. ii) We de ne Qx to be c ( i ) x i = 1 s (x) 0 ) 0 = 1; for m 2 ; 0 ; ....

[Article contains additional citation context not shown here]

Henkin,L. Monk,J.D. and Tarski,A. Cylindric Algebras Part I. North{ Holland, Amsterdam, 1971. hmtii

....algebras and relation algebras. The introductory paper by J. Donald Monk in the present volume introduces the reader to the theory of cylindric algebras. Moreover, this easily readable paper makes the classical main reference books on cylindric algebra theory in particular, and AL in general ([5], 6] more easily accessible for the reader. Since [6] discusses relation algebras, too, this way the reader is led up to the third main reference book on AL: 11] with a strong emphasis on relation algebras) As we mentioned, the core part of AL consists of cylindric algebras, relation ....

L. Henkin, J. D. Monk, and A. Tarski. Cylindric Algebras Part I. North{Holland, Amsterdam,

....#( # U)then# will be the disjoint union of those weak Cartesian substructures generated by points of #. It follows that Cm# # = Y x## Cm#( # U (x) and this establishes the relationship Cm##### # PCm#### . Further characterisations of representable cylindric algebras obtained in [19] include RCA# = SPCm##### = SPCm#### . 4. DUALITY 413 4.4 The Calculus of Class Operations First, here is a summary of the main features of the duality between BAO s and relational structures thus far developed: A bounded morphism f : # 1 # # 2 induces a homomorphism f : Cm# 2 # Cm# ....

....closed under canonical extensions. Hence by Theorem 4.9, if it is complete then it is canonical. Theorem 4.15 If a variety of BAO s is generated by an elementary class of structures, then it is canonical. Proof. We give the main features of a proof that has been discussed in detail in the papers [14, 15, 19]. There are two main additional ingredients. First, the fact that an ultraproduct of bounded unions of structures can be represented as a bounded union of ultraproducts of those structures: #u#b # #b#u (cf. Theorem 2.4 of [19] for the proof) To be precise, we need a special case of this fact, ....

[Article contains additional citation context not shown here]

L. Henkin, J. D. Monk, and A. Tarski. Cylindric Algebras Part I. North--Holland, Amsterdam,

....the Boolean axioms, and for each 2 G, that s is a Boolean endomorphism. Further, we postulate that c 0 is an additive and complemented (i.e. c 0 c 0 x = c 0 x) closure operator. Hence c i is an additive and complemented closure operator, for every i 2 (3. 19) that is, C 0 ) C 3 ) of [19] holds) This is easy to prove. Also s w is a Boolean endomorphism for each w 2 G : 3.20) To each word w 2 G , let w 2 T be the element of T associated naturally to w. Let G 0 be the nite generator set of T 0 (cf. condition (3:14) of the theorem) To each 2 G 0 we ....

.... i j c i s c i x = s i j s c i x = s [i=j] c i x : End of proving ( 5) Now, 1) 3) 4) 7) are immediate by (3:19) 3:20) 3:16) 3:24) 3:18) respectively (in this order, e.g. 3) follows from (3:16) except that part c i c j x = c j c i x of ( 1) i.e. C 4 ) of [19]) does not follow from (3:19) To prove c i c j x = c j c i x from (3.16) 3.24) we will use the results from Pinter [45] Namely, q 1 ) q 9 ) of Def.2.1 in [45] follow from (3.16) 3.24) since (q 9 ) is ( 7) which we already proved, and the others are parts of statements in (3.16) 3.24) ....

[Article contains additional citation context not shown here]

L. Henkin, J. D. Monk, and A. Tarski. Cylindric Algebras Part I. North{Holland, Amsterdam,

....algebras and relation algebras. The introductory paper by J. Donald Monk in the present volume introduces the reader to the theory of cylindric algebras. Moreover, this easily readable paper makes the classical main reference books on cylindric algebra theory in particular, and AL in general ([5], 6] more easily accessible for the reader. Since [6] discusses relation algebras, too, this way the reader is led up to the third main reference book on AL: 11] with a strong emphasis on relation algebras) As we mentioned, the core part of AL consists of cylindric algebras, relation ....

L. Henkin, J. D. Monk, and A. Tarski. Cylindric Algebras Part I. North--Holland, Amsterdam,

....is given by Hilbert and Bernays [14] D.C. Cooper [6] extends the algorithm to include subtraction and formulae on both positive and negative integers. In this paper, Presburger formulae are simpli ed and satis ed via the Omega calculator[24] We view our constraint system as a cylindric algebra[13], where constraints are identi ed modulo logical equivalence. Cylindric algebra provides an algebraic style reasoning about the formulae. Our cylindric algebra, P, is a boolean algebra where existential quanti cation (9 X ) is the (idempotent) projection operation, and are the meet (denoted by ....

L. Henkin, J.D. Monk, and A. Tarski. Cylindric Algebras: Part I. NorthHolland, 1971.

....gave a possible worlds semantics. Here we give a more general possible worlds semantics for not necessarily normal multi modal logics with arbitrarily many not necessarily unary modalities. Strongly related to the above is the theorem, proved e.g. in J onssonTarski [JT 52] and Henkin Monk Tarski [HMT 71] that every normal Boolean algebra with operators (BAO) can be represented as a subalgebra of the complex algebra of some relational structure. We extend this result to not necessarily normal BAO s as follows. We define partial relational structures and show that every not necessarily normal ....

.... k Gamma1 ; x k ; x k 1 ; x ae(i) Gamma1 ) f i (x 0 ; x k Gamma1 ; x 0 k ; x k 1 ; x ae(i) Gamma1 ) Sometimes the property (Dst) is referred to as additivity of f i (this comes from the tradition when the symbol is used for the denoting the Boolean join , cf. e.g. HMT 71] The class of all Boolean algebras with operators of type t is denoted by BAO t . If A 2 BAO t for some type t = hI; aei then its non Boolean operations f i (i 2 I) are called its operators. Sometimes we refer to the operators f i as the extra Boolean operations of A. 2) A 2 BAO is called a ....

[Article contains additional citation context not shown here]

L. Henkin, J. D. Monk, A. Tarski, Cylindric Algebras Part I, NorthHolland, Amsterdam (1971).

....is finite schema axiomatizable. Independently from Daigneault and Monk, Keisler proved the logical version of this representation theorem. Before turning to the goal of section 3, let us look briefly to the goal of section 4. The notational system will be recalled from the textbooks [4] [5] in section 2, till then we try to use as little notation as we can. In section 4 we look at the equational theory of RPEA from the point of view of recursion theoretic degrees of unsolvability. We have two aims with this: i) To shed some more light on the possibility or impossibility of ....

....set Ug. RPEA ff is called the class of representable polyadic equality algebras of dimension ff. The class RPA ff of representable polyadic algebras of dimension ff is defined to be the class of D i;j free subreducts of members of RPEA ff ; in symbols: RPA ff = SRd(RPEA ff ) For details see [5]. Definition 2.1 Throughout, ff is an ordinal. L PEA ff denotes the language of RPEA ff . For completeness we note that a detailed discussion is in [5] p.225. We will denote the polyadic operations by ; Gamma; C ( Gamma) S and D i;j . The corresponding operation symbols (in L PEA ff ) are ....

[Article contains additional citation context not shown here]

L. Henkin, J.D. Monk, A. Tarski, Cylindric Algebras Part 2, NorthHolland, Amsterdam (1985).

....equality) is finite schema axiomatizable. Independently from Daigneault and Monk, Keisler proved the logical version of this representation theorem. Before turning to the goal of section 3, let us look briefly to the goal of section 4. The notational system will be recalled from the textbooks [4], 5] in section 2, till then we try to use as little notation as we can. In section 4 we look at the equational theory of RPEA from the point of view of recursion theoretic degrees of unsolvability. We have two aims with this: i) To shed some more light on the possibility or impossibility of ....

L. Henkin, J.D. Monk, A. Tarski, Cylindric Algebras Part 1, NorthHolland, Amsterdam (1971).

....ff ary relations. For the special case of binary relations, there is an alternative approach to algebraisation, using relation algebras. This paper is concerned with the connection between the two approaches and the consequences for ff variable proofs in first order logic. We use the notation of [5, 6]. In particular, CA ff is the class of ff dimensional cylindric algebras, and, for any class K of algebras, SK is the class of all algebras that embed into some algebra in K. For any ordinal ff 3, there is a well known method of obtaining a relation algebra RaC from an ff dimensional cylindric ....

....ordinals. If A is a boolean algebra with operators, AtA denotes the set of atoms, or minimal non zero elements, of the boolean part of A. 3 2 Relation algebra reducts of cylindric algebras We assume a basic knowledge of relation algebras and cylindric algebras. See [11] for an introduction, and [5, 6] for a comprehensive study. The j for i substitutor, s i j , is defined by s i j x = ae x if i = j, c i (x Delta d ij ) otherwise. Given a cylindric algebra C, it is possible to construct from it an algebra RaC, called the neat relation algebra reduct or simply the relation algebra reduct of ....

[Article contains additional citation context not shown here]

L Henkin, J D Monk, and A Tarski. Cylindric Algebras Part I. North-Holland, 1971.

....of appropriate games. This is shown to be equivalent to the existence of certain classes of networks. 2 References to relation algebra include [ Tarski, 1941, J onsson and Tarski, 1948, Tarski and Givant, 1987, Maddux, 1991, Givant, 1994, N emeti, 1995 ] and to cylindric algebra there is [ Henkin et al. 1971, Henkin et al. 1985, Monk, 1993, N emeti, 1995 ] Andr eka et al. 1991 ] contains a variety of articles on algebraic logic. August 30, 1996 4 In section 5 we derive a first order axiom schema which determines whether a finite relation algebra is representable. In a similar way, an axiom ....

....cylindrifications C ( ff) S is of course closed under all these operations. The class of all cylindric set al..gebras of dimension ff is denoted Cs ff . ffl A cylindric algebra of dimension ff is defined to be a structure C = C; Gamma; 0; 1; c ; d ) ff obeying the following axioms [Henkin et al. 1971] for every x; y 2 C; ff: 1. C; Gamma; 0; 1) is a boolean algebra August 30, 1996 55 2. c 0 = 0 3. x c x 4. c (x c y) c x c y 5. c c x = c c x 6. d = 1 7. if 6= then d = c (d d ) 8. if 6= then c (d x) c (d Gammax) 0. These axioms are valid ....

L Henkin, J D Monk, and A Tarski. Cylindric Algebras Part I. NorthHolland, 1971.

....if (8OE) GOE 2 Gamma OE 2 Delta. Note that it is not possible to enforce that this construction gives irreflexive models and so completeness proofs over irreflexive flows of 2 References to relation algebra include [Tar41, JT48, TG87, Mad91, Giv94, N 95] and to cylindric algebra there is [HMT71, HMT85, Mon93, N 95] AMN91] contains a variety of articles on algebraic logic. November 30, 1995 4 time require an additional section in the proof where reflexive clusters are bulldozed to make them irreflexive (see, for example, Bla89] The Burgess proof works in a different way. To ....

....cylindrifications C ( ff) S is of course closed under all these operations. The class of all cylindric set al..gebras of dimension ff is denoted Cs ff . ffl A cylindric algebra of dimension ff is defined to be a structure C = C; Gamma; 0; 1; c ; d ) ff obeying the following axioms [HMT71] for every x; y 2 C; ff: 1. C; Gamma; 0; 1) is a boolean algebra 2. c 0 = 0 3. x c x 4. c (x c y) c x c y 5. c c x = c c x 6. d = 1 7. if 6= then d = c (d d ) 8. if 6= then c (d x) c (d Gammax) 0. November 30, 1995 45 These axioms are ....

L Henkin, J D Monk, and A Tarski. Cylindric Algebras Part I. North-Holland, 1971.

....in first order logic we can say there exists a person who is my parent and your sibling , which could be expressed in relation algebra as you are either my uncle or my aunt . Then, in the twentieth century, first order logic was given an algebraic setting in the framework of cylindric algebra [HMT71, HMT85]. So we now have two main algebraic formalisms for relations of various ranks: relation algebras constitute an algebraization of binary relations and n dimensional cylindric algebras are an algebraization of n ary relations. Ever since these algebras were defined, researchers have investigated the ....

....In this section, we prove some necessary preliminary results about substitutions in cylindric algebras. n 4 remains fixed. Recall again that the substitution operator s i j is defined by s i j x = ae x; if i = j; c i (d ij Delta x) otherwise, for i; j n. As is standard, e.g. in [HMT71], the map [i=j] n n is given by: i=j] k) ae j; if k = i; k; otherwise. Of course, this definition depends implicitly on n. We write maps on the left, and ffi denotes map composition, so that for example, 1=2] ffi [2=3] 1) 1=2] 2=3] 1) 2. 3.1.1 s c words Definition 15 1. An ....

L Henkin, J D Monk, and A Tarski. Cylindric Algebras Part I. North-Holland, 1971. 37

....elements D ( ff) and closed under the cylindrification operators C ( ff) The class of all cylindric set al..gebras of dimension ff is denoted Cs ff . ffl A cylindric algebra of dimension ff is defined to be a structure C = C; Gamma; 0; 1; c ; d ) ff obeying the following axioms [HMT71] for every x; y 2 C; ff: 1. C; Gamma; 0; 1) is a boolean algebra 2. c 0 = 0 3. x c x 4. c (x c y) c x c y 5. c c x = c c x 6. d = 1 7. if 6= then d = c (d d ) 8. if 6= then c (d x) c (d Gammax) 0. ffl A cylindric algebra is said to be ....

L Henkin, J D Monk, and A Tarski. Cylindric Algebras Part I. North-Holland, 1971.

....is not elementary. The proof of this turns out to be quite simple and is dealt with separately as it is not based on the same argument. 4.1 Basics We assume some familiarity with cylindric algebras and their representations, though we will give complete definitions. The principal references are [4, 5]. Let ff 3 be an ordinal. ffl A cylindric algebra of dimension ff is a structure C = hC; 0; 1; Gamma; d ; c i ; ff obeying the following axioms. The reduct hC; 0; 1; Gamma; i is a boolean algebra. c 0 = 0 x c x c (x c y) c x c y c c x = c c x March 1, ....

L Henkin, J D Monk, and A Tarski. Cylindric Algebras Part I. North-Holland, 1971.

....Does every relation algebra with an n dimensional hyper basis embed in one with an n dimensional cylindric basis (We believe not, but this is 2 Both these ways of ensuring good behaviour of large fragments of a potential representation have the basic properties we might expect. See, e.g. HMT71, HMT85, Mad83] It is known that RA, the class of relation algebras, is equal to RA 4 and to SRaCA 4 . We have RA 4 RA 5 Delta Delta Delta; these inclusions were proven strict in [Mad92] Similarly, SRaCA 4 SRaCA 5 Delta Delta Delta; infinitely many of these inclusions were shown to ....

....algebra of A. AtA denotes the set of atoms of (the boolean part of) A. We generally identify (notationally) an algebra with its domain; but if A and B are algebras, we still write A B to denote that A is a subalgebra of B. Most of the other notation we use is in conformity with that of [HMT71, HMT85] Ordinals in this paper are finite or occasionally ; an ordinal is the set of smaller ordinals. For any set X and ordinal n, n X denotes the set of functions : n X , which we view as the set of n tuples of elements of X . n X denotes S m n m X and n X denotes n 1 X . If ....

[Article contains additional citation context not shown here]

L Henkin, J D Monk, and A Tarski. Cylindric Algebras Part I. North-Holland, 1971.

No context found.

L. Henkin, J. D. Monk, and A. Tarski. Cylindric Algebras Part I. North{ Holland, Amsterdam, 1971.

No context found.

L. Henkin, J.D. Monk, A. Tarski, Cylindric Algebras Part 2, North-Holland, Amsterdam (1985).

No context found.

L. Henkin, J.D. Monk, A. Tarski, Cylindric Algebras Part 1, North-Holland, Amsterdam (1971).

No context found.

L. Henkin, J.D. Monk, A. Tarski, Cylindric Algebras Part 2, North-Holland, Amsterdam (1985).

No context found.

L. Henkin, J.D. Monk, A. Tarski, Cylindric Algebras Part 1, North-Holland, Amsterdam (1971).

No context found.

Henkin,L., Monk,J.D., and Tarski, A., Cylindric Algebras Part I. North Holland, 1971.

No context found.

Henkin,L., Monk,J.D., and Tarski, A., Cylindric Algebras Part I. North Holland, 1971.

No context found.

L Henkin, J D Monk, and A Tarski. Cylindric Algebras Part I. North-Holland, 1971.

First 50 documents

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC