Bourbaki, N., Elements of Mathematics, General Topology, Springer Verlag 1989.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....p 2 p n ) p i IH ,i=1, 2, n . Then IH n is a vector space over IH with the usual and IH acting on the left . The row rank of a matrix T over IH, denoted by rank r T , is the dimension of the subspace of IH n spanned by the rows of T (with IH acting on the left) By Proposition 10 in [Bu] II 10.12, rank c T = rank r T. So we can use rank T to denote either rank c T or rank r T . See Proposition 13 in [Bu] II 10.13 for a proof of the following result: Lemma 1.1: Let A with rank A = r. Then there exists invertible matrices S and T over IH such that: SAT = I rr 0 . ....

..... The row rank of a matrix T over IH, denoted by rank r T , is the dimension of the subspace of IH n spanned by the rows of T (with IH acting on the left) By Proposition 10 in [Bu] II 10.12, rank c T = rank r T. So we can use rank T to denote either rank c T or rank r T . See Proposition 13 in [Bu] II 10.13 for a proof of the following result: Lemma 1.1: Let A with rank A = r. Then there exists invertible matrices S and T over IH such that: SAT = I rr 0 . 1.3) In particular, if m = n, then A has rank n if and only if it is invertible. Equation (1.3) can be written as: ....

Bourbaki, Elements of Mathematics, Algebra, Part I, Addison-Wesley, Reading, MA, 1974.

....the pop uniformity to get a Hausdor and complete uniform space that contains the original one as a dense subspace. We investigate how both completions are related. The reader is assumed to have some basic knowledge in topology, especially in the theory of uniform spaces. In the books by Bourbaki [4] and Kelley [8] he or she will nd much more than we actually need here. For notions from and a survey on domain theory we recommend Abramsky and Jung [1] 2 Basic facts on posets with projections In this section we recall some facts concerning posets with projections. Throughout this paper let ....

N. Bourbaki. General Topology. Elements of Mathematics. Hermann, Paris, 1966.

....f(#(x 1 #(x n ) # f(x x n ) f(x x n ) Therefore, f(## q) x x n ) 0 for all x i V i and 1 n. Since 0, the map q does not surject onto V V n , and thus is not injective. Therefore, q is an eigenvalue of . By Proposition 11 on p. A. VII.39 of [5] and induction, the set of eigenvalues of # # n : # i is an eigenvalue for the action of # on V i . Since the Galois action on Z #Z is trivial, q is replaced by 1 in the above, if # is replaced by Z #Z. Similarly, q is replaced by 1 q if # is replaced by its dual. # As a special case, ....

N. Bourbaki, Elements of mathematics, Algebra II, Chapters 4--7, Springer, 1990.

....1 (x n ) x n ) Therefore, f( q) x x n ) 0 for all x i 2 V i and 1 i n. Since f 6= 0, the map q does not surject onto V V n , and thus is not injective. Therefore, q is an eigenvalue of . By Proposition 11 on p. A. VII.39 of [5] and induction, the set of eigenvalues of is f 1 n : i is an eigenvalue for the action of on V i g: Since the Galois action on Z= Z is trivial, q is replaced by 1 in the above, if is replaced by Z= Z. Similarly, q is replaced by 1=q if is replaced by its dual. As a ....

N. Bourbaki, Elements of Mathematics, Algebra II, Chapters 4-7, Springer, 1990.

....concurrency, and lastly we describe America and Rutten s generalization to standard type equations, and end by giving their equivalent of Scott s inverse limit theorem, this time using metric spaces instead of pre orders. For the metric preliminaries we recommend [Dugundji 66] Willard 70] and [Bourbaki 89] and for the specific ultra metric material [Schikhof 84] 2.2.1 Metric prerequisites We give some basic definitions and theorems that will lay the foundation for the subsequent development. Definition 2.2 A metric space is a pair (M, d) where M is a set and d: M x M [0, c) fulfills (i) ....

....(i.e. the set of e such that there exists points that are precisely e apart) viz. that any sharply decreasing sequence of realized distances converges to 0 . We recall some standard properties of closed and open subsets without proof. For an exposition, see any textbook on topology, for instance [Bourbaki 89] or [Dugundji 66] Proposition 2.4 A subset of a metric space is open if every Cauchy sequence that converges to a point within the subset, also shares an element with the subset. It is immediate that a convergent Cauchy sequence that from some point on lies entirely within a closed subset, ....

