An Examination of Counterexamples in Proofs and Refutations

Download

index.pdf

Date

2009-10-01

Author

Bağçe, Samet

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

78
views

0
downloads

Lakatos’s seminal work Proofs and Refutations introduced the methods of proofs and refutations by discussing the history and methodological development of Euler’s formula V — E+F = 2 for three dimensional polyhedra. Lakatos considered the history of polyhedra illustrating a good example for his philosophy and methodology of mathematics and geometry. In this study, we focus on the mathematical and topological properties which play a role in Lakatos’s methodological approach. For each example and counterexample given by Lakatos, we briefly outline its topological counterpart. We thus present the mathematical background and basis of Lakatos’s philosophy of mathematical methodology in the case of Euler’s formula, and thereby develop some intuitions about the function of his notions of positive and negative heuristics.

URI

https://hdl.handle.net/11511/39839

Journal

Philosophia Scientae

DOI

https://doi.org/10.4000/philosophiascientiae.228

Collections

Department of Philosophy, Article

Suggestions

OpenMETU
Core

An elementary derivation of the quantum virial theorem from Hellmann-Feynman theorem İpekoğlu, Yusuf; Turgut, Sadi (IOP Publishing, 2016-07-01) A simple proof of the quantum virial theorem that can be used in undergraduate courses is given. The proof proceeds by first showing that the energy eigenvalues of a Hamiltonian remain invariant under a scale transformation. Then invoking the Hellmann-Feynman theorem produces the final statement of the virial theorem.
A geometric approach to absolute irreducibility of polynomials Koyuncu, Fatih; Özbudak, Ferruh; Department of Mathematics (2004) This thesis is a contribution to determine the absolute irreducibility of polynomials via their Newton polytopes. For any field F; a polynomial f in F[x1, x2,..., xk] can be associated with a polytope, called its Newton polytope. If the polynomial f has integrally indecomposable Newton polytope, in the sense of Minkowski sum, then it is absolutely irreducible over F; i.e. irreducible over every algebraic extension of F. We present some new results giving integrally indecomposable classes of polytopes. Conse...
On the arithmetic of fibered surfaces Kaba, Mustafa Devrim; Önsiper, Mustafa Hurşit; Department of Mathematics (2011) In the first three chapters of this thesis we study two conjectures relating arithmetic with geometry, namely Tate and Lang’s conjectures, for a certain class of algebraic surfaces. The surfaces we are interested in are assumed to be defined over a number field, have irregularity two and admit a genus two fibration over an elliptic curve. In the final chapter of the thesis we prove the isomorphism of the Picard motives of an arbitrary variety and its Albanese variety.
On some consequences of the isomorphic classification of cartesian products of locally convex spaces Kızgut, Ersin; Yurdakul, Murat Hayrettin; Department of Mathematics (2016) This thesis takes its motivation from the theory of isomorphic classification of Cartesian products of locally convex spaces which was introduced by V. P. Zahariuta in 1973. In the case $X_1 times X_2 cong Y_1 times Y_2$ for locally convex spaces $X_i$ and $Y_i,i=1,2$; it is proved that if $X_1,Y_2$ and $Y_1,X_2$ are in compact relation in operator sense, it is possible to say that the respective factors of the Cartesian products are also isomorphic, up to their some finite dimensional subspaces. Zahariuta ...
An error analysis of iterated defect correction methods for linear differential-algebraic equations Karasözen, Bülent (1996-01-01) Asymptotic expansions of the global error of iterated defect correction (IDeC) techniques based on the implicit Euler method for linear differential-algebraic equations (dae's) of arbitrary index are analyzed. The dependence of the maximum attainable convergence order on the degree of the interpolating polynomial, number of defect correction steps, and on the index of the differential-algebraic system is given. The efficiency of IDeC method and extrapolation is compared on the basis of numerical experiments...

Citation Formats

S. Bağçe, “An Examination of Counterexamples in Proofs and Refutations,” Philosophia Scientae, pp. 3–20, 2009, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/39839.