TITLE

The foundations of geometry and the history of geometry

AUTHOR(S)
Gray, Jeremy
PUB. DATE
March 1998
SOURCE
Mathematical Intelligencer;Spring98, Vol. 20 Issue 2, p54
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
Focuses on the history and foundations of geometry. View that Hilbert's `Grundlagen der Geometrie' marks the start of axiomatising mathematics; Problems associated with this view; Contribution of the Italians to projective geometry; Reformulation of geometry as a source of modern logic; Names of various persons that contributed to the development of geometry.
ACCESSION #
517421

 

Related Articles

  • par·al·lel.  // American Heritage Student Science Dictionary;2009, p254 

    The article presents the definition for "parallel," which relates to lines or surfaces that are separated everywhere from each other by the same distance. As a noun, it is any of the imaginary lines encircling the Earth's surface parallel to the plane of the equator, used to represent degrees of...

  • `The bond with reality is cut' - Freudenthal on the foundations of geometry around 1900. Bos, Henk J. M. // Educational Studies in Mathematics;Jul-Sep93, Vol. 25 Issue 1/2, p51 

    Discusses Hans Freudenthal's contribution to the understanding of the development of geometry at the turn of the century and his style in historical research.

  • Fiscal equalisation: Principles and an application to the European Union. Hayo, Bernd; Wrede, Matthias // Social Choice & Welfare;Dec2004, Vol. 23 Issue 3, p333 

    The paper derives a normative model for partial fiscal equalisation based on a number of axioms and makes special allowance for the existence of a specific fiscal need in the jurisdictions. A simple version of this idealised equalisation scheme relates net contributions to the equalisation funds...

  • AN IMPOSSIBILTY RESULT IN AXIOMATIC LOCATION THEORY. Hansen, Pierre; Roberts, Fred S. // Mathematics of Operations Research;Feb96, Vol. 21 Issue 1, p195 

    We show that certain reasonable axioms for an optimal solution to the problem of locating a facility on a network, i.e., axioms of distance determination, Pareto optimality, and anonymity, and a weak Lipschitz condition, can be self-contradictory. In particular, we show that they fail for any...

  • An axiom system for Lingenberg�s metric-Euclidean planes. Pambuccian, Victor // Journal of Geometry;2004, Vol. 81 Issue 1/2, p139 

    We show that Lingenberg�s metric-Euclidean planes are the rectangular planes of Karzel and Stanik which satisfy the axiom �If two of the perpendicular bisectors of a triangle exist, then so does the third�.

  • Axiomatics for power indices that account for player preferences. Shvarts, D. // Automation & Remote Control;Jan2010, Vol. 71 Issue 1, p128 

    We offer a general approach to describing power indices that account for preferences as suggested by F. Aleskerov. We construct two axiomatizations of these indices. Our construction generalizes the Laruelle-Valenciano axioms for Banzhaf (Penrose) and Shapley-Shubik indices. We obtain new sets...

  • On M. T. Calapso�s Characterization of the Metric of an Absolute Plane. Pambuccian, Victor; Struve, Rolf // Journal of Geometry;2009, Vol. 92 Issue 1/2, p105 

    We show that the equivalence of the rectangle existence axiom to an axiom used by Maria Teresa Calapso to characterize the Euclidean metric can be proved inside rather weak, purely metric axiom systems for absolute planes.

  • The Reznichenko property and the Pytkeev property in hyperspaces. Ko�inac, Lj. D. R. // Acta Mathematica Hungarica;May2005, Vol. 107 Issue 3, p225 

    We investigate two closure-type properties, the Reznichenko property and the Pytkeev property, in hyperspace topologies.

  • Upper bounds on complexity of Frege proofs with limited use of certain schemata. Naumov, Pavel // Archive for Mathematical Logic;May2006, Vol. 45 Issue 4, p431 

    The paper considers a commonly used axiomatization of the classical propositional logic and studies how different axiom schemata in this system contribute to proof complexity of the logic. The existence of a polynomial bound on proof complexity of every statement provable in this logic is a...

Share

Read the Article

Courtesy of VIRGINIA BEACH PUBLIC LIBRARY AND SYSTEM

Sign out of this library

Other Topics