61 ideas
| 22271 | Aristotle was the first to use schematic letters in logic [Aristotle, by Potter] |
| Full Idea: It was Aristotle who initiated the use of the letter of the (Greek) alphabet 'schematically', to stand for an unspecified piece of language of some appropriate grammatical type. | |
| From: report of Aristotle (Prior Analytics [c.328 BCE]) by Michael Potter - The Rise of Analytic Philosophy 1879-1930 02 'Aris' | |
| A reaction: Did he invent it from scratch, or borrow it from the mathematicians? Euclid labels diagrams with letters. |
| 11060 | Aristotelian syllogisms are three-part, subject-predicate, existentially committed, with laws of thought [Aristotle, by Hanna] |
| Full Idea: Aristotle's logic is based on the triadic syllogism, the distinction between subject and one-place predicates, that universal claims have existential commitment, and bivalence, excluded middle and noncontradiction. | |
| From: report of Aristotle (Prior Analytics [c.328 BCE]) by Robert Hanna - Rationality and Logic 2.2 |
| 18909 | Aristotelian sentences are made up by one of four 'formative' connectors [Aristotle, by Engelbretsen] |
| Full Idea: For Aristotle there are four formatives for sentences: 'belongs to some', 'belongs to every', 'belongs to no', and 'does not belong to every'. These are 'copulae'. Aristotle would have written 'wise belongs to some man'. | |
| From: report of Aristotle (Prior Analytics [c.328 BCE]) by George Engelbretsen - Trees, Terms and Truth 3 | |
| A reaction: A rather set-theoretic reading. This invites a Quinean scepticism about whether wisdom is some entity which can 'belong' to a person. It makes trope theory sound attractive, offering a unique wisdom that is integrated into that particular person. |
| 8080 | Aristotelian identified 256 possible syllogisms, saying that 19 are valid [Aristotle, by Devlin] |
| Full Idea: Aristotle identified four 'figures' of argument, based on combinations of Subject (S) and Predicate (P) and Middle term (M). The addition of 'all' and 'some', and 'has' and 'has not' got the property, resulted in 256 possible syllogisms, 19 of them valid. | |
| From: report of Aristotle (Prior Analytics [c.328 BCE]) by Keith Devlin - Goodbye Descartes Ch.2 | |
| A reaction: [Compressed version of Devlin] What Aristotle did was astonishing, and must be one of the key ideas of western civilization, even though a lot of his assumptions have been revised or rejected. |
| 13912 | Aristotle replaced Plato's noun-verb form with unions of pairs of terms by one of four 'copulae' [Aristotle, by Engelbretsen/Sayward] |
| Full Idea: Aristotle replaced the Platonic noun-verb account of logical syntax with a 'copular' account. A sentence is a pair of terms bound together logically (not necessarily grammatically) by one of four 'logical copulae' (every, none, some, not some). | |
| From: report of Aristotle (Prior Analytics [c.328 BCE]) by Engelbretsen,G/Sayward,C - Philosophical Logic: Intro to Advanced Topics 8 | |
| A reaction: So the four copulas are are-all, are-never, are-sometimes, and are-sometime-not. Consider 'men' and 'mortal'. Alternatively, Idea 18909. |
| 8071 | Aristotle listed nineteen valid syllogisms (though a few of them were wrong) [Aristotle, by Devlin] |
| Full Idea: Aristotle listed a total of nineteen syllogisms involved in logical reasoning, though some of the ones on his list were subsequently shown to be invalid. | |
| From: report of Aristotle (Prior Analytics [c.328 BCE], Ch.1) by Keith Devlin - Goodbye Descartes | |
| A reaction: It is quite upsetting to think that the founding genius got some of it wrong, but that just shows how subtle and complex the analysis of rational thought can be. |
| 13819 | Aristotle's said some Fs are G or some Fs are not G, forgetting that there might be no Fs [Bostock on Aristotle] |
| Full Idea: Aristotle's system accepted as correct some laws which nowadays we reject, for example |= (Some Fs are G) or (some Fs are not G). He failed to take into account the possibility of there being no Fs at all. | |
| From: comment on Aristotle (Prior Analytics [c.328 BCE]) by David Bostock - Intermediate Logic 8.4 |
| 9403 | There are three different deductions for actual terms, necessary terms and possible terms [Aristotle] |
| Full Idea: Since to belong, to belong of necessity, and to be possible to belong are different, ..there will be different deductions for each; one deduction will be from necessary terms, one from terms which belong, and one from possible terms. | |
| From: Aristotle (Prior Analytics [c.328 BCE], 29b29-35) | |
| A reaction: Fitting and Mendelsohn cite this as the earliest thoughts on modal logic. but Kneale and Kneale say that Aristotle got into a muddle, and so was unable to create a workable system. |
| 10073 | There cannot be a set theory which is complete [Smith,P] |
| Full Idea: By Gödel's First Incompleteness Theorem, there cannot be a negation-complete set theory. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 01.3) | |
| A reaction: This means that we can never prove all the truths of a system of set theory. |
| 10616 | Second-order arithmetic can prove new sentences of first-order [Smith,P] |
| Full Idea: Going second-order in arithmetic enables us to prove new first-order arithmetical sentences that we couldn't prove before. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 23.4) | |
| A reaction: The wages of Satan, perhaps. We can prove things about objects by proving things about their properties and sets and functions. Smith says this fact goes all the way up the hierarchy. |
| 11148 | Deduction is when we suppose one thing, and another necessarily follows [Aristotle] |
| Full Idea: A deduction is a discourse in which, certain things having been supposed, something different from the things supposed results of necessity because these things are so. | |
| From: Aristotle (Prior Analytics [c.328 BCE], 24b18) | |
| A reaction: Notice that it is modal ('suppose', rather than 'know'), that necessity is involved, which is presumably metaphysical necessity, and that there are assumptions about what would be true, and not just what follows from what. |
| 18896 | Aristotle places terms at opposite ends, joined by a quantified copula [Aristotle, by Sommers] |
| Full Idea: Aristotle often preferred to formulate predications by placing the terms at opposite ends of the sentence and joining them by predicating expressions like 'belongs-to-some' or 'belongs-to-every'. | |
| From: report of Aristotle (Prior Analytics [c.328 BCE]) by Fred Sommers - Intellectual Autobiography 'Conceptions' | |
| A reaction: This is Sommers's picture of Aristotle, which led Sommers to develop his modern Term Logic. |
| 10076 | The 'range' of a function is the set of elements in the output set created by the function [Smith,P] |
| Full Idea: The 'range' of a function is the set of elements in the output set that are values of the function for elements in the original set. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 02.1) | |
| A reaction: In other words, the range is the set of values that were created by the function. |
| 10605 | Two functions are the same if they have the same extension [Smith,P] |
| Full Idea: We count two functions as being the same if they have the same extension, i.e. if they pair up arguments with values in the same way. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 11.3) | |
| A reaction: So there's only one way to skin a cat in mathematical logic. |
| 10075 | A 'partial function' maps only some elements to another set [Smith,P] |
| Full Idea: A 'partial function' is one which maps only some elements of a domain to elements in another set. For example, the reciprocal function 1/x is not defined for x=0. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 02.1 n1) |
| 10074 | A 'total function' maps every element to one element in another set [Smith,P] |
| Full Idea: A 'total function' is one which maps every element of a domain to exactly one corresponding value in another set. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 02.1) |
| 10612 | An argument is a 'fixed point' for a function if it is mapped back to itself [Smith,P] |
| Full Idea: If a function f maps the argument a back to a itself, so that f(a) = a, then a is said to be a 'fixed point' for f. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 20.5) |
| 3300 | Aristotle's logic is based on the subject/predicate distinction, which leads him to substances and properties [Aristotle, by Benardete,JA] |
| Full Idea: Basic to Aristotle's logic is the grammatical distinction between subject and predicate, which he glosses in terms of the contrast between a substance and its properties. | |
| From: report of Aristotle (Prior Analytics [c.328 BCE]) by José A. Benardete - Metaphysics: the logical approach Intro | |
| A reaction: The introduction of quantifiers and 'logical form' can't disguise the fact that we still talk about (and with) objects and predicates, because no one can think of any other way to talk. |
| 10615 | The Comprehension Schema says there is a property only had by things satisfying a condition [Smith,P] |
| Full Idea: The so-called Comprehension Schema ∃X∀x(Xx ↔ φ(x)) says that there is a property which is had by just those things which satisfy the condition φ. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 22.3) |
| 10595 | A 'theorem' of a theory is a sentence derived from the axioms using the proof system [Smith,P] |
| Full Idea: 'Theorem': given a derivation of the sentence φ from the axioms of the theory T using the background logical proof system, we will say that φ is a 'theorem' of the theory. Standard abbreviation is T |- φ. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 03.4) |
| 11149 | Affirming/denying sentences are universal, particular, or indeterminate [Aristotle] |
| Full Idea: Affirming/denying sentences are universal, particular, or indeterminate. Belonging 'to every/to none' is universal; belonging 'to some/not to some/not to every' is particular; belonging or not belonging (without universal/particular) is indeterminate. | |
| From: Aristotle (Prior Analytics [c.328 BCE], 24a16) |
| 8079 | Aristotelian logic has two quantifiers of the subject ('all' and 'some') [Aristotle, by Devlin] |
| Full Idea: Aristotelian logic has two quantifiers of the subject ('all' and 'some'), and two ways to combine the subject with the predicate ('have', and 'have not'), giving four propositions: all-s-have-p, all-s-have-not-p, some-s-have-p, and some-s-have-not-p. | |
| From: report of Aristotle (Prior Analytics [c.328 BCE]) by Keith Devlin - Goodbye Descartes Ch.2 | |
| A reaction: Frege seems to have switched from 'some' to 'at-least-one'. Since then other quantifiers have been proposed. See, for example, Ideas 7806 and 6068. |
| 10602 | A 'natural deduction system' has no axioms but many rules [Smith,P] |
| Full Idea: A 'natural deduction system' will have no logical axioms but may rules of inference. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 09.1) | |
| A reaction: He contrasts this with 'Hilbert-style systems', which have many axioms but few rules. Natural deduction uses many assumptions which are then discharged, and so tree-systems are good for representing it. |
| 10613 | No nice theory can define truth for its own language [Smith,P] |
| Full Idea: No nice theory can define truth for its own language. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 21.5) | |
| A reaction: This leads on to Tarski's account of truth. |
| 10078 | An 'injective' ('one-to-one') function creates a distinct output element from each original [Smith,P] |
| Full Idea: An 'injective' function is 'one-to-one' - each element of the output set results from a different element of the original set. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 02.1) | |
| A reaction: That is, two different original elements cannot lead to the same output element. |
| 10077 | A 'surjective' ('onto') function creates every element of the output set [Smith,P] |
| Full Idea: A 'surjective' function is 'onto' - the whole of the output set results from the function being applied to elements of the original set. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 02.1) |
| 10079 | A 'bijective' function has one-to-one correspondence in both directions [Smith,P] |
| Full Idea: A 'bijective' function has 'one-to-one correspondence' - it is both surjective and injective, so that every element in each of the original and the output sets has a matching element in the other. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 02.1) | |
| A reaction: Note that 'injective' is also one-to-one, but only in the one direction. |
| 10070 | If everything that a theory proves is true, then it is 'sound' [Smith,P] |
| Full Idea: If everything that a theory proves must be true, then it is a 'sound' theory. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 01.1) |
| 10086 | Soundness is true axioms and a truth-preserving proof system [Smith,P] |
| Full Idea: Soundness is normally a matter of having true axioms and a truth-preserving proof system. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 03.4) | |
| A reaction: The only exception I can think of is if a theory consisted of nothing but the axioms. |
| 10596 | A theory is 'sound' iff every theorem is true (usually from true axioms and truth-preservation) [Smith,P] |
| Full Idea: A theory is 'sound' iff every theorem of it is true (i.e. true on the interpretation built into its language). Soundness is normally a matter of having true axioms and a truth-preserving proof system. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 03.4) |
| 10598 | A theory is 'negation complete' if it proves all sentences or their negation [Smith,P] |
| Full Idea: A theory is 'negation complete' if it decides every sentence of its language (either the sentence, or its negation). | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 03.4) |
| 10597 | 'Complete' applies both to whole logics, and to theories within them [Smith,P] |
| Full Idea: There is an annoying double-use of 'complete': a logic may be semantically complete, but there may be an incomplete theory expressed in it. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 03.4) |
| 10069 | A theory is 'negation complete' if one of its sentences or its negation can always be proved [Smith,P] |
| Full Idea: Logicians say that a theory T is '(negation) complete' if, for every sentence φ in the language of the theory, either φ or ¬φ is deducible in T's proof system. If this were the case, then truth could be equated with provability. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 01.1) | |
| A reaction: The word 'negation' seems to be a recent addition to the concept. Presumable it might be the case that φ can always be proved, but not ¬φ. |
| 10609 | Two routes to Incompleteness: semantics of sound/expressible, or syntax of consistency/proof [Smith,P] |
| Full Idea: There are two routes to Incompleteness results. One goes via the semantic assumption that we are dealing with sound theories, using a result about what they can express. The other uses the syntactic notion of consistency, with stronger notions of proof. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 18.1) |
| 10080 | 'Effective' means simple, unintuitive, independent, controlled, dumb, and terminating [Smith,P] |
| Full Idea: An 'effectively decidable' (or 'computable') algorithm will be step-by-small-step, with no need for intuition, or for independent sources, with no random methods, possible for a dumb computer, and terminates in finite steps. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 02.2) | |
| A reaction: [a compressed paragraph] |
| 10087 | A theory is 'decidable' if all of its sentences could be mechanically proved [Smith,P] |
| Full Idea: A theory is 'decidable' iff there is a mechanical procedure for determining whether any sentence of its language can be proved. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 03.4) | |
| A reaction: Note that it doesn't actually have to be proved. The theorems of the theory are all effectively decidable. |
| 10088 | Any consistent, axiomatized, negation-complete formal theory is decidable [Smith,P] |
| Full Idea: Any consistent, axiomatized, negation-complete formal theory is decidable. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 03.6) |
| 10081 | A set is 'enumerable' is all of its elements can result from a natural number function [Smith,P] |
| Full Idea: A set is 'enumerable' iff either the set is empty, or there is a surjective function to the set from the set of natural numbers, so that the set is in the range of that function. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 02.3) |
| 10083 | A set is 'effectively enumerable' if a computer could eventually list every member [Smith,P] |
| Full Idea: A set is 'effectively enumerable' if an (idealised) computer could be programmed to generate a list of its members such that any member will eventually be mentioned (even if the list is empty, or without end, or contains repetitions). | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 02.4) |
| 10084 | A finite set of finitely specifiable objects is always effectively enumerable (e.g. primes) [Smith,P] |
| Full Idea: A finite set of finitely specifiable objects is always effectively enumerable (for example, the prime numbers). | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 02.4) |
| 10085 | The set of ordered pairs of natural numbers <i,j> is effectively enumerable [Smith,P] |
| Full Idea: The set of ordered pairs of natural numbers (i,j) is effectively enumerable, as proven by listing them in an array (across: <0,0>, <0,1>, <0,2> ..., and down: <0,0>, <1,0>, <2,0>...), and then zig-zagging. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 02.5) |
| 10601 | The thorems of a nice arithmetic can be enumerated, but not the truths (so they're diffferent) [Smith,P] |
| Full Idea: The theorems of any properly axiomatized theory can be effectively enumerated. However, the truths of any sufficiently expressive arithmetic can't be effectively enumerated. Hence the theorems and truths of arithmetic cannot be the same. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 05 Intro) |
| 10600 | Being 'expressible' depends on language; being 'capture/represented' depends on axioms and proof system [Smith,P] |
| Full Idea: Whether a property is 'expressible' in a given theory depends on the richness of the theory's language. Whether the property can be 'captured' (or 'represented') by the theory depends on the richness of the axioms and proof system. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 04.7) |
| 10599 | For primes we write (x not= 1 ∧ ∀u∀v(u x v = x → (u = 1 ∨ v = 1))) [Smith,P] |
| Full Idea: For prime numbers we write (x not= 1 ∧ ∀u∀v(u x v = x → (u = 1 ∨ v = 1))). That is, the only way to multiply two numbers and a get a prime is if one of them is 1. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 04.5) |
| 10610 | The reals contain the naturals, but the theory of reals doesn't contain the theory of naturals [Smith,P] |
| Full Idea: It has been proved (by Tarski) that the real numbers R is a complete theory. But this means that while the real numbers contain the natural numbers, the pure theory of real numbers doesn't contain the theory of natural numbers. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 18.2) |
| 10619 | The truths of arithmetic are just true equations and their universally quantified versions [Smith,P] |
| Full Idea: The truths of arithmetic are just the true equations involving particular numbers, and universally quantified versions of such equations. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 27.7) | |
| A reaction: Must each equation be universally quantified? Why can't we just universally quantify over the whole system? |
| 10608 | The number of Fs is the 'successor' of the Gs if there is a single F that isn't G [Smith,P] |
| Full Idea: The number of Fs is the 'successor' of the number of Gs if there is an object which is an F, and the remaining things that are F but not identical to the object are equinumerous with the Gs. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 14.1) |
| 10618 | All numbers are related to zero by the ancestral of the successor relation [Smith,P] |
| Full Idea: All numbers are related to zero by the ancestral of the successor relation. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 23.5) | |
| A reaction: The successor relation only ties a number to the previous one, not to the whole series. Ancestrals are a higher level of abstraction. |
| 10849 | Baby arithmetic covers addition and multiplication, but no general facts about numbers [Smith,P] |
| Full Idea: Baby Arithmetic 'knows' the addition of particular numbers and multiplication, but can't express general facts about numbers, because it lacks quantification. It has a constant '0', a function 'S', and functions '+' and 'x', and identity and negation. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 08.1) |
| 10850 | Baby Arithmetic is complete, but not very expressive [Smith,P] |
| Full Idea: Baby Arithmetic is negation complete, so it can prove every claim (or its negation) that it can express, but it is expressively extremely impoverished. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 08.3) |
| 10852 | Robinson Arithmetic (Q) is not negation complete [Smith,P] |
| Full Idea: Robinson Arithmetic (Q) is not negation complete | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 08.4) |
| 10851 | Robinson Arithmetic 'Q' has basic axioms, quantifiers and first-order logic [Smith,P] |
| Full Idea: We can beef up Baby Arithmetic into Robinson Arithmetic (referred to as 'Q'), by restoring quantifiers and variables. It has seven generalised axioms, plus standard first-order logic. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 08.3) |
| 10068 | Natural numbers have zero, unique successors, unending, no circling back, and no strays [Smith,P] |
| Full Idea: The sequence of natural numbers starts from zero, and each number has just one immediate successor; the sequence continues without end, never circling back on itself, and there are no 'stray' numbers, lurking outside the sequence. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 01.1) | |
| A reaction: These are the characteristics of the natural numbers which have to be pinned down by any axiom system, such as Peano's, or any more modern axiomatic structures. We are in the territory of Gödel's theorems. |
| 10603 | The logic of arithmetic must quantify over properties of numbers to handle induction [Smith,P] |
| Full Idea: If the logic of arithmetic doesn't have second-order quantifiers to range over properties of numbers, how can it handle induction? | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 10.1) |
| 10848 | Multiplication only generates incompleteness if combined with addition and successor [Smith,P] |
| Full Idea: Multiplication in itself isn't is intractable. In 1929 Skolem showed a complete theory for a first-order language with multiplication but lacking addition (or successor). Multiplication together with addition and successor produces incompleteness. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 10.7 n8) |
| 10604 | Incompleteness results in arithmetic from combining addition and successor with multiplication [Smith,P] |
| Full Idea: Putting multiplication together with addition and successor in the language of arithmetic produces incompleteness. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 10.7) | |
| A reaction: His 'Baby Arithmetic' has all three and is complete, but lacks quantification (p.51) |
| 10617 | The 'ancestral' of a relation is a new relation which creates a long chain of the original relation [Smith,P] |
| Full Idea: The 'ancestral' of a relation is that relation which holds when there is an indefinitely long chain of things having the initial relation. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 23.5) | |
| A reaction: The standard example is spotting the relation 'ancestor' from the receding relation 'parent'. This is a sort of abstraction derived from a relation which is not equivalent (parenthood being transitive but not reflexive). The idea originated with Frege. |
| 14641 | A deduction is necessary if the major (but not the minor) premise is also necessary [Aristotle] |
| Full Idea: It sometimes results that the deduction becomes necessary when only one of the premises is necessary (not whatever premise it might be, however, but only the premise in relation to the major extreme [premise]). | |
| From: Aristotle (Prior Analytics [c.328 BCE], 30a15) | |
| A reaction: The qualification is brackets is said by Plantinga (1969) to be a recognition of the de re/ de dicto distinction (later taken up by Aquinas). Plantinga gives two examples to illustrate his reading. |
| 4691 | If all mental life were conscious, we would be unable to see things, or to process speech [McGinn] |
| Full Idea: If there were nothing more to our mind than our conscious awareness, then we would be unable to see anything or to process speech. | |
| From: Colin McGinn (The Making of a Philosopher [2002], Ch. 6) | |
| A reaction: A vital point. Traditional dualism has left us a simplistic exaggeration of the role of consciousness, and the misapprehension that most of what we do is conscious - which it clearly isn't, once you think about it. |
| 18911 | Linguistic terms form a hierarchy, with higher terms predicable of increasing numbers of things [Aristotle, by Engelbretsen] |
| Full Idea: According to Aristotle, the terms of a language form a finite hierarchy, where the higher terms are predicable of more things than are lower terms. | |
| From: report of Aristotle (Prior Analytics [c.328 BCE]) by George Engelbretsen - Trees, Terms and Truth 3 | |
| A reaction: I would be a bit cautious about placing something precisely in a hierarchy according to how many things it can be predicated of. It is a start, though, in trying to give a decent account of generality, which is a major concept in philosophy. |
| 4690 | If meaning is speaker's intentions, it can be reduced to propositional attitudes, and philosophy of mind [McGinn] |
| Full Idea: The importance of Grice's analysis of speaker meaning is that it offers the prospect of analysing the whole phenomenon of linguistic meaning in terms of propositional attitudes… thus turning semantics into a department of the philosophy of mind. | |
| From: Colin McGinn (The Making of a Philosopher [2002], Ch. 5) | |
| A reaction: Although meaning being truth conditions is the most cited theory, the reduction of semantics to an aspect of mind also seems almost orthodox now. But how do the symbols 'represent' the attitudes? |