Bourbaki, N., Elements of Mathematics, General Topology, Springer Verlag 1989.

....if and only if it is continuous at some point. Observe the analogy to homomorphisms of topological groups. Let us fix some notation. For the basic concepts of plane projective geometry, the reader is referred to Pickert [13] or Hughes Piper [12] for topological notions see e.g. Bourbaki [2] [3], Dugundji [5] Engelking [6] Four points of a projective plane are called a quadrangle if any three of them are not collinear. A topological projective plane Pi = P; L; P ; L ) is a projective plane (P; L) with neither indiscrete nor discrete topologies P on P and L on L, respectively, ....

....[18] x3; Salzmann et al. 22] Theorem 41.8) the topology of uniform convergence on the function space P : f f j f : P P g is induced by the supremum metric. Recall that on the subset of all continuous mappings of P this topology coincides with the compact open topology (cf. Bourbaki [3], X.3.4. Theorem 2) Let Sigma ae P denote the automorphism group of Pi, i.e. the group of all continuous collineations of Pi. Now the principal result of this note can be formulated as follows: 1.1) Theorem: Let Pi = P; L; P ; L ) be a compact projective plane and let (oe n ) n2IN ....

[Article contains additional citation context not shown here]

Bourbaki, N.: Elements of Mathematics, General Topology, Part 2. Hermann, Paris 1966

....if and only if it is continuous at some point. Observe the analogy to homomorphisms of topological groups. Let us fix some notation. For the basic concepts of plane projective geometry, the reader is referred to Pickert [13] or Hughes Piper [12] for topological notions see e.g. Bourbaki [2], 3] Dugundji [5] Engelking [6] Four points of a projective plane are called a quadrangle if any three of them are not collinear. A topological projective plane Pi = P; L; P ; L ) is a projective plane (P; L) with neither indiscrete nor discrete topologies P on P and L on L, ....

Bourbaki, N.: Elements of Mathematics, General Topology, Part 1. Hermann, Paris 1966

.... The account of universes is from Per Martin Lof [79] and is informed by Allen [4] and Palmgren [88] Insights about power sets can be found in Fraenkel et al. 50] Beeson [11] and Troelstra [105] Section 7 Families Families are important in set theory, and accounts such as Bourbaki [18] inform Martin Lof s approach [79] Section 8 Lists and Numbers List theory is the basis of McCarthy s theory of computing [82] The BoyerMoore prover was used to create an extensive formal theory [19] and the Nuprl libraries provide a constructive theory. Section 9 Logic and the Peano ....

N. Bourbaki. Elements of Mathematics, Theory of Sets. Addison-Wesley, Reading, MA, 1968.

....in a given situation, additional assumptions are made in order to preserve certain key properties in the absence of local compactness, sobriety or both. This has led to an abundance of di erent concepts for which it now appears impossible to establish a coherent terminology. Either of proper [4,10] or 14 Jung, Kegelmann and Moshier perfect [12,9,6] is usually used but it is not clear where the boundary between the two ought to be drawn. Our choice of perfect follows the more recent custom of reserving proper for slightly stronger requirements even in the case of locally compact ....

N. Bourbaki. General Topology. Elements of Mathematics. Springer Verlag, 1989.

