Hostname: page-component-77c89778f8-7drxs Total loading time: 0 Render date: 2024-07-24T08:11:18.958Z Has data issue: false hasContentIssue false

Some combinatorial problems of finite abstract algebra

Published online by Cambridge University Press:  20 January 2009

A. R. Richardson
Affiliation:
Universtiy College, Swansea
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

The elements of the abstract number systems termed groups, rings, ideals, modules and algebras are mere symbols arranged in systems by means of consistent and independent postulates which isolate these systems from the complete realm of abstract mathematics. The postulates are usually chosen so as to generalise the special number systems which have been noticed in traditional mathematics and their independence and consistenc}" are usually proved by means of numerical examples. It is suggested in this note that the extents of the consistency and independence of a set of postulates should also be studied

Type
Research Article
Copyright
Copyright © Edinburgh Mathematical Society 1939

References

page 49 note 1 CfBurnside, , Theory of groups (Cambridge 1897), p. 25.Google Scholar

page 49 note 2 CfBurnside, , op. cit., Chapter 6.Google Scholar

page 50 note 1 Ore, O., Trans. Amer. Math. Soc., 41 (1937), 266275.Google Scholar