G. Birkho. On the combination of subalgebras. Proc. Camb. Phil. Soc, 29:441-464, 1933.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....lattice L, one can construct an EFG such that its con guration space is isomorphic to L. 1 2 The result In this section, we prove that any distributive lattice is isomorphic to the con guration space of an EFG. The proof uses the theorem of Birkho for representation of distributive lattices [1]. We rst state this theorem and the de nitions needed. After this, we restrict ourselves to the EFGs which satisfy the following property: during any sequence of possible rings, each vertex is red at most once. Such an EFG is said to be simple. We prove that any distributive lattice is ....

....b 2 O, and a b imply b 2 F . In other words, a subset of O is a lter of O if and only if it is upper closed. The set of all the lters of an ordered set can itself be ordered by reverse inclusion: F F 0 if and only if F 0 F . We can now state the famous theorem from Birkho : Theorem 1 [1] Any distributive lattice is isomorphic to the set of the lters of the order induced over its join irreducibles, ordered by reverse inclusion. In the sequel, we will only consider simple EFGs. Indeed, we will see that any EFG is equivalent to such an EFG. We begin by giving a lemma about simple ....

G. Birkho. On the combination of subalgebras. Proc. Camb. Phil. Soc, 29:441-464, 1933.

....In a ULD lattice, for each m 2 M, there are several j 2 J such that j l m, but for each j 2 J, there is exactly one m 2 M such that j l m. So J is partitioned into jMj sets m l = f j 2 J; j l mg. Finally we give Birkhoff s representation theorem for distributive lattices: Theorem 2. 5 (Birkhoff) [Bir33] A lattice is distributive if and only if it is isomorphic to the lattice of the ideals of the order induced on its meet irreductibles. 3 Simple Chip Firing Games We will represent the lattice of the configuration space of a CFG by its Hasse diagram, and, when it is useful, we will label each ....

G. Birkhoff. On the combination of subalgebras. Proc. Camb. Phil. Soc, 29:441--464, 1933.

.... oe ; Gamma ) Delta )oe ; Gamma ) Gamma ) Delta; oe ) Gamma ) Delta; Gamma ) Delta ) Gamma ) Gamma ) Delta; We now show that a Heyting algebra is the algebra for intuitionistic logic. This was shown by McKinsey and Tarski (1946) using a result of Birkhoff (1933) which showed that topologically distributive lattices are pseudo complemented. This particular presentation follows Fitting (1969) Definition 1 In a distributive lattice X = X; u; t; 0) with meet, u, join, t, and bottom element 0, the pseudo complement of x relative to x 0 , denoted x oe ....

Birkhoff, G. 1933. On the combination of subalgebras. Proc. Cambridge Phil. Soc 29:441--464.

....its applicability in several branches of algebra (see [8] 2. The equivalence of 3 and 4 was first proved by J. SCHMIDT in [9] but according to P. COHN in [6] page 81, is an unpublished result of P. HALL, and probably G. BIRKHOFF knew this result (at least part of it) even eearlier (see [1 4]) 10 3. The equivalence of 1 and 3 was also discovered by J. SCHMIDT and first proved in [9] He also pointed out the importance of inductive systems of sets for applying ZORN s lemma, where it should be mentioned that the notion of inductiveness can already be found in [5] 4. A proof for the ....

G. BIRKHOFF. On the combination of subalgebras. In: Proc. Cambridge Phil. Soc., volume 23, pages 441--464, 1933.

....of the axiom of choice: one shows that if X 6 Y , then there is an ideal element x such that X x but x Y = This is done by showing that the maximal filter F containing X and disjoint from #Y in the generated lattice L(A) is prime. The ideas used in such a proof seem to come from Birkhoff [2]. It is worth noting a number of consequences of Theorem 6. First, if we start from a set of pairs f(X i ; Y i ) j i 2 Ig, then the least entailment relation generated by it can be described as X Y if and only if for any x, if X x, then x Y is inhabited, where x is an ideal element ....

G. Birkhoff. On the combination of subalgebras. Proc. Camb. Philos. Soc. 29, 441-464, 1933.

....we need to verify that it is idempotent. Notice that #(#(x) # j#N (#(#(j) where x = # N and N is the set of join irreducibles below x.LetM j be the set of join irreducibles below #(j) Since # is weakly independent, we have #(k) # #(j) 6 Zsolt Lengvarszky and George F. McNulty [6] for each k # M j . This entails that #(#(j) #(j)since #(j)##(#(j) # k#M j #(k) # #(j) Consequently, #(#(x) #(x) as desired. We conclude that # is a topological closure operator. Now suppose that # is any closure operator on L and let # denote the restriction of # to J 0 (L) Let ....

....of those listed. Tuma s arguments, like Hashimoto s, are framed in the language of order ideals. These arguments can all be converted, in the context of finite distributive lattices, more or less routinely into arguments about join irreducible elements, in view of the duality observed by Birkho# [6] in 1933 between finite distributive lattices and the order ideals of their join irreducible elements. Our characterization, given in Theorems 1 and 2, concerns adding elements to a sublattice S to obtain a sublattice S # which covers S. On the other hand, the characterization given in Theorem 5 ....

G. Birkho#, `On the combination of subalgebras', Proc. Cambridge Philos. Soc. 29 (1933) 441--464.

....and its counterpart. In addition we added the unit for , 0, and , 1. 9 Heyting Algebras for Intuitionistic Logic This section will show that a Heyting algebra (or a pseudo Boolean algebra ) is the algebra for intuitionistic logic. This was shown by McKinsey and Tarski (1946) using a result of Birkhoff (1933) which showed that topologically distributive lattices are pseudo complemented. This particular presentation follows Fitting (1969) Definition 19 In a distributive lattice X = X; u; t; 0) with meet, u, join, t, and bottom element 0, the pseudo complement of x relative to x 0 , denoted x oe ....