....understanding of the derivations of degree 1 (see for example [10] see also [7] It is only reasonable then to wonder whether universal models exist for homogeneous (K; derivations of any degree. This paper is organized as follows: Section 1 recalls the basic de nitions following essentially [3]. Section 2 is devoted to the proof of some of the main results. The existence of the searched universal initial homogenous (K; derivation is proved in Theorem 2.2. Then, for a given 2 , the notion of (K; di erential is introduced in De nition 2.2 and the universal property for them is ....

....the corresponding degree map associated to the object in question. For simplicity, all degree maps will be denoted by j j, so that jxj stands for the degree of the element x, regardlees of whether it belongs to a graded ring, a graded module, or any other graded object. We shall now recall from [3] some basic results about graded rings: Given a graded ring R = L 2 R , the homogeneous component R 0 is a subring of R, and 1 2 R 0 (Note: All rings in this paper have a multiplicative unit element 1 6= 0) Let R and S be two graded rings and let f : R S be a homogeneous morphism of ....

N. Bourbaki, Elements of Mathematics, Algebra I, Chapters 1-3, SpringerVerlag, 2nd printing, 1989

....but a few mechanical rules. Godel [11] But formalized mathematics cannot in practice be written down in full, and therefore we must have confidence in what might be called the common sense of the mathematician . We shall therefore very quickly abandon formalized mathematics . Bourbaki [1] 1. Introduction A formal mathematical proof is a finite sequence of formulas, each element of which is either an axiom or the result of applying one of a fixed set of mechanical rules to previous formulas in the sequence. It is thus possible to write a computer program to check mechanically ....

N. Bourbaki. Elements of Mathematics. Addison Wesley, Reading, Massachusetts, 1968.

....as Equivalence Relations In this section, we give a formal mathematical definition of what we want to call an alignment, and we draw some immediate conclusions from this definition. We assume familiarity with the basic concepts of the mathematical theory of sets and relations (see for instance Bourbaki, 1968). Let us consider a finite set A, called the alphabet. The disjoint union 1 [ n=0 A n = A is called the sequence space over A. Given an alphabet A, any map s = s I : I A from a (finite) index set I into A is called a sequence family (over A) For every i 2 I, we denote by L i the ....

Bourbaki, N. 1968. Elements of mathematics, theory of sets. Addison Wesley, Reading, MA, USA.

....i=1 X i . In obvious similar notation for the second k net, we have C p (N 0 k ) k P i=1 n 0 P s=1 F p 0 is = k P i=1 X 0 i : The natural identification of F P ThetaP 0 p with F P p Omega F P 0 p gives C p (N k Theta N 0 k ) k P i=1 X i Omega X 0 i : By [2] we have (1) i k Gamma1 P i=1 X i j X k Omega i k Gamma1 P j=1 X 0 j j X 0 k = i k Gamma1 P i=1 X i j Omega i k Gamma1 P j=1 X 0 j j X k Omega X 0 k i k Gamma1 P i=1 X i Omega X 0 i j i X k Omega X 0 k j : The dimension of ....

N. Bourbaki, Elements of Mathematics. Algebra I, Chapters 1-3, Springer-Verlag, 1989, p. 306.

....that F(X; E) is approximating [complete] Conversely, if E is approximating, then it is straightforward to show that F(X; E) is approximating. Let E be complete. As the pop uniformity of F(X; E) is the uniformity of uniform convergence (Proposition 6. 1) we can use e.g. Theorem 1 in Bourbaki [3], Chapter X.1.5, to obtain completeness of F(X; E) 2 24 R. Kummetz: Posets with Projections and their Morphisms Let (D; be a poset, let E = E; q i ) i2I ) be an (I; indexed pop, and set M(D;E) ff 2 F(D; E) j f is monotoneg; S(D; E) ff 2 F(D; E) j f is Scott continuousg: As all q ....

....then E is totally bounded [compact] Proof: 1) As NEX(D;E) is uniformly equicontinuous (Remark 6. 5) and E is totally bounded, the Ascoli Theorem tells us that NEX(D;E) is totally bounded with respect to the uniformity of uniform convergence in all totally bounded subsets of D, see e.g. [3], Theorem 2 in Chapter X.2.5. Since D is totally bounded, this uniformity coincides with the uniformity of uniform convergence. But the latter is the pop uniformity (Proposition 6.1) We also give an elementary proof: Due to Proposition 2.7 in [10] Proposition 2.9 in [11] it suffices to show ....

N. Bourbaki. General Topology. Elements of Mathematics. Hermann, Paris, 1966.

....in this case the Lawson topology of (D; coincides with the F topology (Theorem 4.3) Also, we obtain that FS domains appear precisely as compact approximating F posets with least element (Corollary 4. 6) The usual definitions concerning uniformities and topologies can be found e.g. in Bourbaki [2] and Kelley [10] Further, for a survey on domain theory the reader is referred to Abramsky and Jung [1] 2 Definition and basic properties of F posets 3 2 Definition and basic properties of F posets Let us begin by recalling basic notation. We define topologies by means of open sets. If not ....

....are assumed. For a topological space (X; let A denote the closure of the subset A X. Sometimes we also write A to make clear with respect to which topology we take the closure. If a net (x n ) n2N of X converges to some x 2 X, then we write (x n ) n2N Gamma x. Following Bourbaki [2] and Kelley [10] a uniformity U on a set X is a filter on X 2 , whose elements are called entourages, with the following properties: 1) id X U for all U 2 U . 2) U Gamma1 : f(y; x) j (x; y) 2 Ug 2 U for all U 2 U . 3) For all U 2 U there is an entourage V 2 U such that V ffi V : f(x; z) ....

Bourbaki, N.: Elements of Mathematics, General Topology, Parts 1 and 2. Hermann, Paris 1966.

....concurrency, and lastly we describe America and Rutten s generalization to standard type equations, and end by giving their equivalent of Scott s inverse limit theorem, this time using metric spaces instead of pre orders. For the metric preliminaries we recommend [Dugundji 66] Willard 70] and [Bourbaki 89] and for the specific ultra metric material [Schikhof 84] 2.2.1 Metric prerequisites We give some basic definitions and theorems that will lay the foundation for the subsequent development. Definition 2.2 A metric space is a pair (M; d) where M is a set and d : M Theta M [0; 1) fulfills ....

....the set of ffl such that there exists points that are precisely ffl apart) viz. that any sharply decreasing sequence of realized distances converges to 0 . We recall some standard properties of closed and open subsets without proof. For an exposition, see any textbook on topology, for instance [Bourbaki 89] or [Dugundji 66] Proposition 2.4 A subset of a metric space is open if every Cauchy sequence that converges to a point within the subset, also shares an element with the subset. 2 It is immediate that a convergent Cauchy sequence that from some point on lies entirely within a closed subset, ....

Bourbaki, N., Elements of Mathematics, General Topology, Springer Verlag 1989.

....[118] in 1850. The first complete proof was given by Hensel [61] in 1888. The normal basis theorem for Galois extension of arbitrary fields was proved by Noether [104] in 1932 and Deuring [40] in 1933. This theorem is included in most algebra textbooks, see for example, Albert [7] Bourbaki [27], Cohn [36] Hungerford [64] Jacobson [69] Lang [78] Redei [112] and van der Waerden [141] For di#erent proofs of the normal basis theorem, see Artin [8] Berger and Reiner [15] Krasner [76] Waterhouse [149] and Childs and Orzech [33] Lenstra [86] generalizes the normal basis theorem to ....

N. Bourbaki, Elements of Mathematics, Algebra II, Chapters 4-7, translated by P.M. Cohn and J. Howie, Springer-Verlag, 1990.

....by elements of the form j ffi F ij (f) Gamma i (f) for f in F i . Then we define lim ffF i g i2I ; fF ij g (i;j)2I ThetaI ;ij g : L i2I F i =V . 82 B Glossary on Graded Rings and Modules In this appendix we cite basic facts on graded rings and modules as found in textbooks, such as [Bou89], NvO82] and [Nor68] Further, because this is rarely found in the literature, we develop for the graded case analogies to standard statements found in algebra textbooks as [AM69] SS88] SS94] or [Row88] Notions: Rings are always rings with 1. By semigroup always a multiplicative semigroup ....

