View topic on PhilPapers for more information
Related categories

86 found
Order:
More results on PhilPapers
1 — 50 / 86
Material to categorize
  1. Functorial Semantics for the Advancement of the Science of Cognition.Venkata Posina, Dhanjoo N. Ghista & Sisir Roy - 2017 - Mind and Matter 15 (2):161{184.
    Cognition involves physical stimulation, neural coding, mental conception, and conscious perception. Beyond the neural coding of physical stimuli, it is not clear how exactly these component processes constitute cognition. Within mathematical sciences, category theory provides tools such as category, functor, and adjointness, which are indispensable in the explication of the mathematical calculations involved in acquiring mathematical knowledge. More speci cally, functorial semantics, in showing that theories and models can be construed as categories and functors, respectively, and in establishing the adjointness (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  2. Foundation of Paralogical Nonstandard Analysis and its Application to Some Famous Problems of Trigonometrical and Orthogonal Series.Jaykov Foukzon - manuscript
    FOURTH EUROPEAN CONGRESS OF MATHEMATICS STOCKHOLM,SWEDEN JUNE27 ­ - JULY 2, 2004 Contributed papers L. Carleson’s celebrated theorem of 1965 [1] asserts the pointwise convergence of the partial Fourier sums of square integrable functions. The Fourier transform has a formulation on each of the Euclidean groups R , Z and Τ .Carleson’s original proof worked on Τ . Fefferman’s proof translates very easily to R . M´at´e [2] extended Carleson’s proof to Z . Each of the statements of the theorem (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  3. On Certain Axiomatizations of Arithmetic of Natural and Integer Numbers.Urszula Wybraniec-Skardowska - 2019 - Axioms 2019 (Deductive Systems).
    The systems of arithmetic discussed in this work are non-elementary theories. In this paper, natural numbers are characterized axiomatically in two di erent ways. We begin by recalling the classical set P of axioms of Peano’s arithmetic of natural numbers proposed in 1889 (including such primitive notions as: set of natural numbers, zero, successor of natural number) and compare it with the set W of axioms of this arithmetic (including the primitive notions like: set of natural numbers and relation of (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  4. Numerical Infinities and Infinitesimals: Methodology, Applications, and Repercussions on Two Hilbert Problems.Yaroslav Sergeyev - 2017 - EMS Surveys in Mathematical Sciences 4 (2):219–320.
    In this survey, a recent computational methodology paying a special attention to the separation of mathematical objects from numeral systems involved in their representation is described. It has been introduced with the intention to allow one to work with infinities and infinitesimals numerically in a unique computational framework in all the situations requiring these notions. The methodology does not contradict Cantor’s and non-standard analysis views and is based on the Euclid’s Common Notion no. 5 “The whole is greater than the (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   2 citations  
  5. Subregular Tetrahedra.John Corcoran - 2008 - Bulletin of Symbolic Logic 14 (3):411-2.
    This largely expository lecture deals with aspects of traditional solid geometry suitable for applications in logic courses. Polygons are plane or two-dimensional; the simplest are triangles. Polyhedra [or polyhedrons] are solid or three-dimensional; the simplest are tetrahedra [or triangular pyramids, made of four triangles]. -/- A regular polygon has equal sides and equal angles. A polyhedron having congruent faces and congruent [polyhedral] angles is not called regular, as some might expect; rather they are said to be subregular—a word coined for (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
Logicism in Mathematics
  1. Неразрешимост на първата теорема за непълнотата. Гьоделова и Хилбертова математика.Vasil Penchev - 2010 - Philosophical Alternatives 19 (5):104-119.
    Can the so-ca\led first incompleteness theorem refer to itself? Many or maybe even all the paradoxes in mathematics are connected with some kind of self-reference. Gбdel built his proof on the ground of self-reference: а statement which claims its unprovabllity. So, he demonstrated that undecidaЬle propositions exist in any enough rich axiomatics (i.e. such one which contains Peano arithmetic in some sense). What about the decidabllity of the very first incompleteness theorem? We can display that it fulfills its conditions. That's (...)
    Remove from this list   Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  2. Hale and Wright on the Metaontology of Neo-Fregeanism.Matti Eklund - 2016 - In Marcus Rossberg & Philip A. Ebert (eds.), Abstractionism.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   2 citations  
  3. Frege on Referentiality and Julius Caesar in Grundgesetze Section 10.Bruno Bentzen - 2019 - Notre Dame Journal of Formal Logic 60 (4):617-637.
    This paper aims to answer the question of whether or not Frege's solution limited to value-ranges and truth-values proposed to resolve the "problem of indeterminacy of reference" in section 10 of Grundgesetze is a violation of his principle of complete determination, which states that a predicate must be defined to apply for all objects in general. Closely related to this doubt is the common allegation that Frege was unable to solve a persistent version of the Caesar problem for value-ranges. It (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  4. The Enhanced Indispensability Argument, the Circularity Problem, and the Interpretability Strategy.Jan Heylen & Lars Arthur Tump - forthcoming - Synthese:1-13.
    Within the context of the Quine–Putnam indispensability argument, one discussion about the status of mathematics is concerned with the ‘Enhanced Indispensability Argument’, which makes explicit in what way mathematics is supposed to be indispensable in science, namely explanatory. If there are genuine mathematical explanations of empirical phenomena, an argument for mathematical platonism could be extracted by using inference to the best explanation. The best explanation of the primeness of the life cycles of Periodical Cicadas is genuinely mathematical, according to Baker (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  5. Tuples All the Way Down?Simon Hewitt - manuscript
    We can introduce singular terms for ordered pairs by means of an abstraction principle. Doing so proves useful for a number of projects in the philosophy of mathematics. However there is a question whether we can appeal to the abstraction principle in good faith, since a version of the Caesar Problem can be generated, posing the worry that abstraction fails to introduce expressions which refer determinately to the requisite sort of object. In this short paper I will pose the difficulty, (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  6. The Physical Impossibility of Machine Computations on Sufficiently Large Integers Inspires an Open Problem That Concerns Abstract Computable Sets X⊆N and Cannot Be Formalized in the Set Theory ZFC as It Refers to Our Current Knowledge on X.Apoloniusz Tyszka & Sławomir Kurpaska - manuscript
    Edmund Landau's conjecture states that the set P(n^2+1) of primes of the form n^2+1 is infinite. Let β=(((24!)!)!)!, and let Φ denote the implication: card(P(n^2+1))<ω ⇒ P(n^2+1)⊆(-∞,β]. We heuristically justify the statement Φ without invoking Landau's conjecture. The set X = {k∈N: (β<k) ⇒ (β,k)∩P(n^2+1) ≠ ∅} satisfies conditions (1)--(4). (1) There are a large number of elements of X and it is conjectured that X is infinite. (2) No known algorithm decides the finiteness/infiniteness of X . (3) There is (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  7. Russell on Logicism and Coherence.Conor Mayo-Wilson - 2011 - Russell: The Journal of Bertrand Russell Studies 31 (1):89-106.
    According to Quine, Charles Parsons, Mark Steiner, and others, Russell's logicist project is important because, if successful, it would show that mathematical theorems possess desirable epistemic properties often attributed to logical theorems, such as a prioricity, necessity, and certainty. Unfortunately, Russell never attributed such importance to logicism, and such a thesis contradicts Russell's explicitly stated views on the relationship between logic and mathematics. This raises the question: what did Russell understand to be the philosophical importance of logicism? Building on recent (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  8. Meaning, Presuppositions, Truth-Relevance, Gödel's Sentence and the Liar Paradox.X. Y. Newberry - manuscript
    Section 1 reviews Strawson’s logic of presuppositions. Strawson’s justification is critiqued and a new justification proposed. Section 2 extends the logic of presuppositions to cases when the subject class is necessarily empty, such as (x)((Px & ~Px) → Qx) . The strong similarity of the resulting logic with Richard Diaz’s truth-relevant logic is pointed out. Section 3 further extends the logic of presuppositions to sentences with many variables, and a certain valuation is proposed. It is noted that, given this valuation, (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  9. Bad Company and Neo-Fregean Philosophy.Matti Eklund - 2009 - Synthese 170 (3):393-414.
    A central element in neo-Fregean philosophy of mathematics is the focus on abstraction principles, and the use of abstraction principles to ground various areas of mathematics. But as is well known, not all abstraction principles are in good standing. Various proposals for singling out the acceptable abstraction principles have been presented. Here I investigate what philosophical underpinnings can be provided for these proposals; specifically, underpinnings that fit the neo-Fregean's general outlook. Among the philosophical ideas I consider are: general views on (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   4 citations  
  10. Subregular Tetrahedra.John Corcoran - 2008 - Bulletin of Symbolic Logic 14 (3):411-2.
    This largely expository lecture deals with aspects of traditional solid geometry suitable for applications in logic courses. Polygons are plane or two-dimensional; the simplest are triangles. Polyhedra [or polyhedrons] are solid or three-dimensional; the simplest are tetrahedra [or triangular pyramids, made of four triangles]. -/- A regular polygon has equal sides and equal angles. A polyhedron having congruent faces and congruent [polyhedral] angles is not called regular, as some might expect; rather they are said to be subregular—a word coined for (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  11. Neo-Logicism and Its Logic.Panu Raatikainen - 2019 - History and Philosophy of Logic 41 (1):82-95.
    The rather unrestrained use of second-order logic in the neo-logicist program is critically examined. It is argued in some detail that it brings with it genuine set-theoretical existence assumptions and that the mathematical power that Hume’s Principle seems to provide, in the derivation of Frege’s Theorem, comes largely from the ‘logic’ assumed rather than from Hume’s Principle. It is shown that Hume’s Principle is in reality not stronger than the very weak Robinson Arithmetic Q. Consequently, only a few rudimentary facts (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   2 citations  
  12. What Do I Know With Certainty?Adekanmi Obasa - 2015 - Thoughts on Paper.
    I was faced with a question I thought I could not answer. -/- What do I know, with certainty? -/- I know with absolute certainty that every thought I have is based on my belief system. My beliefs may change and when they do, my thoughts will be directly related to my belief.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  13. Logicism, Interpretability, and Knowledge of Arithmetic.Sean Walsh - 2014 - Review of Symbolic Logic 7 (1):84-119.
    A crucial part of the contemporary interest in logicism in the philosophy of mathematics resides in its idea that arithmetical knowledge may be based on logical knowledge. Here an implementation of this idea is considered that holds that knowledge of arithmetical principles may be based on two things: (i) knowledge of logical principles and (ii) knowledge that the arithmetical principles are representable in the logical principles. The notions of representation considered here are related to theory-based and structure-based notions of representation (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   6 citations  
  14. Russell: A Guide for the Perplexed.John Ongley & Rosalind Carey - 2013 - Continuum.
    Contents: Introduction / Naïve Logicism / Restricted Logicism / Metaphysics (Early, Middle, Late) / Knowledge (Early, Middle, Late) / Language (Early, Middle, Late) / The Infinite.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  15. Wisdom Mathematics.Nicholas Maxwell - 2010 - Friends of Wisdom Newsletter (6):1-6.
    For over thirty years I have argued that all branches of science and scholarship would have both their intellectual and humanitarian value enhanced if pursued in accordance with the edicts of wisdom-inquiry rather than knowledge-inquiry. I argue that this is true of mathematics. Viewed from the perspective of knowledge-inquiry, mathematics confronts us with two fundamental problems. (1) How can mathematics be held to be a branch of knowledge, in view of the difficulties that view engenders? What could mathematics be knowledge (...)
    Remove from this list   Download  
    Translate
     
     
    Export citation  
     
    Bookmark   1 citation  
  16. Ramified Frege Arithmetic.Richard Heck - 2011 - Journal of Philosophical Logic 40 (6):715-735.
    Øystein Linnebo has recently shown that the existence of successors cannot be proven in predicative Frege arithmetic, using Frege’s definitions of arithmetical notions. By contrast, it is shown here that the existence of successor can be proven in ramified predicative Frege arithmetic.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   7 citations  
  17. A Logic for Frege's Theorem.Richard Heck - 2011 - In Frege’s Theorem: An Introduction. Oxford University Press.
    It has been known for a few years that no more than Pi-1-1 comprehension is needed for the proof of "Frege's Theorem". One can at least imagine a view that would regard Pi-1-1 comprehension axioms as logical truths but deny that status to any that are more complex—a view that would, in particular, deny that full second-order logic deserves the name. Such a view would serve the purposes of neo-logicists. It is, in fact, no part of my view that, say, (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   8 citations  
Formalism in Mathematics
  1. Неразрешимост на първата теорема за непълнотата. Гьоделова и Хилбертова математика.Vasil Penchev - 2010 - Philosophical Alternatives 19 (5):104-119.
    Can the so-ca\led first incompleteness theorem refer to itself? Many or maybe even all the paradoxes in mathematics are connected with some kind of self-reference. Gбdel built his proof on the ground of self-reference: а statement which claims its unprovabllity. So, he demonstrated that undecidaЬle propositions exist in any enough rich axiomatics (i.e. such one which contains Peano arithmetic in some sense). What about the decidabllity of the very first incompleteness theorem? We can display that it fulfills its conditions. That's (...)
    Remove from this list   Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  2. A New Reading and Comparative Interpretation of Gödel’s Completeness (1930) and Incompleteness (1931) Theorems.Vasil Penchev - 2016 - Логико-Философские Штудии 13 (2):187-188.
    Peano arithmetic cannot serve as the ground of mathematics for it is inconsistent to infinity, and infinity is necessary for its foundation. Though Peano arithmetic cannot be complemented by any axiom of infinity, there exists at least one (logical) axiomatics consistent to infinity. That is nothing else than a new reading at issue and comparative interpretation of Gödel’s papers (1930; 1931) meant here. Peano arithmetic admits anyway generalizations consistent to infinity and thus to some addable axiom(s) of infinity. The most (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  3. Self-Graphing Equations.Samuel Alexander - manuscript
    Can you find an xy-equation that, when graphed, writes itself on the plane? This idea became internet-famous when a Wikipedia article on Tupper’s self-referential formula went viral in 2012. Under scrutiny, the question has two flaws: it is meaningless (it depends on fonts) and it is trivial. We fix these flaws by formalizing the problem.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  4. Numbers and Functions in Hilbert's Finitism.Richard Zach - 1998 - Taiwanese Journal for History and Philosophy of Science 10:33-60.
    David Hilbert's finitistic standpoint is a conception of elementary number theory designed to answer the intuitionist doubts regarding the security and certainty of mathematics. Hilbert was unfortunately not exact in delineating what that viewpoint was, and Hilbert himself changed his usage of the term through the 1920s and 30s. The purpose of this paper is to outline what the main problems are in understanding Hilbert and Bernays on this issue, based on some publications by them which have so far received (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   7 citations  
  5. A Case Study of Misconceptions Students in the Learning of Mathematics; The Concept Limit Function in High School.Widodo Winarso & Toheri Toheri - 2017 - Jurnal Riset Pendidikan Matematika 4 (1): 120-127.
    This study aims to find out how high the level and trends of student misconceptions experienced by high school students in Indonesia. The subject of research that is a class XI student of Natural Science (IPA) SMA Negeri 1 Anjatan with the subject matter limit function. Forms of research used in this study is a qualitative research, with a strategy that is descriptive qualitative research. The data analysis focused on the results of the students' answers on the test essay subject (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  6. Laplacian Growth Without Surface Tension in Filtration Combustion: Analytical Pole Solution.Oleg Kupervasser - 2016 - Complexity 21 (5):31-42.
    Filtration combustion is described by Laplacian growth without surface tension. These equations have elegant analytical solutions that replace the complex integro-differential motion equations by simple differential equations of pole motion in a complex plane. The main problem with such a solution is the existence of finite time singularities. To prevent such singularities, nonzero surface tension is usually used. However, nonzero surface tension does not exist in filtration combustion, and this destroys the analytical solutions. However, a more elegant approach exists for (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  7. Hilbert's Program Revisited.Panu Raatikainen - 2003 - Synthese 137 (1):157-177.
    After sketching the main lines of Hilbert's program, certain well-known and influential interpretations of the program are critically evaluated, and an alternative interpretation is presented. Finally, some recent developments in logic related to Hilbert's program are reviewed.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  8. Fourteen Arguments in Favour of a Formalist Philosophy of Real Mathematics.Karlis Podnieks - 2015 - Baltic Journal of Modern Computing 3 (1):1-15.
    The formalist philosophy of mathematics (in its purest, most extreme version) is widely regarded as a “discredited position”. This pure and extreme version of formalism is called by some authors “game formalism”, because it is alleged to represent mathematics as a meaningless game with strings of symbols. Nevertheless, I would like to draw attention to some arguments in favour of game formalism as an appropriate philosophy of real mathematics. For the most part, these arguments have not yet been used or (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  9. Consistency Problem and “Unexpected Hanging Paradox” (An Answering to P=NP Problem).Farzad Didehvar - unknown
    Abstract The Theory of Computation in its existed form is based on Church –Turing Thesis. Throughout this paper, we show that the Turing computation model of this theory leads us to a contradiction. In brief, by applying a well-known paradox (Unexpected hanging paradox) we show a contradiction in the Theory when we consider the Turing model as our Computation model.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  10. Axiomatics and Problematics as Two Modes of Formalisation: Deleuze's Epistemology of Mathematics'.Daniel W. Smith - 2006 - In Simon B. Duffy (ed.), Virtual Mathematics: The Logic of Difference. Clinamen. pp. 145--168.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   2 citations  
  11. Waismann's Critique of Wittgenstein.Anthony Birch - 2007 - Analysis and Metaphysics 6 (2007):263-272.
    Friedrich Waismann, a little-known mathematician and onetime student of Wittgenstein's, provides answers to problems that vexed Wittgenstein in his attempt to explicate the foundations of mathematics through an analysis of its practice. Waismann argues in favor of mathematical intuition and the reality of infinity with a Wittgensteinian twist. Waismann's arguments lead toward an approach to the foundation of mathematics that takes into consideration the language and practice of experts.
    Remove from this list   Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
Intuitionism and Constructivism
  1. A Dilemma for Mathematical Constructivism.Samuel Kahn - 2020 - Axiomathes:01-10.
    In this paper I argue that constructivism in mathematics faces a dilemma. In particular, I maintain that constructivism is unable to explain (i) the application of mathematics to nature and (ii) the intersubjectivity of mathematics unless (iii) it is conjoined with two theses that reduce it to a form of mathematical Platonism. The paper is divided into five sections. In the first section of the paper, I explain the difference between mathematical constructivism and mathematical Platonism and I outline my argument. (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  2. Considerações de Brouwer sobre espaço e infinitude: O idealismo de Brouwer Diante do Problema Apresentado por Dummett Quanto à Possibilidade Teórica de uma Infinitude Espacial.Paulo Júnio de Oliveira - 2019 - Kinesis:94-108.
    Resumo Neste artigo, será discutida a noção de “infinitude cardinal” – a qual seria predicada de um “conjunto” – e a noção de “infinitude ordinal” – a qual seria predicada de um “processo”. A partir dessa distinção conceitual, será abordado o principal problema desse artigo, i.e., o problema da possibilidade teórica de uma infinitude de estrelas tratado por Dummett em sua obra Elements of Intuitionism. O filósofo inglês sugere que, mesmo diante dessa possibilidade teórica, deveria ser possível predicar apenas infinitude (...)
    Remove from this list   Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  3. Indeterminism in Physics, Classical Chaos and Bohmian Mechanics: Are Real Numbers Really Real?Nicolas Gisin - forthcoming - Erkenntnis:1-13.
    It is usual to identify initial conditions of classical dynamical systems with mathematical real numbers. However, almost all real numbers contain an infinite amount of information. I argue that a finite volume of space can’t contain more than a finite amount of information, hence that the mathematical real numbers are not physically relevant. Moreover, a better terminology for the so-called real numbers is “random numbers”, as their series of bits are truly random. I propose an alternative classical mechanics, which is (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  4. Poincaré on the Foundation of Geometry in the Understanding.Jeremy Shipley - 2017 - In Maria Zack & Dirk Schlimm (eds.), Research in History and Philosophy of Mathematics: The CSHPM 2016 Annual Meeting in Calgary, Alberta. Springer. pp. 19-37.
    This paper is about Poincaré’s view of the foundations of geometry. According to the established view, which has been inherited from the logical positivists, Poincaré, like Hilbert, held that axioms in geometry are schemata that provide implicit definitions of geometric terms, a view he expresses by stating that the axioms of geometry are “definitions in disguise.” I argue that this view does not accord well with Poincaré’s core commitment in the philosophy of geometry: the view that geometry is the study (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  5. Logic of Probability and Conjecture.Harry Crane - unknown
    I introduce a formalization of probability which takes the concept of 'evidence' as primitive. In parallel to the intuitionistic conception of truth, in which 'proof' is primitive and an assertion A is judged to be true just in case there is a proof witnessing it, here 'evidence' is primitive and A is judged to be probable just in case there is evidence supporting it. I formalize this outlook by representing propositions as types in Martin-Lof type theory (MLTT) and defining a (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  6. Intuitionistic Logic and its Philosophy.Panu Raatikainen - 2013 - Al-Mukhatabat. A Trilingual Journal For Logic, Epistemology and Analytical Philosophy (6):114-127.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  7. Differential Calculus Based on the Double Contradiction.Kazuhiko Kotani - 2016 - Open Journal of Philosophy 6 (4):420-427.
    The derivative is a basic concept of differential calculus. However, if we calculate the derivative as change in distance over change in time, the result at any instant is 0/0, which seems meaningless. Hence, Newton and Leibniz used the limit to determine the derivative. Their method is valid in practice, but it is not easy to intuitively accept. Thus, this article describes the novel method of differential calculus based on the double contradiction, which is easier to accept intuitively. Next, the (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  8. Wittgenstein And Labyrinth Of ‘Actual Infinity’: The Critique Of Transfinite Set Theory.Valérie Lynn Therrien - 2012 - Ithaque 10:43-65.
    In order to explain Wittgenstein’s account of the reality of completed infinity in mathematics, a brief overview of Cantor’s initial injection of the idea into set- theory, its trajectory and the philosophic implications he attributed to it will be presented. Subsequently, we will first expound Wittgenstein’s grammatical critique of the use of the term ‘infinity’ in common parlance and its conversion into a notion of an actually existing infinite ‘set’. Secondly, we will delve into Wittgenstein’s technical critique of the concept (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   2 citations  
  9. Algumas considerações sobre a noção construtiva de verdade.André Porto & Luiz Pereira - 2003 - O Que Nos Faz Pensar:107-123.
    This paper deals with the recent Swedish proposals of a Intuitionistic notion of Truth, by Dag Prawitz and Per Martin-Löf.
    Remove from this list   Download  
    Translate
     
     
    Export citation  
     
    Bookmark   2 citations  
  10. Natural Topology.Frank Waaldijk - 2012 - Brouwer Society.
    We develop a simple framework called ‘natural topology’, which can serve as a theoretical and applicable basis for dealing with real-world phenomena.Natural topology is tailored to make pointwise and pointfree notions go together naturally. As a constructive theory in BISH, it gives a classical mathematician a faithful idea of important concepts and results in intuitionism. -/- Natural topology is well-suited for practical and computational purposes. We give several examples relevant for applied mathematics, such as the decision-support system Hawk-Eye, and various (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  11. Modal-Epistemic Arithmetic and the Problem of Quantifying In.Jan Heylen - 2013 - Synthese 190 (1):89-111.
    The subject of this article is Modal-Epistemic Arithmetic (MEA), a theory introduced by Horsten to interpret Epistemic Arithmetic (EA), which in turn was introduced by Shapiro to interpret Heyting Arithmetic. I will show how to interpret MEA in EA such that one can prove that the interpretation of EA is MEA is faithful. Moreover, I will show that one can get rid of a particular Platonist assumption. Then I will discuss models for MEA in light of the problems of logical (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   3 citations  
  12. A Formalization of Kant’s Transcendental Logic.Theodora Achourioti & Michiel van Lambalgen - 2011 - Review of Symbolic Logic 4 (2):254-289.
    Although Kant (1998) envisaged a prominent role for logic in the argumentative structure of his Critique of Pure Reason, logicians and philosophers have generally judged Kantgeneralformaltranscendental logics is a logic in the strict formal sense, albeit with a semantics and a definition of validity that are vastly more complex than that of first-order logic. The main technical application of the formalism developed here is a formal proof that Kants logic is after all a distinguished subsystem of first-order logic, namely what (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   3 citations  
  13. Waismann's Critique of Wittgenstein.Anthony Birch - 2007 - Analysis and Metaphysics 6 (2007):263-272.
    Friedrich Waismann, a little-known mathematician and onetime student of Wittgenstein's, provides answers to problems that vexed Wittgenstein in his attempt to explicate the foundations of mathematics through an analysis of its practice. Waismann argues in favor of mathematical intuition and the reality of infinity with a Wittgensteinian twist. Waismann's arguments lead toward an approach to the foundation of mathematics that takes into consideration the language and practice of experts.
    Remove from this list   Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
Predicativism in Mathematics
  1. Logic in the Tractatus.Max Weiss - 2017 - Review of Symbolic Logic 10 (1):1-50.
    I present a reconstruction of the logical system of the Tractatus, which differs from classical logic in two ways. It includes an account of Wittgenstein’s “form-series” device, which suffices to express some effectively generated countably infinite disjunctions. And its attendant notion of structure is relativized to the fixed underlying universe of what is named. -/- There follow three results. First, the class of concepts definable in the system is closed under finitary induction. Second, if the universe of objects is countably (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  2. Cantor’s Proof in the Full Definable Universe.Laureano Luna & William Taylor - 2010 - Australasian Journal of Logic 9:10-25.
    Cantor’s proof that the powerset of the set of all natural numbers is uncountable yields a version of Richard’s paradox when restricted to the full definable universe, that is, to the universe containing all objects that can be defined not just in one formal language but by means of the full expressive power of natural language: this universe seems to be countable on one account and uncountable on another. We argue that the claim that definitional contexts impose restrictions on the (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   3 citations  
  3. On the Self-Predicative Universals of Category Theory.David Ellerman - manuscript
    This paper shows how the universals of category theory in mathematics provide a model (in the Platonic Heaven of mathematics) for the self-predicative strand of Plato's Theory of Forms as well as for the idea of a "concrete universal" in Hegel and similar ideas of paradigmatic exemplars in ordinary thought. The paper also shows how the always-self-predicative universals of category theory provide the "opposite bookend" to the never-self-predicative universals of iterative set theory and thus that the paradoxes arose from having (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  4. Predicative Frege Arithmetic and ‘Everyday’ Mathematics.Richard Heck - 2014 - Philosophia Mathematica 22 (3):279-307.
    The primary purpose of this note is to demonstrate that predicative Frege arithmetic naturally interprets certain weak but non-trivial arithmetical theories. It will take almost as long to explain what this means and why it matters as it will to prove the results.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   3 citations  
1 — 50 / 86