25 ideas
| 18776 | Contextual definitions eliminate descriptions from contexts [Linsky,B] |
| Full Idea: A 'contextual' definition shows how to eliminate a description from a context. | |
| From: Bernard Linsky (Quantification and Descriptions [2014], 2) | |
| A reaction: I'm trying to think of an example, but what I come up with are better described as 'paraphrases' than as 'definitions'. |
| 21704 | 'Impredictative' definitions fix a class in terms of the greater class to which it belongs [Linsky,B] |
| Full Idea: The ban on 'impredicative' definitions says you can't define a class in terms of a totality to which that class must be seen as belonging. | |
| From: Bernard Linsky (Russell's Metaphysical Logic [1999], 1) | |
| A reaction: So that would be defining 'citizen' in terms of the community to which the citizen belongs? If you are asked to define 'community' and 'citizen' together, where do you start? But how else can it be done? Russell's Reducibility aimed to block this. |
| 21705 | Reducibility says any impredicative function has an appropriate predicative replacement [Linsky,B] |
| Full Idea: The Axiom of Reducibility avoids impredicativity, by asserting that for any predicate of given arguments defined by quantifying over higher-order functions or classes, there is another co-extensive but predicative function of the same type of arguments. | |
| From: Bernard Linsky (Russell's Metaphysical Logic [1999], 1) | |
| A reaction: Eventually the axiom seemed too arbitrary, and was dropped. Linsky's book explores it. |
| 10757 | Henkin semantics has a second domain of predicates and relations (in upper case) [Rossberg] |
| Full Idea: Henkin semantics (for second-order logic) specifies a second domain of predicates and relations for the upper case constants and variables. | |
| From: Marcus Rossberg (First-order Logic, 2nd-order, Completeness [2004], §3) | |
| A reaction: This second domain is restricted to predicates and relations which are actually instantiated in the model. Second-order logic is complete with this semantics. Cf. Idea 10756. |
| 10759 | There are at least seven possible systems of semantics for second-order logic [Rossberg] |
| Full Idea: In addition to standard and Henkin semantics for second-order logic, one might also employ substitutional or game-theoretical or topological semantics, or Boolos's plural interpretation, or even a semantics inspired by Lesniewski. | |
| From: Marcus Rossberg (First-order Logic, 2nd-order, Completeness [2004], §3) | |
| A reaction: This is helpful in seeing the full picture of what is going on in these logical systems. |
| 10751 | Second-order logic needs the sets, and its consequence has epistemological problems [Rossberg] |
| Full Idea: Second-order logic raises doubts because of its ontological commitment to the set-theoretic hierarchy, and the allegedly problematic epistemic status of the second-order consequence relation. | |
| From: Marcus Rossberg (First-order Logic, 2nd-order, Completeness [2004], §1) | |
| A reaction: The 'epistemic' problem is whether you can know the truths, given that the logic is incomplete, and so they cannot all be proved. Rossberg defends second-order logic against the second problem. A third problem is that it may be mathematics. |
| 10753 | Logical consequence is intuitively semantic, and captured by model theory [Rossberg] |
| Full Idea: Logical consequence is intuitively taken to be a semantic notion, ...and it is therefore the formal semantics, i.e. the model theory, that captures logical consequence. | |
| From: Marcus Rossberg (First-order Logic, 2nd-order, Completeness [2004], §2) | |
| A reaction: If you come at the issue from normal speech, this seems right, but if you start thinking about the necessity of logical consequence, that formal rules and proof-theory seem to be the foundation. |
| 10752 | Γ |- S says S can be deduced from Γ; Γ |= S says a good model for Γ makes S true [Rossberg] |
| Full Idea: Deductive consequence, written Γ|-S, is loosely read as 'the sentence S can be deduced from the sentences Γ', and semantic consequence Γ|=S says 'all models that make Γ true make S true as well'. | |
| From: Marcus Rossberg (First-order Logic, 2nd-order, Completeness [2004], §2) | |
| A reaction: We might read |= as 'true in the same model as'. What is the relation, though, between the LHS and the RHS? They seem to be mutually related to some model, but not directly to one another. |
| 10754 | In proof-theory, logical form is shown by the logical constants [Rossberg] |
| Full Idea: A proof-theorist could insist that the logical form of a sentence is exhibited by the logical constants that it contains. | |
| From: Marcus Rossberg (First-order Logic, 2nd-order, Completeness [2004], §2) | |
| A reaction: You have to first get to the formal logical constants, rather than the natural language ones. E.g. what is the truth table for 'but'? There is also the matter of the quantifiers and the domain, and distinguishing real objects and predicates from bogus. |
| 18774 | Definite descriptions, unlike proper names, have a logical structure [Linsky,B] |
| Full Idea: Definite descriptions seem to have a logical structure in a way that proper names do not. | |
| From: Bernard Linsky (Quantification and Descriptions [2014], 1.1.1) | |
| A reaction: Thus descriptions have implications which plain names do not. |
| 21727 | Definite descriptions theory eliminates the King of France, but not the Queen of England [Linsky,B] |
| Full Idea: The theory of definite descriptions may eliminate apparent commitment to such entities as the present King of France, but certainly not to the present Queen of England. | |
| From: Bernard Linsky (Russell's Metaphysical Logic [1999], 7.3) |
| 21719 | Extensionalism means what is true of a function is true of coextensive functions [Linsky,B] |
| Full Idea: With the principle of extensionality anything true of one propositional functions will be true of every coextensive one. | |
| From: Bernard Linsky (Russell's Metaphysical Logic [1999], 6.3) |
| 10756 | A model is a domain, and an interpretation assigning objects, predicates, relations etc. [Rossberg] |
| Full Idea: A standard model is a set of objects called the 'domain', and an interpretation function, assigning objects in the domain to names, subsets to predicate letters, subsets of the Cartesian product of the domain with itself to binary relation symbols etc. | |
| From: Marcus Rossberg (First-order Logic, 2nd-order, Completeness [2004], §3) | |
| A reaction: The model actually specifies which objects have which predicates, and which objects are in which relations. Tarski's account of truth in terms of 'satisfaction' seems to be just a description of those pre-decided facts. |
| 10758 | If models of a mathematical theory are all isomorphic, it is 'categorical', with essentially one model [Rossberg] |
| Full Idea: A mathematical theory is 'categorical' if, and only if, all of its models are isomorphic. Such a theory then essentially has just one model, the standard one. | |
| From: Marcus Rossberg (First-order Logic, 2nd-order, Completeness [2004], §3) | |
| A reaction: So the term 'categorical' is gradually replacing the much-used phrase 'up to isomorphism'. |
| 10761 | Completeness can always be achieved by cunning model-design [Rossberg] |
| Full Idea: All that should be required to get a semantics relative to which a given deductive system is complete is a sufficiently cunning model-theorist. | |
| From: Marcus Rossberg (First-order Logic, 2nd-order, Completeness [2004], §5) |
| 10755 | A deductive system is only incomplete with respect to a formal semantics [Rossberg] |
| Full Idea: No deductive system is semantically incomplete in and of itself; rather a deductive system is incomplete with respect to a specified formal semantics. | |
| From: Marcus Rossberg (First-order Logic, 2nd-order, Completeness [2004], §3) | |
| A reaction: This important point indicates that a system might be complete with one semantics and incomplete with another. E.g. second-order logic can be made complete by employing a 'Henkin semantics'. |
| 21723 | The task of logicism was to define by logic the concepts 'number', 'successor' and '0' [Linsky,B] |
| Full Idea: The problem for logicism was to find definitions of the primitive notions of Peano's theory, number, successor and 0, in terms of logical notions, so that the postulates could then be derived by logic alone. | |
| From: Bernard Linsky (Russell's Metaphysical Logic [1999], 7) | |
| A reaction: Both Frege and Russell defined numbers as equivalence classes. Successor is easily defined (in various ways) in set theory. An impossible set can exemplify zero. The trouble for logicism is this all relies on sets. |
| 21721 | Higher types are needed to distinguished intensional phenomena which are coextensive [Linsky,B] |
| Full Idea: The higher types are needed for intensional phenomena, cases where the same class is picked out by distinct propositional functions. | |
| From: Bernard Linsky (Russell's Metaphysical Logic [1999], 6.4) | |
| A reaction: I take it that in this way 'x is renate' can be distinguished from 'x is cordate', a task nowadays performed by possible worlds. |
| 21703 | Types are 'ramified' when there are further differences between the type of quantifier and its range [Linsky,B] |
| Full Idea: The types is 'ramified' because there are further differences between the type of a function defined in terms of a quantifier ranging over other functions and the type of those other functions, despite the functions applying to the same simple type. | |
| From: Bernard Linsky (Russell's Metaphysical Logic [1999], 1) | |
| A reaction: Not sure I understand this, but it evidently created difficulties for dealing with actual mathematics, and Ramsey showed how you could manage without the ramifications. |
| 21714 | The ramified theory subdivides each type, according to the range of the variables [Linsky,B] |
| Full Idea: The original ramified theory of types ...furthern subdivides each of the types of the 'simple' theory according to the range of the bound variables used in the definition of each propositional function. | |
| From: Bernard Linsky (Russell's Metaphysical Logic [1999], 6) | |
| A reaction: For a non-intiate like me it certainly sounds disappointing that such a bold and neat theory because a tangle of complications. Ramsey and Russell in the 1920s seem to have dropped the ramifications. |
| 21713 | Did logicism fail, when Russell added three nonlogical axioms, to save mathematics? [Linsky,B] |
| Full Idea: It is often thought that Logicism was a failure, because after Frege's contradiction, Russell required obviously nonlogical principles, in order to develop mathematics. The axioms of Reducibility, Infinity and Choice are cited. | |
| From: Bernard Linsky (Russell's Metaphysical Logic [1999], 6) | |
| A reaction: Infinity and Choice remain as axioms of the standard ZFC system of set theory, which is why set theory is always assumed to be 'up to its neck' in ontological commitments. Linsky argues that Russell saw ontology in logic. |
| 21715 | For those who abandon logicism, standard set theory is a rival option [Linsky,B] |
| Full Idea: ZF set theory is seen as a rival to logicism as a foundational scheme. Set theory is for those who have given up the project of reducing mathematics to logic. | |
| From: Bernard Linsky (Russell's Metaphysical Logic [1999], 6.1) | |
| A reaction: Presumably there are other rivals. Set theory has lots of ontological commitments. One could start at the other end, and investigate the basic ontological commitments of arithmetic. I have no idea what those might be. |
| 21729 | Construct properties as sets of objects, or say an object must be in the set to have the property [Linsky,B] |
| Full Idea: Rather than directly constructing properties as sets of objects and proving neat facts about properties by proxy, we can assert biconditionals, such as that an object has a property if and only if it is in a certain set. | |
| From: Bernard Linsky (Russell's Metaphysical Logic [1999], 7.6) | |
| A reaction: Linsky is describing Russell's method of logical construction. I'm not clear what is gained by this move, but at least it is a variant of the usual irritating expression of properties as sets of objects. |
| 1757 | The Electra: she knows this man, but not that he is her brother [Eucleides, by Diog. Laertius] |
| Full Idea: The 'Electra': Electra knows that Orestes is her brother, but not that this man is Orestes, so she knows and does not know her brother simultaneously. | |
| From: report of Eucleides (fragments/reports [c.410 BCE]) by Diogenes Laertius - Lives of Eminent Philosophers 02.Eu.4 | |
| A reaction: Hence we distinguish 'know of', 'know that' and 'know how'. Hence Russell makes 'knowledge by acquaintance' fundamental, and descriptions come later. |
| 3028 | The chief good is unity, sometimes seen as prudence, or God, or intellect [Eucleides] |
| Full Idea: The chief good is unity, which is known by several names, for at one time people call it prudence, at another time God, at another intellect, and so on. | |
| From: Eucleides (fragments/reports [c.410 BCE]), quoted by Diogenes Laertius - Lives of Eminent Philosophers 02.9.2 | |
| A reaction: So the chief good is what unites and focuses our moral actions. Kant calls that 'the will'. |