N. Bourbaki. Elements of mathematics. Algebra I. Chapters 1--3. Transl. from the French. 2nd printing. Springer Verlag, 1989.

....above, there is no natural way to define a pseudo metric on D. Instead, we derive a uniformity on D by taking the sets f(d; e) 2 D 2 j p(d) p(e)g (p 2 P) as a basis. We call this uniformity the pop uniformity and the induced topology the pop topology. The reader is referred to Bourbaki [3] and Kelley [15] for the basic concepts of topology and the theory of uniform spaces. The main results of the present paper are devoted to dcpo s (D; admitting a directed set P of projections with range in the set K(D) of compact elements of (D; We call these dcpo s P domains and give ....

Bourbaki, N.: Elements of Mathematics, General Topology, Parts 1 and 2. Hermann, Paris 1966.

....) p i 2 IH; i = 1; 2; ng: Then IH n is a vector space over IH with the usual and IH acting on the left . The row rank of a matrix T over IH, denoted by rank r T , is the dimension of the subspace of IH n spanned by the rows of T (with IH acting on the left ) By Proposition 10 in [Bu] II x10:12, rank c T = rank r T : So we can use rank T to denote either rank c T or rank r T . See Proposition 13 in [Bu] II x10:13 for a proof of the following result: Lemma 1.1: Let A 2 IH m Thetan with rank A = r. Then there exists invertible matrices S and T over IH such that: SAT = ....

....The row rank of a matrix T over IH, denoted by rank r T , is the dimension of the subspace of IH n spanned by the rows of T (with IH acting on the left ) By Proposition 10 in [Bu] II x10:12, rank c T = rank r T : So we can use rank T to denote either rank c T or rank r T . See Proposition 13 in [Bu] II x10:13 for a proof of the following result: Lemma 1.1: Let A 2 IH m Thetan with rank A = r. Then there exists invertible matrices S and T over IH such that: SAT = I r Thetar 0 0 0 : 1:3) In particular, if m = n, then A has rank n if and only if it is invertible. Equation (1.3) ....