Birkhoff, G. 1933. On the combination of subalgebras. Proc. Cambridge Phil. Soc 29:441--464.

....will be a set of events ordered by time. State spaces generalize bc domains (Scott domains or bounded complete algebraic cpo s) Gun92] while their complementary event spaces generalize Winskel s event structures [Win86] This particular duality is one small fragment of Birkhoff Stone duality [Bir33, Sto36, Sto37, Pri70], with the partial distributive lattices alluded to in the section on measurement constituting a much larger fragment. A state space can be thought of as a representation of behavior somewhere in between a formal language 3 We shall see later that the terms dual, complement, and converse form a ....

G. Birkhoff. On the combination of subalgebras. Proc. Cambridge Phil. Soc, 29:441--464, 1933.

....Here we limit the relations between events to those of temporal order ( binary distance ) and conflict. In the absence of conflict this arithmetic has for its progenitor the Birkhoff arithmetic of partial orders [Bir42] as a basic programming language for schedules. The Birkhoff Stone duality [Bir33, Sto37] of posets as deterministic schedules and distributive lattices as deterministic automata then constitutes a logic in which the duality of true and false are replaced by the duality of doing and being. This duality interchanges events (as actions) and states (as facts or models) and dualizes the ....

G. Birkhoff. On the combination of subalgebras. Proc. Cambridge Phil. Soc, 29:441--464, 1933.

....is obviously an isomorphism of Fpos with itself and of FDL with itself. Dual continues to be defined as before: if P is a finite poset, 2 P is a finite distributive lattice, and vice versa, making Fpos dual to FDL (isomorphic to FDL op ) just as for Fchn and Fchn01, shown by Birkhoff in 1933 [Bir33]. Stone [Sto37] a little later found one extremal extension of this duality to infinite objects, much later characterized nicely by Priestley [Pri70] as the duality of partially ordered Stone spaces and distributive lattices; the other extremal extension is between posets and profinite ....

G. Birkhoff. On the combination of subalgebras. Proc. Cambridge Phil. Soc, 29:441--464, 1933.

....2 n . So the picture so far is that if schedules are just unordered sets of jobs, there is, up to isomorphism, just one schedule of each size n and one matching automaton of size 2 n . This duality can now be spiced up in two essentially orthogonal ways, a combinatorial one due to G. Birkhoff [Bir33] and a topological one due to M. Stone [Sto36] Remarkably, that these ways were orthogonal passed unnoticed until pointed out by H. Priestley in 1970 [Pri70] Keeping everything finite, Birkhoff duality generalizes the discrete schedules to partially ordered schedules, and generalizes the ....

G. Birkhoff. On the combination of subalgebras. Proc. Cambridge Phil. Soc, 29:441-- 464, 1933.

....machinery, while its algebra constitutes a parallel programming language whose syntax and axiomatics are most succinctly described as being those of full linear logic. Our starting point is Winskel s notion of event structure, based on Birkhoff s duality of finite posets and distributive lattices [Bir33], extended to the infinite case by Stone [Sto36, Sto37] This duality associates to each poset S = X; the distributive lattice 2 S op consisting of the order ideals of S, and to each distributive lattice A = X; 0; 1) the poset 2 A op consisting of the lattice ideals of A, in such a ....

G. Birkhoff. On the combination of subalgebras. Proc. Cambridge Phil. Soc, 29:441--464, 1933.

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