59 ideas
| 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. |
| 4643 | The Principle of Sufficient Reason does not presuppose that all explanations will be causal explanations [Baggini /Fosl] |
| Full Idea: The Principle of Sufficient Reason does not presuppose that all explanations will be causal explanations. | |
| From: J Baggini / PS Fosl (The Philosopher's Toolkit [2003], §3.28) | |
| A reaction: This sounds a reasonable note of caution, but doesn't carry much weight unless some type of non-causal reason can be envisaged. God's free will? Our free will? The laws of causation? |
| 4633 | You cannot rationally deny the principle of non-contradiction, because all reasoning requires it [Baggini /Fosl] |
| Full Idea: Anyone who denies the principle of non-contradiction simultaneously affirms it; it cannot be rationally criticised, because it is presupposed by all rationality. | |
| From: J Baggini / PS Fosl (The Philosopher's Toolkit [2003], §1.12) | |
| A reaction: Nietzsche certainly wasn't afraid to ask why we should reject something because it is a contradiction. The 'logic of personal advantage' might allow logical contradictions. |
| 4635 | Dialectic aims at unified truth, unlike analysis, which divides into parts [Baggini /Fosl] |
| Full Idea: Dialectic can be said to aim at wholeness or unity, while 'analytic' thinking divides that with which it deals into parts. | |
| From: J Baggini / PS Fosl (The Philosopher's Toolkit [2003], §2.03) | |
| A reaction: I don't accept this division (linked here to Hegel). I am a fan of analysis, as practised by Aristotle, but it is like dismantling an engine to identify and clean the parts, before reassembling it more efficiently. |
| 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. |
| 4631 | In ideal circumstances, an axiom should be such that no rational agent could possibly object to its use [Baggini /Fosl] |
| Full Idea: In ideal circumstances, an axiom should be such that no rational agent could possibly object to its use. | |
| From: J Baggini / PS Fosl (The Philosopher's Toolkit [2003], §1.09) | |
| A reaction: Yes, but the trouble is that all our notions of 'rational' (giving reasons, being consistent) break down when we look at unsupported axioms. In what sense is something rational if it is self-evident? |
| 4632 | 'Natural' systems of deduction are based on normal rational practice, rather than on axioms [Baggini /Fosl] |
| Full Idea: A 'natural' system of deduction does not posit any axioms, but looks instead for its formulae to the practices of ordinary rationality. | |
| From: J Baggini / PS Fosl (The Philosopher's Toolkit [2003], §1.09) | |
| A reaction: Presumably there is some middle ground, where we attempt to infer the axioms of normal practice, and then build a strict system on them. We must be allowed to criticise 'normal' rationality, I hope. |
| 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 |
| 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. |
| 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. |
| 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. |
| 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. |
| 4638 | The principle of bivalence distorts reality, as when claiming that a person is or is not 'thin' [Baggini /Fosl] |
| Full Idea: Forcing everything into the straightjacket of bivalence seriously distorts the world. The problem is most acute in the case of vague concepts, such as thinness. It is not straightforwardly true or false that a person is thin. | |
| From: J Baggini / PS Fosl (The Philosopher's Toolkit [2003], §3.03) | |
| A reaction: Can't argue with that. Can we divide all our concepts into either bivalent or vague? Presumably both propositions and concepts could be bivalent. |
| 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) |
| 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 |
| 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. |
| 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. |
| 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. |
| 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 |
| 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. |
| 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. |
| 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 |
| 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. |
| 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. |
| 4640 | If identity is based on 'true of X' instead of 'property of X' we get the Masked Man fallacy ('I know X but not Y') [Baggini /Fosl, by PG] |
| Full Idea: The Masked Man fallacy is when Leibniz's Law is taken as 'X and Y are identical if what is true of X is true of Y' (rather than being about properties). Then 'I know X' but 'I don't know Y' (e.g. my friend wearing a mask) would make X and Y non-identical. | |
| From: report of J Baggini / PS Fosl (The Philosopher's Toolkit [2003], §3.17) by PG - Db (ideas) | |
| A reaction: As the book goes on to explain, Descartes is guilty of this when arguing that I necessarily know my mind but not my body, so they are different. Seems to me that Kripke falls into the same trap. |
| 4647 | 'I have the same car as you' is fine; 'I have the same fiancée as you' is not so good [Baggini /Fosl] |
| Full Idea: If you found that I had the same car as you, I don't suppose you would care, but if you found I had the same fiancée as you, you might not be so happy. | |
| From: J Baggini / PS Fosl (The Philosopher's Toolkit [2003], §4.17) | |
| A reaction: A very nice illustration of the ambiguity of "same", and hence of identity. 'I had the same thought as you'. 'I have the same DNA as you'. |
| 4639 | Leibniz's Law is about the properties of objects; the Identity of Indiscernibles is about perception of objects [Baggini /Fosl] |
| Full Idea: Leibniz's Law ('if identical, must have same properties') defines identity according to the properties possessed by the object itself, but the Identity of Indiscernibles defines identity in terms of how things are conceived or grasped by the mind. | |
| From: J Baggini / PS Fosl (The Philosopher's Toolkit [2003], §3.16) | |
| A reaction: This is the heart of the problem of identity. We realists must fight for Leibniz's Law, and escort the Identity of Indiscernibles to the door. |
| 4646 | Is 'events have causes' analytic a priori, synthetic a posteriori, or synthetic a priori? [Baggini /Fosl] |
| Full Idea: Of the proposition that "all experienced events have causes", Descartes says this is analytic a priori, Hume says it is synthetic a posteriori, and Kant says it is synthetic a priori. | |
| From: J Baggini / PS Fosl (The Philosopher's Toolkit [2003], §4.01) | |
| A reaction: I am not sympathetic to Hume on this (though most people think he is right). I prefer the Kantian view, but he makes a very large claim. Something has to be intuitive. |
| 4645 | 'A priori' does not concern how you learn a proposition, but how you show whether it is true or false [Baggini /Fosl] |
| Full Idea: What makes something a priori is not the means by which it came to be known, but the means by which it can be shown to be true or false. | |
| From: J Baggini / PS Fosl (The Philosopher's Toolkit [2003], §4.01) | |
| A reaction: Helpful. Kripke in particular has labelled the notion as an epistemological one, but that does imply a method of acquiring it. Clearly I can learn an a priori truth by reading it the newspaper. |
| 4582 | Basic beliefs are self-evident, or sensual, or intuitive, or revealed, or guaranteed [Baggini /Fosl] |
| Full Idea: Sentence are held to be basic because they are self-evident or 'cataleptic' (Stoics), or rooted in sense data (positivists), or grasped by intuition (Platonists), or revealed by God, or grasped by faculties certified by God (Descartes). | |
| From: J Baggini / PS Fosl (The Philosopher's Toolkit [2003], §1.01) | |
| A reaction: These are a bit blurred. Isn't intuition self-evident? Isn't divine guarantee a type of revelation? How about reason, experience or authority? |
| 3061 | Anaxarchus said that he was not even sure that he knew nothing [Anaxarchus, by Diog. Laertius] |
| Full Idea: Anaxarchus said that he was not even sure that he knew nothing. | |
| From: report of Anaxarchus (fragments/reports [c.340 BCE]) by Diogenes Laertius - Lives of Eminent Philosophers 09.10.1 |
| 4644 | A proposition such as 'some swans are purple' cannot be falsified, only verified [Baggini /Fosl] |
| Full Idea: The problem with falsification is that it fails to work with logically particular claims such as 'some swans are purple'. Examining a million swans and finding no purple ones does not falsify the claim, as there might still be a purple swan out there. | |
| From: J Baggini / PS Fosl (The Philosopher's Toolkit [2003], §3.29) | |
| A reaction: Isn't it beautiful how unease about a theory (Popper's) slowly crystallises into an incredibly simple and devastating point? Maybe 'some swans are purple' isn't science unless there is a good reason to propose it? |
| 4584 | The problem of induction is how to justify our belief in the uniformity of nature [Baggini /Fosl] |
| Full Idea: At its simplest, the problem of induction can be boiled down to the problem of justifying our belief in the uniformity of nature. | |
| From: J Baggini / PS Fosl (The Philosopher's Toolkit [2003], §1.03) | |
| A reaction: An easy solution to the problem of induction: we treat the uniformity of nature as axiomatic, and then induction is all reasoning which is based on that axiom. The axiom is a working hypothesis, which may begin to appear false. Anomalies are hard. |
| 4583 | How can an argument be good induction, but poor deduction? [Baggini /Fosl] |
| Full Idea: The problem of induction is the problem of how an argument can be good reasoning as induction but poor reasoning as deduction. | |
| From: J Baggini / PS Fosl (The Philosopher's Toolkit [2003], §1.03) | |
| A reaction: Nicely put, and a good defence of Hume against the charge that he has just muddled induction and deduction. All reasoning, we insist, should be consistent, or it isn't reasoning. |
| 4634 | Abduction aims at simplicity, testability, coherence and comprehensiveness [Baggini /Fosl] |
| Full Idea: There are some 'principles of selection' in abduction: 1) prefer simple explanations, 2) prefer coherent explanations (consistent with what is already held true), 3) prefer theories that make testable predictions, and 4) be comprehensive in scope. | |
| From: J Baggini / PS Fosl (The Philosopher's Toolkit [2003], §2.01) | |
| A reaction: Note that these are desirable, but not necessary (pace Ockham and Ayer). I cannot think of anything to add to the list, so I will adopt it. Abduction is the key to rationality. |
| 4637 | To see if an explanation is the best, it is necessary to investigate the alternative explanations [Baggini /Fosl] |
| Full Idea: The only way to be sure we have the best explanation is to investigate the alternatives and see if they are any better. | |
| From: J Baggini / PS Fosl (The Philosopher's Toolkit [2003], §3.01) | |
| A reaction: Unavoidable! Since I love 'best explanation', I now seem to be committed to investigation every mad theory that comes up, just in case it is better. I hope I am allowed to reject after a very quick sniff. |
| 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. |
| 4629 | Consistency is the cornerstone of rationality [Baggini /Fosl] |
| Full Idea: Consistency is the cornerstone of rationality. | |
| From: J Baggini / PS Fosl (The Philosopher's Toolkit [2003], §1.06) | |
| A reaction: This is right, and is a cornerstone of Kant's approach to ethics. Rational beings must follow principles - in order to be consistent in their behaviour. 'Consistent' now requires a definition…. |