Bourbaki, Elements of Mathematics, Algebra, Part I, Addison-Wesley, Reading, MA, 1974.

....spaces, there is no natural way to define a pseudo metric on D. Instead, we derive a uniformity on D by taking the sets f(d; e) 2 D 2 j p(d) p(e)g (p 2 P) as a basis. We call this uniformity the pop uniformity and the induced topology the pop topology. The reader is referred to Bourbaki [3] and Kelley [9] for the basic concepts of topology and the theory of uniform spaces. Now we give a summary of our results. First we characterize all uniformities on a poset that can be induced by a directed set of projections (Theorem 2.4) Moreover, we investigate when the pop uniformity is ....

Bourbaki, N., Elements of Mathematics, General Topology, Parts 1 and 2. Hermann, Paris 1966.

.... satisfying (5) The above proposition shows that an additive L evy process satisfying (V) consists of conditionally completely positive mappings (on C) However, conditionally complete positivity of the I t in general does not imply (V) Next we need the notion of free products of algebras; see [5]. For two algebras C 1 and C 2 we form the vector space C 1 t C 2 = M ffl2A C ffl where A denotes the set consisting of all tuples ffl = ffl 1 ; ffl n ) of finite length n 2 N such that ffl i = 1 or ffl i = 2 and such that for two neighbours ffl i and ffl i 1 we have ffl i 6= ffl ....

Bourbaki, N.: Elements of Mathematics, Algebra, Chap. I-II. Paris: Herman (1973)

....there can be few who made the effort. Indeed, Russell s own intellect, he reports, never quite recovered from the strain of writing it. The idea of practically using these formal logics for real mathematics gradually fell into disrepute. On the other hand a number of authorities such as Bourbaki [3] seem to regard complete formalizability in principle as the ultimate arbiter of correctness. The arrival of the computer is changing this state of affairs, for several reasons. ffl As one relies less on intuition and more on rules of formal manipulation, accuracy in those manipulations becomes ....

N. Bourbaki. Theory of sets. Elements of mathematics. Addison-Wesley, 1968. Translated from French `Th eorie des ensembles' in the series `El ements de math ematique', originally published by Hermann in 1968.

....6= 0 for 2 U 0 and the normalized exponential e ( z) e hz; i l ( for 2 U 0 ; z 2 N 0 C ; 8) is well defined. We use the holomorphy of 7 e ( z) to expand it in a power series in similar to the case corresponding to the construction of one dimensional Appell polynomials [Bo76]. We have in analogy to [AKS93, ADKS94] e ( z) 1 X n=0 1 n d d n e (0; z) where d d n e (0; z) is an n homogeneous continuous polynomial. But since e ( z) is not only G holomorphic but holomorphic we know that e ( z) is also locally bounded. Thus Cauchy s ....

Bourbaki, N. (1976), Elements of mathematics. Functions of a real variable. AddisonWesley.

