View topic on PhilPapers for more information
Related categories

46 found
Order:
More results on PhilPapers
Material to categorize
  1. Corcoran Reviews Boute’s 2013 Paper “How to Calculate Proofs”.John Corcoran - 2014 - MATHEMATICAL REVIEWS 14:444-555.
    Corcoran reviews Boute’s 2013 paper “How to calculate proofs”. -/- There are tricky aspects to classifying occurrences of variables: is an occurrence of ‘x’ free as in ‘x + 1’, is it bound as in ‘{x: x = 1}’, or is it orthographic as in ‘extra’? The trickiness is compounded failure to employ conventions to separate use of expressions from their mention. The variable occurrence is free in the term ‘x + 1’ but it is orthographic in that term’s quotes (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  2. Automated Theorem Proving and Its Prospects. [REVIEW]Desmond Fearnley-Sander - 1995 - PSYCHE: An Interdisciplinary Journal of Research On Consciousness 2.
    REVIEW OF: Automated Development of Fundamental Mathematical Theories by Art Quaife. (1992: Kluwer Academic Publishers) 271pp. Using the theorem prover OTTER Art Quaife has proved four hundred theorems of von Neumann-Bernays-Gödel set theory; twelve hundred theorems and definitions of elementary number theory; dozens of Euclidean geometry theorems; and Gödel's incompleteness theorems. It is an impressive achievement. To gauge its significance and to see what prospects it offers this review looks closely at the book and the proofs it presents.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  3. Deepening the Automated Search for Gödel's Proofs.Adam Conkey - unknown
    Gödel's incompleteness theorems establish the stunning result that mathematics cannot be fully formalized and, further, that any formal system containing a modicum of number or set theory cannot establish its own consistency. Wilfried Sieg and Clinton Field, in their paper Automated Search for Gödel's Proofs, presented automated proofs of Gödel's theorems at an abstract axiomatic level; they used an appropriate expansion of the strategic considerations that guide the search of the automated theorem prover AProS. The representability conditions that allow the (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  4. Does Gödel's Incompleteness Theorem Prove That Truth Transcends Proof?Joseph Vidal-Rosset - 2006 - In Johan van Benthem, Gerhard Heinzman, M. Rebushi & H. Visser (eds.), The Age of Alternative Logics. Springer. pp. 51--73.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  5. Teaching Proving by Coordinating Aspects of Proofs with Students' Abilities.Annie Selden & John Selden - 2009 - In Despina A. Stylianou, Maria L. Blanton & Eric J. Knuth (eds.), Teaching and Learning Proof Across the Grades: A K-16 Perspective. New York, USA: Routledge. pp. 339--354.
    In this chapter we introduce concepts for analyzing proofs, and for analyzing undergraduate and beginning graduate mathematics students’ proving abilities. We discuss how coordination of these two analyses can be used to improve students’ ability to construct proofs. -/- For this purpose, we need a richer framework for keeping track of students’ progress than the everyday one used by mathematicians. We need to know more than that a particular student can, or cannot, prove theorems by induction or contradiction or can, (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  6. What is Absolute Undecidability?†.Justin Clarke-Doane - 2013 - Noûs 47 (3):467-481.
    It is often alleged that, unlike typical axioms of mathematics, the Continuum Hypothesis (CH) is indeterminate. This position is normally defended on the ground that the CH is undecidable in a way that typical axioms are not. Call this kind of undecidability “absolute undecidability”. In this paper, I seek to understand what absolute undecidability could be such that one might hope to establish that (a) CH is absolutely undecidable, (b) typical axioms are not absolutely undecidable, and (c) if a mathematical (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   5 citations  
Godel's Theorem
  1. Remarks on Wittgenstein, Gödel, Chaitin, Incompleteness, Impossiblity and the Psychological Basis of Science and Mathematics.Michael Richard Starks - 2019 - In Remarks on Impossibility, Incompleteness, Paraconsistency, Undecidability, Randomness, Computability, Paradox, Uncertainty and the Limits of Reason in Chaitin, Wittgenstein, Hofstadter, Wolpert, Doria, da Costa, Godel, Searle, Rodych, Berto, Floyd, Moyal. Las Vegas, NV USA: Reality Press. pp. 24-38.
    It is commonly thought that such topics as Impossibility, Incompleteness, Paraconsistency, Undecidability, Randomness, Computability, Paradox, Uncertainty and the Limits of Reason are disparate scientific physical or mathematical issues having little or nothing in common. I suggest that they are largely standard philosophical problems (i.e., language games) which were resolved by Wittgenstein over 80 years ago. -/- Wittgenstein also demonstrated the fatal error in regarding mathematics or language or our behavior in general as a unitary coherent logical ‘system,’ rather than as (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  2. Proof That Wittgenstein is Correct About Gödel.P. Olcott - manuscript
    When we sum up the results of Gödel's 1931 Incompleteness Theorem by formalizing Wittgenstein’s verbal specification such that this formalization meets Gödel's own sufficiency requirement: ”Every epistemological antinomy can likewise be used for a similar undecidability proof." then we can see that Gödel's famous logic sentence is only unprovable in PA because it is untrue in PA because it specifies the logical equivalence to self contradiction in PA.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  3. Philosophy of Logic – Reexamining the Formalized Notion of Truth.Pete Olcott - manuscript
    Tarski "proved" that there cannot possibly be any correct formalization of the notion of truth entirely on the basis of an insufficiently expressive formal system that was incapable of recognizing and rejecting semantically incorrect expressions of language. -/- The only thing required to eliminate incompleteness, undecidability and inconsistency from formal systems is transforming the formal proofs of symbolic logic to use the sound deductive inference model.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  4. Review of 'The Outer Limits of Reason' by Noson Yanofsky 403p (2013) (Review Revised 2019).Michael Starks - 2019 - In Suicidal Utopian Delusions in the 21st Century -- Philosophy, Human Nature and the Collapse of Civilization -- Articles and Reviews 2006-2019 4th Edition Michael Starks. Las Vegas, NV USA: Reality Press. pp. 299-316.
    I give a detailed review of 'The Outer Limits of Reason' by Noson Yanofsky from a unified perspective of Wittgenstein and evolutionary psychology. I indicate that the difficulty with such issues as paradox in language and math, incompleteness, undecidability, computability, the brain and the universe as computers etc., all arise from the failure to look carefully at our use of language in the appropriate context and hence the failure to separate issues of scientific fact from issues of how language works. (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  5. Wolpert, Chaitin and Wittgenstein on Impossibility, Incompleteness, the Liar Paradox, Theism, the Limits of Computation, a Non-Quantum Mechanical Uncertainty Principle and the Universe as Computer—the Ultimate Theorem in Turing Machine Theory (Revised 2019).Michael Starks - 2019 - In Suicidal Utopian Delusions in the 21st Century -- Philosophy, Human Nature and the Collapse of Civilization -- Articles and Reviews 2006-2019 4th Edition Michael Starks. Las Vegas, NV USA: Reality Press. pp. 294-299.
    I have read many recent discussions of the limits of computation and the universe as computer, hoping to find some comments on the amazing work of polymath physicist and decision theorist David Wolpert but have not found a single citation and so I present this very brief summary. Wolpert proved some stunning impossibility or incompleteness theorems (1992 to 2008-see arxiv dot org) on the limits to inference (computation) that are so general they are independent of the device doing the computation, (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  6. Gödel’s Disjunction: The Scope and Limits of Mathematical Knowledge. [REVIEW]Panu Raatikainen - 2018 - History and Philosophy of Logic 39 (4):401-403.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  7. What is Mathematics: Gödel's Theorem and Around (Edition 2015).Karlis Podnieks - manuscript
    Introduction to mathematical logic, part 2.Textbook for students in mathematical logic and foundations of mathematics. Platonism, Intuition, Formalism. Axiomatic set theory. Around the Continuum Problem. Axiom of Determinacy. Large Cardinal Axioms. Ackermann's Set Theory. First order arithmetic. Hilbert's 10th problem. Incompleteness theorems. Consequences. Connected results: double incompleteness theorem, unsolvability of reasoning, theorem on the size of proofs, diophantine incompleteness, Loeb's theorem, consistent universal statements are provable, Berry's paradox, incompleteness and Chaitin's theorem. Around Ramsey's theorem.
    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. Review of Space, Time, and Number in the Brain. [REVIEW]Carlos Montemayor & Rasmus Grønfeldt Winther - 2015 - Mathematical Intelligencer 37 (2):93-98.
    Albert Einstein once made the following remark about "the world of our sense experiences": "the fact that it is comprehensible is a miracle." (1936, p. 351) A few decades later, another physicist, Eugene Wigner, wondered about the unreasonable effectiveness of mathematics in the natural sciences, concluding his classic article thus: "the miracle of the appropriateness of the language of mathematics for the formulation of the laws of physics is a wonderful gift which we neither understand nor deserve" (1960, p. 14). (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  10. Exploring Randomness.Panu Raatikainen - 2001 - Notices of the AMS 48 (9):992-6.
    Review of "Exploring Randomness" (200) and "The Unknowable" (1999) by Gregory Chaitin.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  11. The Gödel Paradox and Wittgenstein's Reasons.Francesco Berto - 2009 - Philosophia Mathematica 17 (2):208-219.
    An interpretation of Wittgenstein’s much criticized remarks on Gödel’s First Incompleteness Theorem is provided in the light of paraconsistent arithmetic: in taking Gödel’s proof as a paradoxical derivation, Wittgenstein was drawing the consequences of his deliberate rejection of the standard distinction between theory and metatheory. The reasoning behind the proof of the truth of the Gödel sentence is then performed within the formal system itself, which turns out to be inconsistent. It is shown that the features of paraconsistent arithmetics match (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   4 citations  
  12. How to Say Things with Formalisms.David Auerbach - 1992 - In Michael Detlefsen (ed.), Proof, Logic, and Formalization. Routledge. pp. 77--93.
    Recent attention to "self-consistent" (Rosser-style) systems raises anew the question of the proper interpretation of the Gödel Second Incompleteness Theorem and its effect on Hilbert's Program. The traditional rendering and consequence is defended with new arguments justifying the intensional correctness of the derivability conditions.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  13. Intensionality and the Gödel Theorems.David D. Auerbach - 1985 - Philosophical Studies 48 (3):337--51.
    Philosophers of language have drawn on metamathematical results in varied ways. Extensionalist philosophers have been particularly impressed with two, not unrelated, facts: the existence, due to Frege/Tarski, of a certain sort of semantics, and the seeming absence of intensional contexts from mathematical discourse. The philosophical import of these facts is at best murky. Extensionalists will emphasize the success and clarity of the model theoretic semantics; others will emphasize the relative poverty of the mathematical idiom; still others will question the aptness (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   4 citations  
  14. Self-Reference and Gödel's Theorem: A Husserlian Analysis. [REVIEW]Albert Johnstone - 2003 - Husserl Studies 19 (2):131-151.
    A Husserlian phenomenological approach to logic treats concepts in terms of their experiential meaning rather than in terms of reference, sets of individuals, and sentences. The present article applies such an approach in turn to the reasoning operative in various paradoxes: the simple Liar, the complex Liar paradoxes, the Grelling-type paradoxes, and Gödel’s Theorem. It finds that in each case a meaningless statement, one generated by circular definition, is treated as if were meaningful, and consequently as either true or false, (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  15. On the Philosophical Relevance of Gödel's Incompleteness Theorems.Panu Raatikainen - 2005 - Revue Internationale de Philosophie 59 (4):513-534.
    A survey of more philosophical applications of Gödel's incompleteness results.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   5 citations  
Computer Proof
  1. Proofs Are Programs: 19th Century Logic and 21st Century Computing.Philip Wadler - manuscript
    As the 19th century drew to a close, logicians formalized an ideal notion of proof. They were driven by nothing other than an abiding interest in truth, and their proofs were as ethereal as the mind of God. Yet within decades these mathematical abstractions were realized by the hand of man, in the digital stored-program computer. How it came to be recognized that proofs and programs are the same thing is a story that spans a century, a chase with as (...)
    Remove from this list   Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
Undecidability
  1. Proof That Wittgenstein is Correct About Gödel.P. Olcott - manuscript
    When we sum up the results of Gödel's 1931 Incompleteness Theorem by formalizing Wittgenstein’s verbal specification such that this formalization meets Gödel's own sufficiency requirement: ”Every epistemological antinomy can likewise be used for a similar undecidability proof." then we can see that Gödel's famous logic sentence is only unprovable in PA because it is untrue in PA because it specifies the logical equivalence to self contradiction in PA.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  2. Philosophy of Logic – Reexamining the Formalized Notion of Truth.Pete Olcott - manuscript
    Tarski "proved" that there cannot possibly be any correct formalization of the notion of truth entirely on the basis of an insufficiently expressive formal system that was incapable of recognizing and rejecting semantically incorrect expressions of language. -/- The only thing required to eliminate incompleteness, undecidability and inconsistency from formal systems is transforming the formal proofs of symbolic logic to use the sound deductive inference model.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  3. Review of 'The Outer Limits of Reason' by Noson Yanofsky 403p (2013) (Review Revised 2019).Michael Starks - 2019 - In Suicidal Utopian Delusions in the 21st Century -- Philosophy, Human Nature and the Collapse of Civilization -- Articles and Reviews 2006-2019 4th Edition Michael Starks. Las Vegas, NV USA: Reality Press. pp. 299-316.
    I give a detailed review of 'The Outer Limits of Reason' by Noson Yanofsky from a unified perspective of Wittgenstein and evolutionary psychology. I indicate that the difficulty with such issues as paradox in language and math, incompleteness, undecidability, computability, the brain and the universe as computers etc., all arise from the failure to look carefully at our use of language in the appropriate context and hence the failure to separate issues of scientific fact from issues of how language works. (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  4. Pluralism and the Liar.Cory Wright - 2017 - In Bradley Armour-Garb (ed.), Reflections on the Liar. Oxford University Press. pp. 347–373.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  5. What is Mathematics: Gödel's Theorem and Around (Edition 2015).Karlis Podnieks - manuscript
    Introduction to mathematical logic, part 2.Textbook for students in mathematical logic and foundations of mathematics. Platonism, Intuition, Formalism. Axiomatic set theory. Around the Continuum Problem. Axiom of Determinacy. Large Cardinal Axioms. Ackermann's Set Theory. First order arithmetic. Hilbert's 10th problem. Incompleteness theorems. Consequences. Connected results: double incompleteness theorem, unsolvability of reasoning, theorem on the size of proofs, diophantine incompleteness, Loeb's theorem, consistent universal statements are provable, Berry's paradox, incompleteness and Chaitin's theorem. Around Ramsey's theorem.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  6. Wolpert, Chaitin and Wittgenstein on Impossibility, Incompleteness, the Limits of Computation, Theism and the Universe as Computer-the Ultimate Turing Theorem.Michael Starks - 2017 - Philosophy, Human Nature and the Collapse of Civilization Michael Starks 3rd Ed. (2017).
    I have read many recent discussions of the limits of computation and the universe as computer, hoping to find some comments on the amazing work of polymath physicist and decision theorist David Wolpert but have not found a single citation and so I present this very brief summary. Wolpert proved some stunning impossibility or incompleteness theorems (1992 to 2008-see arxiv.org) on the limits to inference (computation) that are so general they are independent of the device doing the computation, and even (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  7. 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  
  8. Three Concepts of Decidability for General Subsets of Uncountable Spaces.Matthew W. Parker - 2003 - Theoretical Computer Science 351 (1):2-13.
    There is no uniquely standard concept of an effectively decidable set of real numbers or real n-tuples. Here we consider three notions: decidability up to measure zero [M.W. Parker, Undecidability in Rn: Riddled basins, the KAM tori, and the stability of the solar system, Phil. Sci. 70(2) (2003) 359–382], which we abbreviate d.m.z.; recursive approximability [or r.a.; K.-I. Ko, Complexity Theory of Real Functions, Birkhäuser, Boston, 1991]; and decidability ignoring boundaries [d.i.b.; W.C. Myrvold, The decision problem for entanglement, in: R.S. (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   3 citations  
  9. The Gödel Paradox and Wittgenstein's Reasons.Francesco Berto - 2009 - Philosophia Mathematica 17 (2):208-219.
    An interpretation of Wittgenstein’s much criticized remarks on Gödel’s First Incompleteness Theorem is provided in the light of paraconsistent arithmetic: in taking Gödel’s proof as a paradoxical derivation, Wittgenstein was drawing the consequences of his deliberate rejection of the standard distinction between theory and metatheory. The reasoning behind the proof of the truth of the Gödel sentence is then performed within the formal system itself, which turns out to be inconsistent. It is shown that the features of paraconsistent arithmetics match (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   4 citations  
  10. Undecidability in Rn: Riddled Basins, the KAM Tori, and the Stability of the Solar System.Matthew W. Parker - 2003 - Philosophy of Science 70 (2):359-382.
    Some have suggested that certain classical physical systems have undecidable long-term behavior, without specifying an appropriate notion of decidability over the reals. We introduce such a notion, decidability in (or d- ) for any measure , which is particularly appropriate for physics and in some ways more intuitive than Ko's (1991) recursive approximability (r.a.). For Lebesgue measure , d- implies r.a. Sets with positive -measure that are sufficiently "riddled" with holes are never d- but are often r.a. This explicates Sommerer (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   3 citations  
Mathematical Proof, Misc
  1. Teaching and Learning Guide for "Explanation in Mathematics: Proofs and Practice".William D'Alessandro - forthcoming - Philosophy Compass.
    This is a teaching and learning guide to accompany "Explanation in Mathematics: Proofs and Practice".
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  2. Explanation in Mathematics: Proofs and Practice.William D'Alessandro - forthcoming - Philosophy Compass.
    Mathematicians distinguish between proofs that explain their results and those that merely prove. This paper explores the nature of explanatory proofs, their role in mathematical practice, and some of the reasons why philosophers should care about them. Among the questions addressed are the following: what kinds of proofs are generally explanatory (or not)? What makes a proof explanatory? Do all mathematical explanations involve proof in an essential way? Are there really such things as explanatory proofs, and if so, how do (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  3. Evidence, Proofs, and Derivations.Andrew Aberdein - forthcoming - ZDM 51 (4).
    The traditional view of evidence in mathematics is that evidence is just proof and proof is just derivation. There are good reasons for thinking that this view should be rejected: it misrepresents both historical and current mathematical practice. Nonetheless, evidence, proof, and derivation are closely intertwined. This paper seeks to tease these concepts apart. It emphasizes the role of argumentation as a context shared by evidence, proofs, and derivations. The utility of argumentation theory, in general, and argumentation schemes, in particular, (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  4. Pluralism and the Liar.Cory Wright - 2017 - In Bradley Armour-Garb (ed.), Reflections on the Liar. Oxford University Press. pp. 347–373.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  5. 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  
  6. Teoria zdań odrzuconych.Urszula Wybraniec-Skardowska - 1969 - Dissertation, Opole University
    This is the PhD dissertation, written under supervision of Professor Jerzy Słupecki, published in the book: U.Wybraniec-Skardowska i Grzegorz Bryll "Z badań nad teorią zdań odrzuconych" ( "Studies of theory of rejected sentences"), Zeszyty Naukowe Wyższej Szkoły Pedagogicznej w Opolu, Seria B: Studia i Monografie nr 22, pp. 5-131. It is the first, original publication on the theory of rejected sentences on which are based, among other, papers: "Theory of rejected propositions. I"and "Theory of rejected propositions II" with Jerzy Słupecki (...)
    Remove from this list   Download  
    Translate
     
     
    Export citation  
     
    Bookmark   2 citations  
  7. An Inquiry Into the Practice of Proving in Low-Dimensional Topology.Silvia De Toffoli & Valeria Giardino - 2015 - In Gabriele Lolli, Giorgio Venturi & Marco Panza (eds.), From Logic to Practice. Zurich, Switzerland: Springer International Publishing. pp. 315-116.
    The aim of this article is to investigate specific aspects connected with visualization in the practice of a mathematical subfield: low-dimensional topology. Through a case study, it will be established that visualization can play an epistemic role. The background assumption is that the consideration of the actual practice of mathematics is relevant to address epistemological issues. It will be shown that in low-dimensional topology, justifications can be based on sequences of pictures. Three theses will be defended. First, the representations used (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   4 citations  
  8. ‘Chasing’ the Diagram—the Use of Visualizations in Algebraic Reasoning.Silvia de Toffoli - 2017 - Review of Symbolic Logic 10 (1):158-186.
    The aim of this article is to investigate the roles of commutative diagrams (CDs) in a specific mathematical domain, and to unveil the reasons underlying their effectiveness as a mathematical notation; this will be done through a case study. It will be shown that CDs do not depict spatial relations, but represent mathematical structures. CDs will be interpreted as a hybrid notation that goes beyond the traditional bipartition of mathematical representations into diagrammatic and linguistic. It will be argued that one (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  9. Affect, Behavioural Schemas and the Proving Process.Annie Selden, John Selden & Kerry McKee - 2010 - International Journal for Mathematical Education in Science and Technology 41 (2):199-215.
    In this largely theoretical article, we discuss the relation between a kind of affect, behavioural schemas and aspects of the proving process. We begin with affect as described in the mathematics education literature, but soon narrow our focus to a particular kind of affect – nonemotional cognitive feelings. We then mention the position of feelings in consciousness because that bears on the kind of data about feelings that students can be expected to be able to report. Next we introduce the (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  10. The Formal Sciences Discover the Philosophers' Stone.James Franklin - 1994 - Studies in History and Philosophy of Science Part A 25 (4):513-533.
    The formal sciences - mathematical as opposed to natural sciences, such as operations research, statistics, theoretical computer science, systems engineering - appear to have achieved mathematically provable knowledge directly about the real world. It is argued that this appearance is correct.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   6 citations  
  11. Forms and Roles of Diagrams in Knot Theory.Silvia De Toffoli & Valeria Giardino - 2014 - Erkenntnis 79 (4):829-842.
    The aim of this article is to explain why knot diagrams are an effective notation in topology. Their cognitive features and epistemic roles will be assessed. First, it will be argued that different interpretations of a figure give rise to different diagrams and as a consequence various levels of representation for knots will be identified. Second, it will be shown that knot diagrams are dynamic by pointing at the moves which are commonly applied to them. For this reason, experts must (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   5 citations  
  12. Le quantificateur effini, la descente infinie et les preuves de consistance de Gauthier. [REVIEW]Richard Zach - 2004 - Philosophiques 31 (1):221-224.
    Internal Logic brings together several threads of Yvon Gauthier's work on the foundations of mathematics and revisits his attempt to, as he puts it, radicalize Hilbert's Program. A radicalization of Hilbert's Program, I take it, is supposed to take Hilberts' finitary viewpoint more seriously than other attempts to salvage Hilbert's Program have. Such a return to the "roots of Hilbert's metamathematical idea" will, so claims Gauthier, enable him to save Hilbert's Program.
    Remove from this list   Download  
    Translate
     
     
    Export citation  
     
    Bookmark   1 citation  
  13. Objectivity Sans Intelligibility. Hermann Weyl's Symbolic Constructivism.Iulian D. Toader - 2011 - Dissertation, University of Notre Dame
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   4 citations  
  14. A Mathematical Model of Aristotle’s Syllogistic.John Corcoran - 1973 - Archiv für Geschichte der Philosophie 55 (2):191-219.
    In the present article we attempt to show that Aristotle's syllogistic is an underlying logiC which includes a natural deductive system and that it isn't an axiomatic theory as had previously been thought. We construct a mathematical model which reflects certain structural aspects of Aristotle's logic. We examine the relation of the model to the system of logic envisaged in scattered parts of Prior and Posterior Analytics. Our interpretation restores Aristotle's reputation as a logician of consummate imagination and skill. Several (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   12 citations