4:00 P.m., F Sep 20

Abstract

There are many familiar theorems whose proofs use methods which are in some appropriate sense substantially more "abstract" than its statement. Some particularly well known examples come from the use of complex variables in number theory. Sometimes such abstraction can be removed - for example by the "elementary proof of the prime number theorem" - and sometimes no appropriate removal is known. The interest in removing abstraction typically varies, with no agreed upon criteria for appropriateness. E.g., the removal might sacrifice naturalness or intelligibility, or the result of the removal criticized as being merely a thinly disguised form of the original.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,990

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

Similar books and articles

Generalizing boolos’ theorem.Graham Leach-Krouse - 2017 - Review of Symbolic Logic 10 (1):80-91.
The Limits of Abstraction.Bob Hale - 2006 - Philosophy and Phenomenological Research 72 (1):223-232.
On the philosophical significance of consistency proofs.Michael D. Resnik - 1974 - Journal of Philosophical Logic 3 (1/2):133 - 147.
Nonstandard combinatorics.Joram Hirshfeld - 1988 - Studia Logica 47 (3):221 - 232.
On automating diagrammatic proofs of arithmetic arguments.Mateja Jamnik, Alan Bundy & Ian Green - 1999 - Journal of Logic, Language and Information 8 (3):297-321.
Super-Induction Method.A. Zenkin - 1998 - The Paideia Archive: Twentieth World Congress of Philosophy 8:173-186.

Analytics

Added to PP
2009-01-28

Downloads
61 (#257,611)

6 months
61 (#89,658)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references