....emergent combinative hierarchical structure. Moreover, the term object structure cannot be properly understood and defined outside the inductive learning process. 3 Mathematical Structures and their role A group of outstanding French mathematicians, who took the pseudonym of Nicolas Bourbaki [17], contributed significantly to the popularization of mathematical structures whose understanding was emerging during the first half of this century. Presently a mathematical structure, e.g. totally ordered set, group, vector space, topological space, is understood as a set carrier of the ....

.... space, topological space, is understood as a set carrier of the structure together with a set of operations, or relations, defined on it (and or on its power set where the power set is a set of all subsets of the given set) The relations operations are actually specified by means of axioms [17] [18] and describe (axiomatically) the interrelationships among the elements of the carrier set. In other words, mathematical structures, essentially, postulate various kinds of abstract relations among the objects in the set, i.e, one postulates the rules for manipulating, or working with, the ....

[Article contains additional citation context not shown here]

N. Bourbaki (1970). Elements of Mathematics. Algebra, Part I. Addison Wesley, Reading, Massachusetts.

....for 2 U 0 and the normalized exponential e ( z) exp hz; i l ( for 2 U 0 ; z 2 N 0 C ; 3) is well defined. We use the holomorphy of 7 e ( z) to expand it in a power series in similar to the case corresponding to the construction of one dimensional Appell polynomials [Bo76]. We have in analogy to [AKS93] ADKS96] e ( z) 1 X n=0 1 n d d n e (0; z) where d d n e (0; z) is an n homogeneous form polynomial. But since e ( z) is not only G holomorphic but holomorphic we know that 7 e ( z) is also locally bounded. Thus Cauchy s ....

Bourbaki, N. (1976), Elements of mathematics. Functions of a real variable. Addison-Wesley.

....in A # n th roots of unity in k is injective. PROOF. Let n # N, x # A, a # m, and suppose that x n = x a) n = 1. Then 0 = x a) n x n ] a[nx n 1 c] for some c # m. But nx n 1 is a unit, so nx n 1 c is a unit, so a = 0. It is known ([10] 14, #7, Cor. 2 to Prop. 17) that a field finitely generated over its prime subfield (as a field extension) contains only finitely many roots of unity. This also holds for a field finitely generated over Q p . We will need a modest generalization of these statements: Lemma 7.6 Let K be a finitely ....

....Then G(X) is arithmetically linear. Moreover, if n is invertible in #(X, O X ) then the n torsion in G(X) is finite. First we analyze the structure of arithmetically linear abelian groups. Recall that an abelian group H is bounded if nH = 0 for some n # N. It is known [see [15] 11.2 or [10] Ch. VII 2 exercise 12(b) that any bounded abelian group is a direct sum of cyclic groups. Thus one may characterize the bounded abelian groups as those which can be expressed as direct sums of cyclic groups, in which the orders of the summands are bounded. For purposes of this paper, let us say ....

[Article contains additional citation context not shown here]

Bourbaki, N.: Elements of Mathematics (Algebra II, Chapters 4--7), Springer-Verlag (New York), 1990.

....group is a structure which is both a group and a (Hausdorff) topological space, such that the group operations are continuous. It is not hard to see that a topological group has enough structure to make it a uniform space, where addition amounts to a rigid spatial translation . Bourbaki [3] constructs the reals by first giving the rational numbers a topology, regarding this topological group as a uniform space and taking its completion. Although elegant in the context of general work in various mathematical structures, this is too complicated per se for us to emulate. 2.4.3 ....

N. Bourbaki, Elements of mathematics, vol. 3: General Topology, part 1, Hermann 1966.

....6.4 Computational Behavior : 30 7 Future Work and Conclusion 31 1 Introduction 1. 1 Background It is widely believed that we know how to formalize large tracts of classical mathematics namely write in the style of Bourbaki [5] using some version of set theory and fill in all the details. The Journal of Formalized Mathematics publishes results formalized in set theory and checked by the Mizar system. In fact, the topic of state minimization of finite automata has been formalized in Mizar [21] Despite this belief, and ....

N. Bourbaki. Elements of Mathematics, Theory of Sets. Addison-Wesley, Reading, MA, 1968.

