68 ideas
| 17713 | After 1903, Husserl avoids metaphysical commitments [Mares] |
| Full Idea: In Husserl's philosophy after 1903, he is unwilling to commit himself to any specific metaphysical views. | |
| From: Edwin D. Mares (A Priori [2011], 08.2) |
| 17892 | For clear questions posed by reason, reason can also find clear answers [Gödel] |
| Full Idea: I uphold the belief that for clear questions posed by reason, reason can also find clear answers. | |
| From: Kurt Gödel (works [1930]), quoted by Peter Koellner - On the Question of Absolute Undecidability 1.5 | |
| A reaction: [written in 1961] This contradicts the implication normally taken from his much earlier Incompleteness Theorems. |
| 18781 | Inconsistency doesn't prevent us reasoning about some system [Mares] |
| Full Idea: We are able to reason about inconsistent beliefs, stories, and theories in useful and important ways | |
| From: Edwin D. Mares (Negation [2014], 1) |
| 10041 | Impredicative Definitions refer to the totality to which the object itself belongs [Gödel] |
| Full Idea: Impredicative Definitions are definitions of an object by reference to the totality to which the object itself (and perhaps also things definable only in terms of that object) belong. | |
| From: Kurt Gödel (Russell's Mathematical Logic [1944], n 13) |
| 21752 | Prior to Gödel we thought truth in mathematics consisted in provability [Gödel, by Quine] |
| Full Idea: Gödel's proof wrought an abrupt turn in the philosophy of mathematics. We had supposed that truth, in mathematics, consisted in provability. | |
| From: report of Kurt Gödel (On Formally Undecidable Propositions [1931]) by Willard Quine - Forward to Gödel's Unpublished | |
| A reaction: This explains the crisis in the early 1930s, which Tarski's theory appeared to solve. |
| 17751 | Gödel proved the completeness of first order predicate logic in 1930 [Gödel, by Walicki] |
| Full Idea: Gödel proved the completeness of first order predicate logic in his doctoral dissertation of 1930. | |
| From: report of Kurt Gödel (Completeness of Axioms of Logic [1930]) by Michal Walicki - Introduction to Mathematical Logic History E.2.2 |
| 18789 | Intuitionist logic looks best as natural deduction [Mares] |
| Full Idea: Intuitionist logic appears most attractive in the form of a natural deduction system. | |
| From: Edwin D. Mares (Negation [2014], 5.5) |
| 18790 | Intuitionism as natural deduction has no rule for negation [Mares] |
| Full Idea: In intuitionist logic each connective has one introduction and one elimination rule attached to it, but in the classical system we have to add an extra rule for negation. | |
| From: Edwin D. Mares (Negation [2014], 5.5) | |
| A reaction: How very intriguing. Mares says there are other ways to achieve classical logic, but they all seem rather cumbersome. |
| 18787 | Three-valued logic is useful for a theory of presupposition [Mares] |
| Full Idea: One reason for wanting a three-valued logic is to act as a basis of a theory of presupposition. | |
| From: Edwin D. Mares (Negation [2014], 3.1) | |
| A reaction: [He cites Strawson 1950] The point is that you can get a result when the presupposition does not apply, as in talk of the 'present King of France'. |
| 8679 | We perceive the objects of set theory, just as we perceive with our senses [Gödel] |
| Full Idea: We have something like perception of the objects of set theory, shown by the axioms forcing themselves on us as being true. I don't see why we should have less confidence in this kind of perception (i.e. mathematical intuition) than in sense perception. | |
| From: Kurt Gödel (What is Cantor's Continuum Problem? [1964], p.483), quoted by Michčle Friend - Introducing the Philosophy of Mathematics 2.4 | |
| A reaction: A famous strong expression of realism about the existence of sets. It is remarkable how the ingredients of mathematics spread themselves before the mind like a landscape, inviting journeys - but I think that just shows how minds cope with abstractions. |
| 17835 | Gödel show that the incompleteness of set theory was a necessity [Gödel, by Hallett,M] |
| Full Idea: Gödel's incompleteness results of 1931 show that all axiom systems precise enough to satisfy Hilbert's conception are necessarily incomplete. | |
| From: report of Kurt Gödel (On Formally Undecidable Propositions [1931]) by Michael Hallett - Introduction to Zermelo's 1930 paper p.1215 | |
| A reaction: [Hallett italicises 'necessarily'] Hilbert axioms have to be recursive - that is, everything in the system must track back to them. |
| 9942 | Gödel proved the classical relative consistency of the axiom V = L [Gödel, by Putnam] |
| Full Idea: Gödel proved the classical relative consistency of the axiom V = L (which implies the axiom of choice and the generalized continuum hypothesis). This established the full independence of the continuum hypothesis from the other axioms. | |
| From: report of Kurt Gödel (What is Cantor's Continuum Problem? [1964]) by Hilary Putnam - Mathematics without Foundations | |
| A reaction: Gödel initially wanted to make V = L an axiom, but the changed his mind. Maddy has lots to say on the subject. |
| 21716 | In simple type theory the axiom of Separation is better than Reducibility [Gödel, by Linsky,B] |
| Full Idea: In the superior realist and simple theory of types, the place of the axiom of reducibility is not taken by the axiom of classes, Zermelo's Aussonderungsaxiom. | |
| From: report of Kurt Gödel (Russell's Mathematical Logic [1944], p.140-1) by Bernard Linsky - Russell's Metaphysical Logic 6.1 n3 | |
| A reaction: This is Zermelo's Axiom of Separation, but that too is not an axiom of standard ZFC. |
| 18793 | Material implication (and classical logic) considers nothing but truth values for implications [Mares] |
| Full Idea: The problem with material implication, and classical logic more generally, is that it considers only the truth value of formulas in deciding whether to make an implication stand between them. It ignores everything else. | |
| From: Edwin D. Mares (Negation [2014], 7.1) | |
| A reaction: The obvious problem case is conditionals, and relevance is an obvious extra principle that comes to mind. |
| 18784 | In classical logic the connectives can be related elegantly, as in De Morgan's laws [Mares] |
| Full Idea: Among the virtues of classical logic is the fact that the connectives are related to one another in elegant ways that often involved negation. For example, De Morgan's Laws, which involve negation, disjunction and conjunction. | |
| From: Edwin D. Mares (Negation [2014], 2.2) | |
| A reaction: Mares says these enable us to take disjunction or conjunction as primitive, and then define one in terms of the other, using negation as the tool. |
| 9188 | Gödel proved that first-order logic is complete, and second-order logic incomplete [Gödel, by Dummett] |
| Full Idea: Gödel proved the completeness of standard formalizations of first-order logic, including Frege's original one. However, an implication of his famous theorem on the incompleteness of arithmetic is that second-order logic is incomplete. | |
| From: report of Kurt Gödel (works [1930]) by Michael Dummett - The Philosophy of Mathematics 3.1 | |
| A reaction: This must mean that it is impossible to characterise arithmetic fully in terms of first-order logic. In which case we can only characterize the features of abstract reality in general if we employ an incomplete system. We're doomed. |
| 10035 | Mathematical Logic is a non-numerical branch of mathematics, and the supreme science [Gödel] |
| Full Idea: 'Mathematical Logic' is a precise and complete formulation of formal logic, and is both a section of mathematics covering classes, relations, symbols etc, and also a science prior to all others, with ideas and principles underlying all sciences. | |
| From: Kurt Gödel (Russell's Mathematical Logic [1944], p.447) | |
| A reaction: He cites Leibniz as the ancestor. In this database it is referred to as 'theory of logic', as 'mathematical' seems to be simply misleading. The principles of the subject are standardly applied to mathematical themes. |
| 18786 | Excluded middle standardly implies bivalence; attacks use non-contradiction, De M 3, or double negation [Mares] |
| Full Idea: On its standard reading, excluded middle tells us that bivalence holds. To reject excluded middle, we must reject either non-contradiction, or ¬(A∧B) ↔ (¬A∨¬B) [De Morgan 3], or the principle of double negation. All have been tried. | |
| From: Edwin D. Mares (Negation [2014], 2.2) |
| 18780 | Standard disjunction and negation force us to accept the principle of bivalence [Mares] |
| Full Idea: If we treat disjunction in the standard way and take the negation of a statement A to mean that A is false, accepting excluded middle forces us also to accept the principle of bivalence, which is the dictum that every statement is either true or false. | |
| From: Edwin D. Mares (Negation [2014], 1) | |
| A reaction: Mates's point is to show that passively taking the normal account of negation for granted has important implications. |
| 18782 | The connectives are studied either through model theory or through proof theory [Mares] |
| Full Idea: In studying the logical connectives, philosophers of logic typically adopt the perspective of either model theory (givng truth conditions of various parts of the language), or of proof theory (where use in a proof system gives the connective's meaning). | |
| From: Edwin D. Mares (Negation [2014], 1) | |
| A reaction: [compressed] The commonest proof theory is natural deduction, giving rules for introduction and elimination. Mates suggests moving between the two views is illuminating. |
| 10042 | Reference to a totality need not refer to a conjunction of all its elements [Gödel] |
| Full Idea: One may, on good grounds, deny that reference to a totality necessarily implies reference to all single elements of it or, in other words, that 'all' means the same as an infinite logical conjunction. | |
| From: Kurt Gödel (Russell's Mathematical Logic [1944], p.455) |
| 18783 | Many-valued logics lack a natural deduction system [Mares] |
| Full Idea: Many-valued logics do not have reasonable natural deduction systems. | |
| From: Edwin D. Mares (Negation [2014], 1) |
| 18792 | Situation semantics for logics: not possible worlds, but information in situations [Mares] |
| Full Idea: Situation semantics for logics consider not what is true in worlds, but what information is contained in situations. | |
| From: Edwin D. Mares (Negation [2014], 6.2) | |
| A reaction: Since many theoretical physicists seem to think that 'information' might be the most basic concept of a natural ontology, this proposal is obviously rather appealing. Barwise and Perry are the authors of the theory. |
| 10620 | Originally truth was viewed with total suspicion, and only demonstrability was accepted [Gödel] |
| Full Idea: At that time (c.1930) a concept of objective mathematical truth as opposed to demonstrability was viewed with greatest suspicion and widely rejected as meaningless. | |
| From: Kurt Gödel (works [1930]), quoted by Peter Smith - Intro to Gödel's Theorems 28.2 | |
| A reaction: [quoted from a letter] This is the time of Ramsey's redundancy account, and before Tarski's famous paper of 1933. It is also the high point of Formalism, associated with Hilbert. |
| 17886 | The limitations of axiomatisation were revealed by the incompleteness theorems [Gödel, by Koellner] |
| Full Idea: The inherent limitations of the axiomatic method were first brought to light by the incompleteness theorems. | |
| From: report of Kurt Gödel (On Formally Undecidable Propositions [1931]) by Peter Koellner - On the Question of Absolute Undecidability 1.1 |
| 18785 | Consistency is semantic, but non-contradiction is syntactic [Mares] |
| Full Idea: The difference between the principle of consistency and the principle of non-contradiction is that the former must be stated in a semantic metalanguage, whereas the latter is a thesis of logical systems. | |
| From: Edwin D. Mares (Negation [2014], 2.2) |
| 10071 | Second Incompleteness: nice theories can't prove their own consistency [Gödel, by Smith,P] |
| Full Idea: Second Incompleteness Theorem: roughly, nice theories that include enough basic arithmetic can't prove their own consistency. | |
| From: report of Kurt Gödel (On Formally Undecidable Propositions [1931]) by Peter Smith - Intro to Gödel's Theorems 1.5 | |
| A reaction: On the face of it, this sounds less surprising than the First Theorem. Philosophers have often noticed that it seems unlikely that you could use reason to prove reason, as when Descartes just relies on 'clear and distinct ideas'. |
| 19123 | If soundness can't be proved internally, 'reflection principles' can be added to assert soundness [Gödel, by Halbach/Leigh] |
| Full Idea: Gödel showed PA cannot be proved consistent from with PA. But 'reflection principles' can be added, which are axioms partially expressing the soundness of PA, by asserting what is provable. A Global Reflection Principle asserts full soundness. | |
| From: report of Kurt Gödel (On Formally Undecidable Propositions [1931]) by Halbach,V/Leigh,G.E. - Axiomatic Theories of Truth (2013 ver) 1.2 | |
| A reaction: The authors point out that this needs a truth predicate within the language, so disquotational truth won't do, and there is a motivation for an axiomatic theory of truth. |
| 17883 | Gödel's Theorems did not refute the claim that all good mathematical questions have answers [Gödel, by Koellner] |
| Full Idea: Gödel was quick to point out that his original incompleteness theorems did not produce instances of absolute undecidability and hence did not undermine Hilbert's conviction that for every precise mathematical question there is a discoverable answer. | |
| From: report of Kurt Gödel (works [1930]) by Peter Koellner - On the Question of Absolute Undecidability Intro | |
| A reaction: The normal simplistic view among philosophes is that Gödel did indeed decisively refute the optimistic claims of Hilbert. Roughly, whether Hilbert is right depends on which axioms of set theory you adopt. |
| 10621 | Gödel's First Theorem sabotages logicism, and the Second sabotages Hilbert's Programme [Smith,P on Gödel] |
| Full Idea: Where Gödel's First Theorem sabotages logicist ambitions, the Second Theorem sabotages Hilbert's Programme. | |
| From: comment on Kurt Gödel (On Formally Undecidable Propositions [1931]) by Peter Smith - Intro to Gödel's Theorems 36 | |
| A reaction: Neo-logicism (Crispin Wright etc.) has a strategy for evading the First Theorem. |
| 17888 | The undecidable sentence can be decided at a 'higher' level in the system [Gödel] |
| Full Idea: My undecidable arithmetical sentence ...is not at all absolutely undecidable; rather, one can always pass to 'higher' systems in which the sentence in question is decidable. | |
| From: Kurt Gödel (On Formally Undecidable Propositions [1931]), quoted by Peter Koellner - On the Question of Absolute Undecidability 1.1 | |
| A reaction: [a 1931 MS] He says the reals are 'higher' than the naturals, and the axioms of set theory are higher still. The addition of a truth predicate is part of what makes the sentence become decidable. |
| 10038 | A logical system needs a syntactical survey of all possible expressions [Gödel] |
| Full Idea: In order to be sure that new expression can be translated into expressions not containing them, it is necessary to have a survey of all possible expressions, and this can be furnished only by syntactical considerations. | |
| From: Kurt Gödel (Russell's Mathematical Logic [1944], p.448) | |
| A reaction: [compressed] |
| 18062 | Set-theory paradoxes are no worse than sense deception in physics [Gödel] |
| Full Idea: The set-theoretical paradoxes are hardly any more troublesome for mathematics than deceptions of the senses are for physics. | |
| From: Kurt Gödel (What is Cantor's Continuum Problem? [1964], p.271), quoted by Philip Kitcher - The Nature of Mathematical Knowledge 03.4 |
| 10132 | There can be no single consistent theory from which all mathematical truths can be derived [Gödel, by George/Velleman] |
| Full Idea: Gödel's far-reaching work on the nature of logic and formal systems reveals that there can be no single consistent theory from which all mathematical truths can be derived. | |
| From: report of Kurt Gödel (On Formally Undecidable Propositions [1931]) by A.George / D.J.Velleman - Philosophies of Mathematics Ch.8 |
| 10046 | The generalized Continuum Hypothesis asserts a discontinuity in cardinal numbers [Gödel] |
| Full Idea: The generalized Continuum Hypothesis says that there exists no cardinal number between the power of any arbitrary set and the power of the set of its subsets. | |
| From: Kurt Gödel (Russell's Mathematical Logic [1944], p.464) |
| 10868 | The Continuum Hypothesis is not inconsistent with the axioms of set theory [Gödel, by Clegg] |
| Full Idea: Gödel proved that the Continuum Hypothesis was not inconsistent with the axioms of set theory. | |
| From: report of Kurt Gödel (What is Cantor's Continuum Problem? [1964]) by Brian Clegg - Infinity: Quest to Think the Unthinkable Ch.15 |
| 13517 | If set theory is consistent, we cannot refute or prove the Continuum Hypothesis [Gödel, by Hart,WD] |
| Full Idea: Gödel proved that (if set theory is consistent) we cannot refute the continuum hypothesis, and Cohen proved that (if set theory is consistent) we cannot prove it either. | |
| From: report of Kurt Gödel (What is Cantor's Continuum Problem? [1964]) by William D. Hart - The Evolution of Logic 10 |
| 17715 | The truth of the axioms doesn't matter for pure mathematics, but it does for applied [Mares] |
| Full Idea: The epistemological burden of showing that the axioms are true is removed if we are only studying pure mathematics. If, however, we want to look at applied mathematics, then this burden returns. | |
| From: Edwin D. Mares (A Priori [2011], 11.4) | |
| A reaction: One of those really simple ideas that hits the spot. Nice. The most advanced applied mathematics must rest on counting and measuring. |
| 17885 | Gödel eventually hoped for a generalised completeness theorem leaving nothing undecidable [Gödel, by Koellner] |
| Full Idea: Eventually Gödel ...expressed the hope that there might be a generalised completeness theorem according to which there are no absolutely undecidable sentences. | |
| From: report of Kurt Gödel (works [1930]) by Peter Koellner - On the Question of Absolute Undecidability Intro | |
| A reaction: This comes as a bit of a shock to those who associate him with the inherent undecidability of reality. |
| 10614 | The real reason for Incompleteness in arithmetic is inability to define truth in a language [Gödel] |
| Full Idea: The concept of truth of sentences in a language cannot be defined in the language. This is the true reason for the existence of undecidable propositions in the formal systems containing arithmetic. | |
| From: Kurt Gödel (works [1930]), quoted by Peter Smith - Intro to Gödel's Theorems 21.6 | |
| A reaction: [from a letter by Gödel] So they key to Incompleteness is Tarski's observations about truth. Highly significant, as I take it. |
| 3198 | Gödel showed that arithmetic is either incomplete or inconsistent [Gödel, by Rey] |
| Full Idea: Gödel's theorem states that either arithmetic is incomplete, or it is inconsistent. | |
| From: report of Kurt Gödel (On Formally Undecidable Propositions [1931]) by Georges Rey - Contemporary Philosophy of Mind 8.7 |
| 10072 | First Incompleteness: arithmetic must always be incomplete [Gödel, by Smith,P] |
| Full Idea: First Incompleteness Theorem: any properly axiomatised and consistent theory of basic arithmetic must remain incomplete, whatever our efforts to complete it by throwing further axioms into the mix. | |
| From: report of Kurt Gödel (On Formally Undecidable Propositions [1931]) by Peter Smith - Intro to Gödel's Theorems 1.2 | |
| A reaction: This is because it is always possible to formulate a well-formed sentence which is not provable within the theory. |
| 9590 | Arithmetical truth cannot be fully and formally derived from axioms and inference rules [Gödel, by Nagel/Newman] |
| Full Idea: The vast continent of arithmetical truth cannot be brought into systematic order by laying down a fixed set of axioms and rules of inference from which every true mathematical statement can be formally derived. For some this was a shocking revelation. | |
| From: report of Kurt Gödel (On Formally Undecidable Propositions [1931]) by E Nagel / JR Newman - Gödel's Proof VII.C | |
| A reaction: Good news for philosophy, I'd say. The truth cannot be worked out by mechanical procedures, so it needs the subtle and intuitive intelligence of your proper philosopher (Parmenides is the role model) to actually understand reality. |
| 11069 | Gödel's Second says that semantic consequence outruns provability [Gödel, by Hanna] |
| Full Idea: Gödel's Second Incompleteness Theorem says that true unprovable sentences are clearly semantic consequences of the axioms in the sense that they are necessarily true if the axioms are true. So semantic consequence outruns provability. | |
| From: report of Kurt Gödel (On Formally Undecidable Propositions [1931]) by Robert Hanna - Rationality and Logic 5.3 |
| 10118 | First Incompleteness: a decent consistent system is syntactically incomplete [Gödel, by George/Velleman] |
| Full Idea: First Incompleteness Theorem: If S is a sufficiently powerful formal system, then if S is consistent then S is syntactically incomplete. | |
| From: report of Kurt Gödel (On Formally Undecidable Propositions [1931]) by A.George / D.J.Velleman - Philosophies of Mathematics Ch.6 | |
| A reaction: Gödel found a single sentence, effectively saying 'I am unprovable in S', which is neither provable nor refutable in S. |
| 10122 | Second Incompleteness: a decent consistent system can't prove its own consistency [Gödel, by George/Velleman] |
| Full Idea: Second Incompleteness Theorem: If S is a sufficiently powerful formal system, then if S is consistent then S cannot prove its own consistency | |
| From: report of Kurt Gödel (On Formally Undecidable Propositions [1931]) by A.George / D.J.Velleman - Philosophies of Mathematics Ch.6 | |
| A reaction: This seems much less surprising than the First Theorem (though it derives from it). It was always kind of obvious that you couldn't use reason to prove that reason works (see, for example, the Cartesian Circle). |
| 10611 | There is a sentence which a theory can show is true iff it is unprovable [Gödel, by Smith,P] |
| Full Idea: The original Gödel construction gives us a sentence that a theory shows is true if and only if it satisfies the condition of being unprovable-in-that-theory. | |
| From: report of Kurt Gödel (On Formally Undecidable Propositions [1931]) by Peter Smith - Intro to Gödel's Theorems 20.5 |
| 10867 | 'This system can't prove this statement' makes it unprovable either way [Gödel, by Clegg] |
| Full Idea: An approximation of Gödel's Theorem imagines a statement 'This system of mathematics can't prove this statement true'. If the system proves the statement, then it can't prove it. If the statement can't prove the statement, clearly it still can't prove it. | |
| From: report of Kurt Gödel (On Formally Undecidable Propositions [1931]) by Brian Clegg - Infinity: Quest to Think the Unthinkable Ch.15 | |
| A reaction: Gödel's contribution to this simple idea seems to be a demonstration that formal arithmetic is capable of expressing such a statement. |
| 10039 | Some arithmetical problems require assumptions which transcend arithmetic [Gödel] |
| Full Idea: It has turned out that the solution of certain arithmetical problems requires the use of assumptions essentially transcending arithmetic. | |
| From: Kurt Gödel (Russell's Mathematical Logic [1944], p.449) | |
| A reaction: A nice statement of the famous result, from the great man himself, in the plainest possible English. |
| 10043 | Mathematical objects are as essential as physical objects are for perception [Gödel] |
| Full Idea: Classes and concepts may be conceived of as real objects, ..and are as necessary to obtain a satisfactory system of mathematics as physical bodies are necessary for a satisfactory theory of our sense perceptions, with neither case being about 'data'. | |
| From: Kurt Gödel (Russell's Mathematical Logic [1944], p.456) | |
| A reaction: Note that while he thinks real objects are essential for mathematics, be may not be claiming the same thing for our knowledge of logic. If logic contains no objects, then how could mathematics be reduced to it, as in logicism? |
| 10271 | Basic mathematics is related to abstract elements of our empirical ideas [Gödel] |
| Full Idea: Evidently the 'given' underlying mathematics is closely related to the abstract elements contained in our empirical ideas. | |
| From: Kurt Gödel (What is Cantor's Continuum Problem? [1964], Suppl) | |
| A reaction: Yes! The great modern mathematical platonist says something with which I can agree. He goes on to hint at a platonic view of the structure of the empirical world, but we'll let that pass. |
| 17716 | Mathematics is relations between properties we abstract from experience [Mares] |
| Full Idea: Aristotelians treat mathematical facts as relations between properties. These properties, moreover, are abstracted from our experience of things. ...This view finds a natural companion in structuralism. | |
| From: Edwin D. Mares (A Priori [2011], 11.7) | |
| A reaction: This is the view of mathematics that I personally favour. The view that we abstract 'five' from a group of five pebbles is too simplistic, but this is the right general approach. |
| 8628 | I hold that algebra and number are developments of logic [Jevons] |
| Full Idea: I hold that algebra is a highly developed logic, and number but logical discrimination. | |
| From: William S. Jevons (The Principles of Science [1879], p.156), quoted by Gottlob Frege - Grundlagen der Arithmetik (Foundations) §15 | |
| A reaction: Thus Frege shows that logicism was an idea that was in the air before he started writing. Riemann's geometry and Boole's logic presumably had some influence here. |
| 18788 | For intuitionists there are not numbers and sets, but processes of counting and collecting [Mares] |
| Full Idea: For the intuitionist, talk of mathematical objects is rather misleading. For them, there really isn't anything that we should call the natural numbers, but instead there is counting. What intuitionists study are processes, such as counting and collecting. | |
| From: Edwin D. Mares (Negation [2014], 5.1) | |
| A reaction: That is the first time I have seen mathematical intuitionism described in a way that made it seem attractive. One might compare it to a metaphysics based on processes. Apparently intuitionists struggle with infinite sets and real numbers. |
| 10045 | Impredicative definitions are admitted into ordinary mathematics [Gödel] |
| Full Idea: Impredicative definitions are admitted into ordinary mathematics. | |
| From: Kurt Gödel (Russell's Mathematical Logic [1944], p.464) | |
| A reaction: The issue is at what point in building an account of the foundations of mathematics (if there be such, see Putnam) these impure definitions should be ruled out. |
| 8747 | Realists are happy with impredicative definitions, which describe entities in terms of other existing entities [Gödel, by Shapiro] |
| Full Idea: Gödel defended impredicative definitions on grounds of ontological realism. From that perspective, an impredicative definition is a description of an existing entity with reference to other existing entities. | |
| From: report of Kurt Gödel (On Formally Undecidable Propositions [1931]) by Stewart Shapiro - Thinking About Mathematics 5.3 | |
| A reaction: This is why constructivists must be absolutely precise about definition, where realists only have to do their best. Compare building a car with painting a landscape. |
| 17703 | Light in straight lines is contingent a priori; stipulated as straight, because they happen to be so [Mares] |
| Full Idea: It seems natural to claim that light rays moving in straight lines is contingent but a priori. Scientists stipulate that they are the standard by which we measure straightness, but their appropriateness for this task is a contingent feature of the world. | |
| From: Edwin D. Mares (A Priori [2011], 02.9) | |
| A reaction: This resembles the metre rule in Paris. It is contingent that something is a certain way, so we make being that way a conventional truth, which can therefore be known via the convention, rather than via the contingent fact. |
| 17714 | Aristotelians dislike the idea of a priori judgements from pure reason [Mares] |
| Full Idea: Aristotelians tend to eschew talk about a special faculty of pure reason that is responsible for all of our a priori judgements. | |
| From: Edwin D. Mares (A Priori [2011], 08.9) | |
| A reaction: He is invoking Carrie Jenkins's idea that the a priori is knowledge of relations between concepts which have been derived from experience. Nice idea. We thus have an empirical a priori, integrated into the natural world. Abstraction must be involved. |
| 17705 | Empiricists say rationalists mistake imaginative powers for modal insights [Mares] |
| Full Idea: Empiricist critiques of rationalism often accuse rationalists of confusing the limits of their imaginations with real insight into what is necessarily true. | |
| From: Edwin D. Mares (A Priori [2011], 03.01) | |
| A reaction: See ideas on 'Conceivable as possible' for more on this. You shouldn't just claim to 'see' that something is true, but be willing to offer some sort of reason, truthmaker or grounding. Without that, you may be right, but you are on weak ground. |
| 17700 | The most popular view is that coherent beliefs explain one another [Mares] |
| Full Idea: In what is perhaps the most popular version of coherentism, a system of beliefs is a set of beliefs that explain one another. | |
| From: Edwin D. Mares (A Priori [2011], 01.5) | |
| A reaction: These seems too simple. My first response would be that explanations are what result from coherence sets of beliefs. I may have beliefs that explain nothing, but at least have the virtue of being coherent. |
| 17704 | Operationalism defines concepts by our ways of measuring them [Mares] |
| Full Idea: The central claim of Percy Bridgman's theory of operational definitions (1920s), is that definitions of certain scientific concepts are given by the ways that we have to measure them. For example, a straight line is 'the path of a light ray'. | |
| From: Edwin D. Mares (A Priori [2011], 02.9) | |
| A reaction: It is often observed that this captures the spirit of Special Relativity. |
| 3192 | Basic logic can be done by syntax, with no semantics [Gödel, by Rey] |
| Full Idea: Gödel in his completeness theorem for first-order logic showed that a certain set of syntactically specifiable rules was adequate to capture all first-order valid arguments. No semantics (e.g. reference, truth, validity) was necessary. | |
| From: report of Kurt Gödel (On Formally Undecidable Propositions [1931]) by Georges Rey - Contemporary Philosophy of Mind 8.2 | |
| A reaction: This implies that a logic machine is possible, but we shouldn't raise our hopes for proper rationality. Validity can be shown for purely algebraic arguments, but rationality requires truth as well as validity, and that needs propositions and semantics. |
| 17710 | Aristotelian justification uses concepts abstracted from experience [Mares] |
| Full Idea: Aristotelian justification is the process of reasoning using concepts that are abstracted from experience (rather than, say, concepts that are innate or those that we associate with the meanings of words). | |
| From: Edwin D. Mares (A Priori [2011], 08.1) | |
| A reaction: See Carrie Jenkins for a full theory along these lines (though she doesn't mention Aristotle). This is definitely my preferred view of concepts. |
| 17706 | The essence of a concept is either its definition or its conceptual relations? [Mares] |
| Full Idea: In the 'classical theory' a concept includes in it those concepts that define it. ...In the 'theory theory' view the content of a concept is determined by its relationship to other concepts. | |
| From: Edwin D. Mares (A Priori [2011], 03.10) | |
| A reaction: Neither of these seem to give an intrinsic account of a concept, or any account of how the whole business gets off the ground. |
| 18791 | In 'situation semantics' our main concepts are abstracted from situations [Mares] |
| Full Idea: In 'situation semantics' individuals, properties, facts, and events are treated as abstractions from situations. | |
| From: Edwin D. Mares (Negation [2014], 6.1) | |
| A reaction: [Barwise and Perry 1983 are cited] Since I take the process of abstraction to be basic to thought, I am delighted to learn that someone has developed a formal theory based on it. I am immediately sympathetic to situation semantics. |
| 17701 | Possible worlds semantics has a nice compositional account of modal statements [Mares] |
| Full Idea: Possible worlds semantics is appealing because it gives a compositional analysis of the truth conditions of statements about necessity and possibility. | |
| From: Edwin D. Mares (A Priori [2011], 02.2) | |
| A reaction: Not sure I get this. Is the meaning composed by the gradual addition of worlds? If not, how is meaning composed in the normal way, from component words and phrases? |
| 17702 | Unstructured propositions are sets of possible worlds; structured ones have components [Mares] |
| Full Idea: An unstructured proposition is a set of possible worlds. ....Structured propositions contain entities that correspond to various parts of the sentences or thoughts that express them. | |
| From: Edwin D. Mares (A Priori [2011], 02.3) | |
| A reaction: I am definitely in favour of structured propositions. It strikes me as so obvious as to be not worth discussion - so I am obviously missing something here. Mares says structured propositions are 'more convenient'. |
| 17708 | Maybe space has points, but processes always need regions with a size [Mares] |
| Full Idea: One theory is that space is made up of dimensionless points, but physical processes cannot take place in regions of less than a certain size. | |
| From: Edwin D. Mares (A Priori [2011], 06.7) | |
| A reaction: Thinkers in sympathy with verificationism presumably won't like this, and may prefer Feynman's view. |