92 ideas
| 15357 | Philosophy is the most general intellectual discipline [Horsten] |
| Full Idea: Philosophy is the most general intellectual discipline. | |
| From: Leon Horsten (The Tarskian Turn [2011], 05.1) | |
| A reaction: Very simple, but exactly how I see the subject. It is continuous with the sciences, and tries to give an account of nature, but operating at an extreme level of generality. It must respect the findings of science, but offer bold interpretations. |
| 15352 | A definition should allow the defined term to be eliminated [Horsten] |
| Full Idea: A definition allows a defined term to be eliminated in every context in which it appears. | |
| From: Leon Horsten (The Tarskian Turn [2011], 04.2) | |
| A reaction: To do that, a definition had better be incredibly comprehensive, so that no nice nuance of the original term is thrown out. |
| 9955 | Contextual definitions replace a complete sentence containing the expression [George/Velleman] |
| Full Idea: A contextual definition shows how to analyse an expression in situ, by replacing a complete sentence (of a particular form) in which the expression occurs by another in which it does not. | |
| From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Ch.2) | |
| A reaction: This is a controversial procedure, which (according to Dummett) Frege originally accepted, and later rejected. It might not be the perfect definition that replacing just the expression would give you, but it is a promising step. |
| 10031 | Impredicative definitions quantify over the thing being defined [George/Velleman] |
| Full Idea: When a definition contains a quantifier whose range includes the very entity being defined, the definition is said to be 'impredicative'. | |
| From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Ch.2) | |
| A reaction: Presumably they are 'impredicative' because they do not predicate a new quality in the definiens, but make use of the qualities already known. |
| 10882 | Predicative definitions only refer to entities outside the defined collection [Horsten] |
| Full Idea: Definitions are called 'predicative', and are considered sound, if they only refer to entities which exist independently from the defined collection. | |
| From: Leon Horsten (Philosophy of Mathematics [2007], §2.4) |
| 15324 | Semantic theories of truth seek models; axiomatic (syntactic) theories seek logical principles [Horsten] |
| Full Idea: There are semantical theories of truth, concerned with models for languages containing the truth predicate, and axiomatic (or syntactic) theories, interested in basic logical principles governing the concept of truth. | |
| From: Leon Horsten (The Tarskian Turn [2011], 01.1) | |
| A reaction: This is the map of contemporary debates, which seem now to have given up talking about 'correspondence', 'coherence' etc. |
| 15323 | Truth is a property, because the truth predicate has an extension [Horsten] |
| Full Idea: I take truth to be a property because the truth predicate has an extension - the collection of all true sentences - and this collection does not (unlike the 'extension' of 'exists') consist of everything, or even of all sentences. | |
| From: Leon Horsten (The Tarskian Turn [2011], 01.1) | |
| A reaction: He concedes that it may be an 'uninteresting' property. My problem is always that I am unconvinced that truth is tied to sentences. I can make perfect sense of animal thoughts being right or wrong. Extension of mental propositions? |
| 15374 | Truth has no 'nature', but we should try to describe its behaviour in inferences [Horsten] |
| Full Idea: We should not aim at describing the nature of truth because there is no such thing. Rather, we should aim at describing the inferential behaviour of truth. | |
| From: Leon Horsten (The Tarskian Turn [2011], 10.2.3) |
| 15348 | Propositions have sentence-like structures, so it matters little which bears the truth [Horsten] |
| Full Idea: It makes little difference, at least in extensional contexts, whether the truth bearers are propositions or sentences (or assertions). Even if the bearers are propositions rather than sentences, propositions are structured rather like sentences. | |
| From: Leon Horsten (The Tarskian Turn [2011], 02.4) | |
| A reaction: The 'extensional' context means you are only talking about the things that are referred to, and not about the way this is expressed. I prefer propositions, but this is an interesting point. |
| 15333 | Modern correspondence is said to be with the facts, not with true propositions [Horsten] |
| Full Idea: Modern correspondence theorists no longer take things to correspond to true propositions; they consider facts to be the truthmakers of propositions. | |
| From: Leon Horsten (The Tarskian Turn [2011], 02.1) | |
| A reaction: If we then define facts as the way certain things are, independently from our thinking about it, at least we seem to be avoiding circularity. Not much point in correspondence accounts if you are not a robust realist (like me). [14,000th idea, 23/4/12!] |
| 15337 | The correspondence 'theory' is too vague - about both 'correspondence' and 'facts' [Horsten] |
| Full Idea: The principle difficulty of the correspondence theory of truth is its vagueness. It is too vague to be called a theory until more information is given about what is meant by the terms 'correspondence' and 'fact'. Facts can involve a heavy ontology. | |
| From: Leon Horsten (The Tarskian Turn [2011], 02.1) | |
| A reaction: I see nothing here to make me give up my commitment to the correspondence view of truth, though it sounds as if I will have to give up the word 'theory' in that context. Truth is so obviously about thought fitting reality that there is nothing to discuss. |
| 15334 | The coherence theory allows multiple coherent wholes, which could contradict one another [Horsten] |
| Full Idea: The coherence theory seems too liberal. It seems there can be more than one systematic whole which, while being internally coherent, contradict each other, and thus cannot all be true. Coherence is a necessary but not sufficient condition for truth. | |
| From: Leon Horsten (The Tarskian Turn [2011], 02.1) | |
| A reaction: This is a modern post-Tarski axiomatic truth theorist making very short work indeed of the coherence theory of truth. I take Horsten to be correct. |
| 15336 | The pragmatic theory of truth is relative; useful for group A can be useless for group B [Horsten] |
| Full Idea: The pragmatic theory is unsatisfactory because usefulness is a relative notion. One theory can be useful to group A while being thoroughly impractical for group B. This would make the theory both truth and false. | |
| From: Leon Horsten (The Tarskian Turn [2011], 02.1) | |
| A reaction: This objection, along with the obvious fact that certain falsehoods can be very useful, would seem to rule pragmatism out as a theory of truth. It is, in fact, an abandonment of truth. |
| 15354 | Tarski's hierarchy lacks uniform truth, and depends on contingent factors [Horsten] |
| Full Idea: According to the Tarskian hierarchical conception, truth is not a uniform notion. ...Also Kripke has emphasised that the level of a token of the truth predicate can depend on contingent factors, such as what else has been said by a speaker. | |
| From: Leon Horsten (The Tarskian Turn [2011], 04.5) |
| 15340 | Tarski Bi-conditional: if you'll assert φ you'll assert φ-is-true - and also vice versa [Horsten] |
| Full Idea: The axiom schema 'Sentence "phi;" is true iff φ' is the (unrestricted) Tarski-Biconditional, and is motivated by the thought that if you are willing to assume or outright assert that φ, you will assert that φ is true - and also vice versa. | |
| From: Leon Horsten (The Tarskian Turn [2011], 02.2) | |
| A reaction: Very helpful! Most people are just bewildered by the Tarski bi-conditional ('"Snow is white"...), but this formulation nicely shows its minimal character while showing that it really does say something. It says what truths and truth-claims commit you to. |
| 15345 | Semantic theories have a regress problem in describing truth in the languages for the models [Horsten] |
| Full Idea: Semantic theories give a class of models with a truth predicate, ...but Tarski taught us that this needs a more encompassing framework than its language...so how is the semantics of the framework expressed? The model route has a regress. | |
| From: Leon Horsten (The Tarskian Turn [2011], 02.3) | |
| A reaction: [compressed] So this regress problem, of endless theories of truth going up the hierarchy, is Horsten's main reason for opting for axiomatic theories, which he then tries to strengthen, so that they are not quite so deflated. |
| 15373 | Axiomatic approaches avoid limiting definitions to avoid the truth predicate, and limited sizes of models [Horsten] |
| Full Idea: An adequate definition of truth can only be given for the fragment of our language that does not contain the truth predicate. A model can never encompass the whole of the domain of discourse of our language. The axiomatic approach avoids these problems. | |
| From: Leon Horsten (The Tarskian Turn [2011], 10.1) |
| 15346 | Axiomatic approaches to truth avoid the regress problem of semantic theories [Horsten] |
| Full Idea: The axiomatic approach to truth does not suffer from the regress problem. | |
| From: Leon Horsten (The Tarskian Turn [2011], 02.3) | |
| A reaction: See Idea 15345 for the regress problem. The difficulty then seems to be that axiomatic approaches lack expressive power, so the hunt is on for a set of axioms which will do a decent job. Fun work, if you can cope with it. |
| 15371 | An axiomatic theory needs to be of maximal strength, while being natural and sound [Horsten] |
| Full Idea: The challenge is to find the arithmetically strongest axiomatical truth theory that is both natural and truth-theoretically sound. | |
| From: Leon Horsten (The Tarskian Turn [2011], 07.7) |
| 15332 | 'Reflexive' truth theories allow iterations (it is T that it is T that p) [Horsten] |
| Full Idea: A theory of truth is 'reflexive' if it allows us to prove truth-iterations ("It is true that it is true that so-and-so"). | |
| From: Leon Horsten (The Tarskian Turn [2011], 01.4) |
| 15361 | A good theory of truth must be compositional (as well as deriving biconditionals) [Horsten] |
| Full Idea: Deriving many Tarski-biconditionals is not a sufficient condition for being a good theory of truth. A good theory of truth must in addition do justice to the compositional nature of truth. | |
| From: Leon Horsten (The Tarskian Turn [2011], 06.1) |
| 15350 | The Naďve Theory takes the bi-conditionals as axioms, but it is inconsistent, and allows the Liar [Horsten] |
| Full Idea: The Naďve Theory of Truth collects all the Tarski bi-conditionals of a language and takes them as axioms. But no consistent theory extending Peano arithmetic can prove all of them. It is inconsistent, and even formalises the liar paradox. | |
| From: Leon Horsten (The Tarskian Turn [2011], 03.5.2) | |
| A reaction: [compressed] This looks to me like the account of truth that Davidson was working with, since he just seemed to be compiling bi-conditionals for tricky cases. (Wrong! He championed the Compositional Theory, Horsten p.71) |
| 15351 | Axiomatic theories take truth as primitive, and propose some laws of truth as axioms [Horsten] |
| Full Idea: In the axiomatic approach we take the truth predicate to express an irreducible, primitive notion. The meaning of the truth predicate is partially explicated by proposing certain laws of truth as basic principles, as axioms. | |
| From: Leon Horsten (The Tarskian Turn [2011], 04.2) | |
| A reaction: Judging by Horsten's book, this is a rather fruitful line of enquiry, but it still seems like a bit of a defeat to take truth as 'primitive'. Presumably you could add some vague notion of correspondence as the background picture. |
| 15367 | By adding truth to Peano Arithmetic we increase its power, so truth has mathematical content! [Horsten] |
| Full Idea: It is surprising that just by adding to Peano Arithmetic principles concerning the notion of truth, we increase the mathematical strength of PA. So, contrary to expectations, the 'philosophical' notion of truth has real mathematical content. | |
| From: Leon Horsten (The Tarskian Turn [2011], 06.4) | |
| A reaction: Horsten invites us to be really boggled by this. All of this is in the Compositional Theory TC. It enables a proof of the consistency of arithmetic (but still won't escape Gödel's Second). |
| 15330 | Friedman-Sheard theory keeps classical logic and aims for maximum strength [Horsten] |
| Full Idea: The Friedman-Sheard theory of truth holds onto classical logic and tries to construct a theory that is as strong as possible. | |
| From: Leon Horsten (The Tarskian Turn [2011], 01.4) |
| 15331 | Kripke-Feferman has truth gaps, instead of classical logic, and aims for maximum strength [Horsten] |
| Full Idea: If we abandon classical logic in favour of truth-value gaps and try to strengthen the theory, this leads to the Kripke-Feferman theory of truth, and variants of it. | |
| From: Leon Horsten (The Tarskian Turn [2011], 01.4) |
| 15325 | Inferential deflationism says truth has no essence because no unrestricted logic governs the concept [Horsten] |
| Full Idea: According to 'inferential deflationism', truth is a concept without a nature or an essence. This is betrayed by the fact that there are no unrestricted logical laws that govern the concept of truth. | |
| From: Leon Horsten (The Tarskian Turn [2011], 01.1) |
| 15344 | Deflationism skips definitions and models, and offers just accounts of basic laws of truth [Horsten] |
| Full Idea: Contemporary deflationism about truth does not attempt to define truth, and does not rely on models containing the truth predicate. Instead they are interpretations of axiomatic theories of truth, containing only basic laws of truth. | |
| From: Leon Horsten (The Tarskian Turn [2011], 02.3) |
| 15356 | Deflationism concerns the nature and role of truth, but not its laws [Horsten] |
| Full Idea: Deflationism is not a theory of the laws of truth. It is a view on the nature and role of the concept of truth. | |
| From: Leon Horsten (The Tarskian Turn [2011], 05 Intro) |
| 15368 | This deflationary account says truth has a role in generality, and in inference [Horsten] |
| Full Idea: On the conception of deflationism developed in this book, the prime positive role of the truth predicate is to serve as a device for expressing generalities, and an inferential tool. | |
| From: Leon Horsten (The Tarskian Turn [2011], 07.5) |
| 15358 | Deflationism says truth isn't a topic on its own - it just concerns what is true [Horsten] |
| Full Idea: Deflationism says the theory of truth does not have a substantial domain of its own. The domain of the theory of truth consists of the bearers of truth. | |
| From: Leon Horsten (The Tarskian Turn [2011], 05.1) | |
| A reaction: The immediate thought is that truth also concerns falsehoods, which would be inexplicable without it. If physics just concerns the physical, does that mean that physics lacks its own 'domain'? Generalising about the truths is a topic. |
| 15359 | Deflation: instead of asserting a sentence, we can treat it as an object with the truth-property [Horsten] |
| Full Idea: The Deflationary view just says that instead of asserting a sentence, we can turn the sentence into an object and assert that this object has the property of truth. | |
| From: Leon Horsten (The Tarskian Turn [2011], 05.2.2) | |
| A reaction: That seems to leave a big question hanging, which concerns the nature of the property that is being attributed to this object. Quine 1970:10-13 says it is just a 'device'. Surely you can rest content with that as an account of truth? |
| 15329 | Nonclassical may accept T/F but deny applicability, or it may deny just T or F as well [Horsten] |
| Full Idea: Some nonclassical logic stays close to classical, assuming two mutually exclusive truth values T and F, but some sentences fail to have one. Others have further truth values such as 'half truth', or dialethists allow some T and F at the same time. | |
| From: Leon Horsten (The Tarskian Turn [2011], 01.2) | |
| A reaction: I take that to say that the first lot accept bivalence but reject excluded middle (allowing 'truth value gaps'), while the second lot reject both. Bivalence gives the values available, and excluded middle says what has them. |
| 10098 | The 'power set' of A is all the subsets of A [George/Velleman] |
| Full Idea: The 'power set' of A is all the subsets of A. P(A) = {B : B ⊆ A}. | |
| From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Ch.3) |
| 10099 | The 'ordered pair' <a, b>, for two sets a and b, is the set {{a, b},{a}} [George/Velleman] |
| Full Idea: The 'ordered pair' <a, b>, for two sets a and b, is the set {{a, b},{a}}. The existence of this set is guaranteed by three applications of the Axiom of Pairing. | |
| From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Ch.3) | |
| A reaction: See Idea 10100 for the Axiom of Pairing. |
| 10101 |
Cartesian Product A x B: the set of all ordered pairs |
| Full Idea: The 'Cartesian Product' of any two sets A and B is the set of all ordered pairs <a, b> in which a ∈ A and b ∈ B, and it is denoted as A x B. | |
| From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Ch.3) |
| 10103 | Grouping by property is common in mathematics, usually using equivalence [George/Velleman] |
| Full Idea: The idea of grouping together objects that share some property is a common one in mathematics, ...and the technique most often involves the use of equivalence relations. | |
| From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Ch.3) |
| 10104 | 'Equivalence' is a reflexive, symmetric and transitive relation; 'same first letter' partitions English words [George/Velleman] |
| Full Idea: A relation is an equivalence relation if it is reflexive, symmetric and transitive. The 'same first letter' is an equivalence relation on the set of English words. Any relation that puts a partition into clusters will be equivalence - and vice versa. | |
| From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Ch.3) | |
| A reaction: This is a key concept in the Fregean strategy for defining numbers. |
| 10096 | Even the elements of sets in ZFC are sets, resting on the pure empty set [George/Velleman] |
| Full Idea: ZFC is a theory concerned only with sets. Even the elements of all of the sets studied in ZFC are also sets (whose elements are also sets, and so on). This rests on one clearly pure set, the empty set Φ. ..Mathematics only needs pure sets. | |
| From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Ch.3) | |
| A reaction: This makes ZFC a much more metaphysically comfortable way to think about sets, because it can be viewed entirely formally. It is rather hard to disentangle a chair from the singleton set of that chair. |
| 10097 | Axiom of Extensionality: for all sets x and y, if x and y have the same elements then x = y [George/Velleman] |
| Full Idea: The Axiom of Extensionality says that for all sets x and y, if x and y have the same elements then x = y. | |
| From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Ch.3) | |
| A reaction: This seems fine in pure set theory, but hits the problem of renates and cordates in the real world. The elements coincide, but the axiom can't tell you why they coincide. |
| 10100 | Axiom of Pairing: for all sets x and y, there is a set z containing just x and y [George/Velleman] |
| Full Idea: The Axiom of Pairing says that for all sets x and y, there is a set z containing x and y, and nothing else. In symbols: ∀x∀y∃z∀w(w ∈ z ↔ (w = x ∨ w = y)). | |
| From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Ch.3) | |
| A reaction: See Idea 10099 for an application of this axiom. |
| 17900 | The Axiom of Reducibility made impredicative definitions possible [George/Velleman] |
| Full Idea: The Axiom of Reducibility ...had the effect of making impredicative definitions possible. | |
| From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Ch.3) |
| 10109 | ZFC can prove that there is no set corresponding to the concept 'set' [George/Velleman] |
| Full Idea: Sets, unlike extensions, fail to correspond to all concepts. We can prove in ZFC that there is no set corresponding to the concept 'set' - that is, there is no set of all sets. | |
| From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Ch.4) | |
| A reaction: This is rather an important point for Frege. However, all concepts have extensions, but they may be proper classes, rather than precisely defined sets. |
| 10108 | As a reduction of arithmetic, set theory is not fully general, and so not logical [George/Velleman] |
| Full Idea: The problem with reducing arithmetic to ZFC is not that this theory is inconsistent (as far as we know it is not), but rather that is not completely general, and for this reason not logical. For example, it asserts the existence of sets. | |
| From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Ch.4) | |
| A reaction: Note that ZFC has not been proved consistent. |
| 15326 | Doubt is thrown on classical logic by the way it so easily produces the liar paradox [Horsten] |
| Full Idea: Aside from logic, so little is needed to generate the liar paradox that one wonders whether the laws of classical logic are unrestrictedly valid after all. (Many theories of truth have therefore been formulated in nonclassical logic.) | |
| From: Leon Horsten (The Tarskian Turn [2011], 01.2) | |
| A reaction: Kripke uses Strong Kleene logic for his theory. The implication is that debates discussed by Horsten actually have the status of classical logic at stake, as well as the nature of truth. |
| 15341 | Deduction Theorem: ψ only derivable from φ iff φ→ψ are axioms [Horsten] |
| Full Idea: The Deduction Theorem says ψ is derivable in classical predicate logic from ψ iff the sentence φ→ψ is a theorem of classical logic. Hence inferring φ to ψ is truth-preserving iff the axiom scheme φ→ψ is provable. | |
| From: Leon Horsten (The Tarskian Turn [2011], 02.2) | |
| A reaction: Horsten offers this to show that the Tarski bi-conditionals can themselves be justified, and not just the rule of inference involved. Apparently you can only derive something if you first announce that you have the ability to derive it. Odd. |
| 10111 | Asserting Excluded Middle is a hallmark of realism about the natural world [George/Velleman] |
| Full Idea: A hallmark of our realist stance towards the natural world is that we are prepared to assert the Law of Excluded Middle for all statements about it. For all statements S, either S is true, or not-S is true. | |
| From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Ch.4) | |
| A reaction: Personally I firmly subscribe to realism, so I suppose I must subscribe to Excluded Middle. ...Provided the statement is properly formulated. Or does liking excluded middle lead me to realism? |
| 15328 | A theory is 'non-conservative' if it facilitates new mathematical proofs [Horsten] |
| Full Idea: A theory is 'non-conservative' if it allows us to prove mathematical facts that go beyond what the background mathematical theory can prove on its own. | |
| From: Leon Horsten (The Tarskian Turn [2011], 01.4) | |
| A reaction: This is an instance of the relationship with mathematics being used as the test case for explorations of logic. It is a standard research method, because it is so precise, but should not be mistaken for the last word about a theory. |
| 15349 | It is easier to imagine truth-value gaps (for the Liar, say) than for truth-value gluts (both T and F) [Horsten] |
| Full Idea: It is easier to imagine what it is like for a sentence to lack a truth value than what it is like for a sentence to be both truth and false. So I am grudgingly willing to entertain the possibility that certain sentences (like the Liar) lack a truth value. | |
| From: Leon Horsten (The Tarskian Turn [2011], 02.5) | |
| A reaction: Fans of truth value gluts are dialethists like Graham Priest. I'm with Horsten on this one. But in what way can a sentence be meaningful if it lacks a truth-value? He mentions unfulfilled presuppositions and indicative conditionals as gappy. |
| 15366 | Satisfaction is a primitive notion, and very liable to semantical paradoxes [Horsten] |
| Full Idea: Satisfaction is a more primitive notion than truth, and it is even more susceptible to semantical paradoxes than the truth predicate. | |
| From: Leon Horsten (The Tarskian Turn [2011], 06.3) | |
| A reaction: The Liar is the best known paradox here. Tarski bases his account of truth on this primitive notion, so Horsten is pointing out the difficulties. |
| 10129 | A 'model' is a meaning-assignment which makes all the axioms true [George/Velleman] |
| Full Idea: A 'model' of a theory is an assignment of meanings to the symbols of its language which makes all of its axioms come out true. | |
| From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Ch.7) | |
| A reaction: If the axioms are all true, and the theory is sound, then all of the theorems will also come out true. |
| 10105 | Differences between isomorphic structures seem unimportant [George/Velleman] |
| Full Idea: Mathematicians tend to regard the differences between isomorphic mathematical structures as unimportant. | |
| From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Ch.3) | |
| A reaction: This seems to be a pointer towards Structuralism as the underlying story in mathematics. The intrinsic character of so-called 'objects' seems unimportant. How theories map onto one another (and onto the world?) is all that matters? |
| 10884 | A theory is 'categorical' if it has just one model up to isomorphism [Horsten] |
| Full Idea: If a theory has, up to isomorphism, exactly one model, then it is said to be 'categorical'. | |
| From: Leon Horsten (Philosophy of Mathematics [2007], §5.2) |
| 10119 | Consistency is a purely syntactic property, unlike the semantic property of soundness [George/Velleman] |
| Full Idea: Consistency is a purely syntactic property, unlike the semantic property of soundness. | |
| From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Ch.6) |
| 10126 | A 'consistent' theory cannot contain both a sentence and its negation [George/Velleman] |
| Full Idea: If there is a sentence such that both the sentence and its negation are theorems of a theory, then the theory is 'inconsistent'. Otherwise it is 'consistent'. | |
| From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Ch.7) |
| 10120 | Soundness is a semantic property, unlike the purely syntactic property of consistency [George/Velleman] |
| Full Idea: Soundness is a semantic property, unlike the purely syntactic property of consistency. | |
| From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Ch.6) |
| 10127 | A 'complete' theory contains either any sentence or its negation [George/Velleman] |
| Full Idea: If there is a sentence such that neither the sentence nor its negation are theorems of a theory, then the theory is 'incomplete'. Otherwise it is 'complete'. | |
| From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Ch.7) | |
| A reaction: Interesting questions are raised about undecidable sentences, irrelevant sentences, unknown sentences.... |
| 15353 | The first incompleteness theorem means that consistency does not entail soundness [Horsten] |
| Full Idea: It is a lesson of the first incompleteness theorem that consistency does not entail soundness. If we add the negation of the gödel sentence for PA as an extra axiom to PA, the result is consistent. This negation is false, so the theory is unsound. | |
| From: Leon Horsten (The Tarskian Turn [2011], 04.3) |
| 15355 | Strengthened Liar: 'this sentence is not true in any context' - in no context can this be evaluated [Horsten] |
| Full Idea: The Strengthened Liar sentence says 'this sentence is not true in any context'. It is not hard to figure out that there is no context in which the sentence can be coherently evaluated. | |
| From: Leon Horsten (The Tarskian Turn [2011], 04.6) |
| 10106 | Rational numbers give answers to division problems with integers [George/Velleman] |
| Full Idea: We can think of rational numbers as providing answers to division problems involving integers. | |
| From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Ch.3) | |
| A reaction: Cf. Idea 10102. |
| 10102 | The integers are answers to subtraction problems involving natural numbers [George/Velleman] |
| Full Idea: In defining the integers in set theory, our definition will be motivated by thinking of the integers as answers to subtraction problems involving natural numbers. | |
| From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Ch.3) | |
| A reaction: Typical of how all of the families of numbers came into existence; they are 'invented' so that we can have answers to problems, even if we can't interpret the answers. It it is money, we may say the minus-number is a 'debt', but is it? Cf Idea 10106. |
| 10107 | Real numbers provide answers to square root problems [George/Velleman] |
| Full Idea: One reason for introducing the real numbers is to provide answers to square root problems. | |
| From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Ch.3) | |
| A reaction: Presumably the other main reasons is to deal with problems of exact measurement. It is interesting that there seem to be two quite distinct reasons for introducing the reals. Cf. Ideas 10102 and 10106. |
| 15364 | English expressions are denumerably infinite, but reals are nondenumerable, so many are unnameable [Horsten] |
| Full Idea: The number of English expressions is denumerably infinite. But Cantor's theorem can be used to show that there are nondenumerably many real numbers. So not every real number has a (simple or complex name in English). | |
| From: Leon Horsten (The Tarskian Turn [2011], 06.3) | |
| A reaction: This really bothers me. Are we supposed to be committed to the existence of entities which are beyond our powers of naming? How precise must naming be? If I say 'pick a random real number', might that potentially name all of them? |
| 9946 | Logicists say mathematics is applicable because it is totally general [George/Velleman] |
| Full Idea: The logicist idea is that if mathematics is logic, and logic is the most general of disciplines, one that applies to all rational thought regardless of its content, then it is not surprising that mathematics is widely applicable. | |
| From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Ch.2) | |
| A reaction: Frege was keen to emphasise this. You are left wondering why pure logic is applicable to the physical world. The only account I can give is big-time Platonism, or Pythagoreanism. Logic reveals the engine-room of nature, where the design is done. |
| 10125 | The classical mathematician believes the real numbers form an actual set [George/Velleman] |
| Full Idea: Unlike the intuitionist, the classical mathematician believes in an actual set that contains all the real numbers. | |
| From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Ch.6) |
| 10885 | Computer proofs don't provide explanations [Horsten] |
| Full Idea: Mathematicians are uncomfortable with computerised proofs because a 'good' proof should do more than convince us that a certain statement is true. It should also explain why the statement in question holds. | |
| From: Leon Horsten (Philosophy of Mathematics [2007], §5.3) |
| 13007 | Archimedes defined a straight line as the shortest distance between two points [Archimedes, by Leibniz] |
| Full Idea: Archimedes gave a sort of definition of 'straight line' when he said it is the shortest line between two points. | |
| From: report of Archimedes (fragments/reports [c.240 BCE]) by Gottfried Leibniz - New Essays on Human Understanding 4.13 | |
| A reaction: Commentators observe that this reduces the purity of the original Euclidean axioms, because it involves distance and measurement, which are absent from the purest geometry. |
| 17899 | Second-order induction is stronger as it covers all concepts, not just first-order definable ones [George/Velleman] |
| Full Idea: The first-order version of the induction axiom is weaker than the second-order, because the latter applies to all concepts, but the first-order applies only to concepts definable by a formula in the first-order language of number theory. | |
| From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Ch.7 n7) |
| 10128 | The Incompleteness proofs use arithmetic to talk about formal arithmetic [George/Velleman] |
| Full Idea: The idea behind the proofs of the Incompleteness Theorems is to use the language of Peano Arithmetic to talk about the formal system of Peano Arithmetic itself. | |
| From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Ch.7) | |
| A reaction: The mechanism used is to assign a Gödel Number to every possible formula, so that all reasonings become instances of arithmetic. |
| 17902 | A successor is the union of a set with its singleton [George/Velleman] |
| Full Idea: For any set x, we define the 'successor' of x to be the set S(x) = x U {x}. | |
| From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Ch.3) | |
| A reaction: This is the Fregean approach to successor, where the Dedekind approach takes 'successor' to be a primitive. Frege 1884:§76. |
| 10133 | Frege's Theorem shows the Peano Postulates can be derived from Hume's Principle [George/Velleman] |
| Full Idea: The derivability of Peano's Postulates from Hume's Principle in second-order logic has been dubbed 'Frege's Theorem', (though Frege would not have been interested, because he didn't think Hume's Principle gave an adequate definition of numebrs). | |
| From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Ch.8 n1) | |
| A reaction: Frege said the numbers were the sets which were the extensions of the sets created by Hume's Principle. |
| 10881 | The concept of 'ordinal number' is set-theoretic, not arithmetical [Horsten] |
| Full Idea: The notion of an ordinal number is a set-theoretic, and hence non-arithmetical, concept. | |
| From: Leon Horsten (Philosophy of Mathematics [2007], §2.3) |
| 15360 | ZFC showed that the concept of set is mathematical, not logical, because of its existence claims [Horsten] |
| Full Idea: One of the strengths of ZFC is that it shows that the concept of set is a mathematical concept. Many originally took it to be a logical concept. But ZFC makes mind-boggling existence claims, which should not follow if it was a logical concept. | |
| From: Leon Horsten (The Tarskian Turn [2011], 05.2.3) | |
| A reaction: This suggests that set theory is not just a way of expressing mathematics (see Benacerraf 1965), but that some aspect of mathematics has been revealed by it - maybe even its essential nature. |
| 15369 | Set theory is substantial over first-order arithmetic, because it enables new proofs [Horsten] |
| Full Idea: The nonconservativeness of set theory over first-order arithmetic has done much to establish set theory as a substantial theory indeed. | |
| From: Leon Horsten (The Tarskian Turn [2011], 07.5) | |
| A reaction: Horsten goes on to point out the price paid, which is the whole new ontology which has to be added to the arithmetic. Who cares? It's all fictions anyway! |
| 10130 | Set theory can prove the Peano Postulates [George/Velleman] |
| Full Idea: The Peano Postulates can be proven in ZFC. | |
| From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Ch.7) |
| 10089 | Talk of 'abstract entities' is more a label for the problem than a solution to it [George/Velleman] |
| Full Idea: One might well wonder whether talk of abstract entities is less a solution to the empiricist's problem of how a priori knowledge is possible than it is a label for the problem. | |
| From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Intro) | |
| A reaction: This pinpoints my view nicely. What the platonist postulates is remote, bewildering, implausible and useless! |
| 10131 | If mathematics is not about particulars, observing particulars must be irrelevant [George/Velleman] |
| Full Idea: As, in the logicist view, mathematics is about nothing particular, it is little wonder that nothing in particular needs to be observed in order to acquire mathematical knowledge. | |
| From: A.George / D.J.Velleman (Philosophies of Mathematics [2002]) | |
| A reaction: At the very least we can say that no one would have even dreamt of the general system of arithmetic is they hadn't had experience of the particulars. Frege thought generality ensured applicability, but extreme generality might entail irrelevance. |
| 10092 | In the unramified theory of types, the types are objects, then sets of objects, sets of sets etc. [George/Velleman] |
| Full Idea: In the unramified theory of types, all objects are classified into a hierarchy of types. The lowest level has individual objects that are not sets. Next come sets whose elements are individuals, then sets of sets, etc. Variables are confined to types. | |
| From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Ch.3) | |
| A reaction: The objects are Type 0, the basic sets Type 1, etc. |
| 10094 | The theory of types seems to rule out harmless sets as well as paradoxical ones. [George/Velleman] |
| Full Idea: The theory of types seems to rule out harmless sets as well as paradoxical ones. If a is an individual and b is a set of individuals, then in type theory we cannot talk about the set {a,b}. | |
| From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Ch.3) | |
| A reaction: Since we cheerfully talk about 'Cicero and other Romans', this sounds like a rather disasterous weakness. |
| 10095 | Type theory has only finitely many items at each level, which is a problem for mathematics [George/Velleman] |
| Full Idea: A problem with type theory is that there are only finitely many individuals, and finitely many sets of individuals, and so on. The hierarchy may be infinite, but each level is finite. Mathematics required an axiom asserting infinitely many individuals. | |
| From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Ch.3) | |
| A reaction: Most accounts of mathematics founder when it comes to infinities. Perhaps we should just reject them? |
| 17901 | Type theory prohibits (oddly) a set containing an individual and a set of individuals [George/Velleman] |
| Full Idea: If a is an individual and b is a set of individuals, then in the theory of types we cannot talk about the set {a,b}, since it is not an individual or a set of individuals, ...but it is hard to see what harm can come from it. | |
| From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Ch.3) |
| 10114 | Bounded quantification is originally finitary, as conjunctions and disjunctions [George/Velleman] |
| Full Idea: In the first instance all bounded quantifications are finitary, for they can be viewed as abbreviations for conjunctions and disjunctions. | |
| From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Ch.6) | |
| A reaction: This strikes me as quite good support for finitism. The origin of a concept gives a good guide to what it really means (not a popular view, I admit). When Aristotle started quantifying, I suspect of he thought of lists, not totalities. |
| 10134 | Much infinite mathematics can still be justified finitely [George/Velleman] |
| Full Idea: It is possible to use finitary reasoning to justify a significant part of infinitary mathematics. | |
| From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Ch.8) | |
| A reaction: This might save Hilbert's project, by gradually accepting into the fold all the parts which have been giving a finitist justification. |
| 10123 | The intuitionists are the idealists of mathematics [George/Velleman] |
| Full Idea: The intuitionists are the idealists of mathematics. | |
| From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Ch.6) |
| 10124 | Gödel's First Theorem suggests there are truths which are independent of proof [George/Velleman] |
| Full Idea: For intuitionists, truth is not independent of proof, but this independence is precisely what seems to be suggested by Gödel's First Incompleteness Theorem. | |
| From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Ch.8) | |
| A reaction: Thus Gödel was worse news for the Intuitionists than he was for Hilbert's Programme. Gödel himself responded by becoming a platonist about his unprovable truths. |
| 15370 | Predicativism says mathematical definitions must not include the thing being defined [Horsten] |
| Full Idea: Predicativism has it that a mathematical object (such as a set of numbers) cannot be defined by quantifying over a collection that includes that same mathematical object. To do so would be a violation of the vicious circle principle. | |
| From: Leon Horsten (The Tarskian Turn [2011], 07.7) | |
| A reaction: In other words, when you define an object you are obliged to predicate something new, and not just recycle the stuff you already have. |
| 15338 | We may believe in atomic facts, but surely not complex disjunctive ones? [Horsten] |
| Full Idea: While positive and perhaps even negative atomic facts may be unproblematic, it seems excessive to commit oneself to the existence of logically complex facts such as disjunctive facts. | |
| From: Leon Horsten (The Tarskian Turn [2011], 02.1) | |
| A reaction: Presumably it is hard to deny that very complex statements involving massive disjunctions can be true or false. But why does commitment to real facts have to involve a huge ontology? The ontology is just the ingredients of the fact, isn't it? |
| 15363 | In the supervaluationist account, disjunctions are not determined by their disjuncts [Horsten] |
| Full Idea: If 'Britain is large' and 'Italy is large' lack truth values, then so must 'Britain or Italy is large' - so on the supervaluationist account the truth value of a disjunction is not determined by the truth values of its disjuncts. | |
| From: Leon Horsten (The Tarskian Turn [2011], 06.2) | |
| A reaction: Compare Idea 15362 to get the full picture here. |
| 15362 | If 'Italy is large' lacks truth, so must 'Italy is not large'; but classical logic says it's large or it isn't [Horsten] |
| Full Idea: If 'Italy is a large country' lacks a truth value, then so too, presumably, does 'Italy is not a large country'. But 'Italy is or is not a large country' is true, on the supervaluationist account, because it is a truth of classical propositional logic. | |
| From: Leon Horsten (The Tarskian Turn [2011], 06.2) | |
| A reaction: See also Idea 15363. He cites Fine 1975. |
| 15372 | Some claim that indicative conditionals are believed by people, even though they are not actually held true [Horsten] |
| Full Idea: In the debate about doxastic attitudes towards indicative conditional sentences, one finds philosophers who claim that conditionals can be believed even though they have no truth value (and thus are not true). | |
| From: Leon Horsten (The Tarskian Turn [2011], 09.3) |
| 10110 | Corresponding to every concept there is a class (some of them sets) [George/Velleman] |
| Full Idea: Corresponding to every concept there is a class (some classes will be sets, the others proper classes). | |
| From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Ch.4) |
| 15347 | A theory of syntax can be based on Peano arithmetic, thanks to the translation by Gödel coding [Horsten] |
| Full Idea: A notion of formal provability can be articulated in Peano arithmetic. ..This is surprisingly 'linguistic' rather than mathematical, but the key is in the Gödel coding. ..Hence we use Peano arithmetic as a theory of syntax. | |
| From: Leon Horsten (The Tarskian Turn [2011], 02.4) | |
| A reaction: This is the explanation of why issues in formal semantics end up being studied in systems based on formal arithmetic. And I had thought it was just because they were geeks who dream in numbers, and can't speak language properly... |