....definition can be used in either case. In particular, every definition of a class, familiar in abstract algebra, can be viewed as an ADT specification. 1.4.3. 1 Specification I created algebraic classes for monomials and polynomials based on the characterization found in Lang [Lan84] or Bourbaki [Bou74] of the algebra of polynomials as being a free monoid algebra over the ring of coefficients and the free abelian monoid of indeterminates. An interesting characteristic of this development was the treatment of freeness properties. These freeness properties were viewed as the specifications for ....

....1 and indeterminate exponents as values, and representing a polynomial by an a list with monomials as keys and monomial coefficients as values. I based the ADT specification on the standard abstract mathematical characterization of multivariate polynomials found in say Lang [Lan84] or Bourbaki [Bou74] The characterization defines algebraic structures for the monomials and polynomials over a given set of indeterminates and commutative ring of coefficients: 1. monomials are a free abelian monoid on the indeterminates. 2. polynomials are a free monoid algebra on the commutative ring of ....

Nicolas Bourbaki. Algebra, Part I. Elements of Mathematics. Addison-Wesley, 1974.

....a Mere Engineering Challenge In our view it seems humanly feasible to write mechanical proof checkers for any part of mathematics and to check mechanically any result in mathematics. There has been much doubt cast on the feasibility of formal proofs, even by such respected authorities as Bourbaki [6] But formalized mathematics cannot in practice be written down in full, and therefore we must have confidence in what might be called the common sense of the mathematician . We shall therefore very quickly abandon formalized mathematics . We believe that we have enough practical evidence to ....

N. Bourbaki. Elements of Mathematics. Addison Wesley, Reading, Massachusetts, 1968.

....y Department of Computer Science, Cornell University z Laboratory for Foundations of Computer Science, University of Edinburgh 1 Introduction 1. 1 Background It is widely believed that we know how to formalize large tracts of classical mathematics namely write in the style of Bourbaki [4] using some version of set theory and fill in all the details. Indeed, the Journal of Formalized Mathematics publishes results formalized in set theory and checked by the Mizar system. Despite this belief and the many formalizations accomplished, massive formalization is not a fait accompli; many ....

N. Bourbaki. Elements of Mathematics, Theory of Sets. AddisonWesley, Reading, MA, 1968.

....but a few mechanical rules. Godel [11] But formalized mathematics cannot in practice be written down in full, and therefore we must have confidence in what might be called the common sense of the mathematician . We shall therefore very quickly abandon formalized mathematics . Bourbaki [1] 1. Introduction A formal mathematical proof is a finite sequence of formulas, each element of which is either an axiom or the result of applying one of a fixed set of mechanical rules to previous formulas in the sequence. It is thus possible to write a computer program to check mechanically ....

N. Bourbaki. Elements of Mathematics. Addison Wesley, Reading, Massachusetts, 1968.

No context found.

Bourbaki, N., Elements of Mathematics, General Topology, Springer Verlag 1989.

No context found.

N. Bourbaki. General Topology, part 2, chapter VI, 3, pages 44--53. Elements of Mathematics. Hermann, Paris, 1966.

No context found.

N. Bourbaki, Algebra II, Chapters 4--7, Elements of Mathematics, Springer-Verlag, Berlin, 1990.

No context found.

N. Bourbaki, Elements of Mathematics, Algebra section 4, Hermann and Addison-Wesley, 1973.

No context found.

N. Bourbaki. General Topology. Elements of Mathematics. Hermann, Paris, 1966.

No context found.

Bourbaki, N.: Elements of mathematics, Algebra, Chap. I-III, Herman, Paris (1973).

No context found.

Nicolas Bourbaki, General Topology, part 1, Elements of Mathematics, Addison-Wesley Publishing Company, Reading, Massachusetts, 1966.

No context found.

N. Bourbaki. Elements of Mathematics, Algebra, Volume 1. AddisonWesley, Reading, MA, 1968.

No context found.

N. Bourbaki. Elements of Mathematics. Addison Wesley, Reading, Massachusetts, 1968.

No context found.

N. Bourbaki. Elements of Mathematics, Theory of Sets. Addison-Wesley, Reading, MA, 1968.

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