Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Journals
  3. The Mathematical Gazette
  4. Most cited
Journal Home
Refine listing
Publication date:
Apply   From and To filters

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

Most cited

This page lists all time most cited articles for this title. Please use the publication date filters on the left if you would like to restrict this list to recently published content, for example to articles published in the last three years. The number of times each article was cited is displayed to the right of its title and can be clicked to access a list of all titles this article has been cited by.

Contents

Page 80 of 185

  • Cited by 1
  • Cited by 1

  • Choice of programming language for schools—(2)

  • Ken Johnson
  • Published online by Cambridge University Press:
    01 August 2016, pp. 291-293

  • I would like to offer the following contribution to the discussion on the Choice of programming language for schools which will (I hope) ensue following F. R. Watson's and David Tali's article in the December 1987 Gazette. (lam happy to consider other points of view for publication: Ed.) As the authors observe, if the schools do not have a policy of their own, they may well have one they don't like foisted onto them.

  • Cited by 1
  • Cited by 1

  • [no title]

  • R. M. Whitehouse
  • Published online by Cambridge University Press:
    03 November 2016, p. 75
    • Article
      • You have access
    • PDF
    • Export citation
  • Cited by 1
  • Cited by 1
  • Cited by 1
  • Cited by 1
  • Cited by 1
  • Cited by 1

  • Editorial

  • Published online by Cambridge University Press:
    01 August 2016, p. 207
    • Article
      • You have access
    • PDF
    • Export citation
  • Cited by 1
  • Cited by 1
  • Cited by 1
  • Cited by 1
  • Cited by 1

  • Pseudo-ordered fields

  • Peter Csontos, Christopher L. Morgan, Kenneth Rebman
  • Published online by Cambridge University Press:
    03 November 2016, pp. 195-198

  • A danger in teaching familiar material is oversimplification. In this article, we shall explore an example of this.

    One of the authors observed a colleague (at another institution) introduce his students to the ordering of the real numbers by stating that < is a relation on ℝ which satisfies the following axiom system:

    “For all x, y, z in ℝ:

    1. 1. Exactly one of x = y, x < y, y < x holds.

    2. 2. If x < y and 0 < z, then xz < yz.

    3. 3. If x < y, then x + z < y + z.”

  • Cited by 1
  • Cited by 1
  • Cited by 1
  • Cited by 1
  • Cited by 1

Page 80 of 185