19 ideas
| 6299 | Axioms are often affirmed simply because they produce results which have been accepted [Resnik] |
| Full Idea: Many axioms have been proposed, not on the grounds that they can be directly known, but rather because they produce a desired body of previously recognised results. | |
| From: Michael D. Resnik (Maths as a Science of Patterns [1997], One.5.1) | |
| A reaction: This is the perennial problem with axioms - whether we start from them, or whether we deduce them after the event. There is nothing wrong with that, just as we might infer the existence of quarks because of their results. |
| 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. |
| 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'. |
| 6304 | Mathematical realism says that maths exists, is largely true, and is independent of proofs [Resnik] |
| Full Idea: Mathematical realism is the doctrine that mathematical objects exist, that much contemporary mathematics is true, and that the existence and truth in question is independent of our constructions, beliefs and proofs. | |
| From: Michael D. Resnik (Maths as a Science of Patterns [1997], Three.12.9) | |
| A reaction: As thus defined, I would call myself a mathematical realist, but everyone must hesitate a little at the word 'exist' and ask, how does it exist? What is it 'made of'? To say that it exists in the way that patterns exist strikes me as very helpful. |
| 6300 | Mathematical constants and quantifiers only exist as locations within structures or patterns [Resnik] |
| Full Idea: In maths the primary subject-matter is not mathematical objects but structures in which they are arranged; our constants and quantifiers denote atoms, structureless points, or positions in structures; they have no identity outside a structure or pattern. | |
| From: Michael D. Resnik (Maths as a Science of Patterns [1997], Three.10.1) | |
| A reaction: This seems to me a very promising idea for the understanding of mathematics. All mathematicians acknowledge that the recognition of patterns is basic to the subject. Even animals recognise patterns. It is natural to invent a language of patterns. |
| 6303 | Sets are positions in patterns [Resnik] |
| Full Idea: On my view, sets are positions in certain patterns. | |
| From: Michael D. Resnik (Maths as a Science of Patterns [1997], Three.10.5) | |
| A reaction: I have always found the ontology of a 'set' puzzling, because they seem to depend on prior reasons why something is a member of a given set, which cannot always be random. It is hard to explain sets without mentioning properties. |
| 6295 | There are too many mathematical objects for them all to be mental or physical [Resnik] |
| Full Idea: If we take mathematics at its word, there are too many mathematical objects for it to be plausible that they are all mental or physical objects. | |
| From: Michael D. Resnik (Maths as a Science of Patterns [1997], One.1) | |
| A reaction: No one, of course, has ever claimed that they are, but this is a good starting point for assessing the ontology of mathematics. We are going to need 'rules', which can deduce the multitudinous mathematical objects from a small ontology. |
| 6296 | Maths is pattern recognition and representation, and its truth and proofs are based on these [Resnik] |
| Full Idea: I argue that mathematical knowledge has its roots in pattern recognition and representation, and that manipulating representations of patterns provides the connection between the mathematical proof and mathematical truth. | |
| From: Michael D. Resnik (Maths as a Science of Patterns [1997], One.1) | |
| A reaction: The suggestion that patterns are at the basis of the ontology of mathematics is the most illuminating thought I have encountered in the area. It immediately opens up the possibility of maths being an entirely empirical subject. |
| 6301 | Congruence is the strongest relationship of patterns, equivalence comes next, and mutual occurrence is the weakest [Resnik] |
| Full Idea: Of the equivalence relationships which occur between patterns, congruence is the strongest, equivalence the next, and mutual occurrence the weakest. None of these is identity, which would require the same position. | |
| From: Michael D. Resnik (Maths as a Science of Patterns [1997], Three.10.3) | |
| A reaction: This gives some indication of how an account of mathematics as a science of patterns might be built up. Presumably the recognition of these 'degrees of strength' cannot be straightforward observation, but will need an a priori component? |
| 6302 | Structuralism must explain why a triangle is a whole, and not a random set of points [Resnik] |
| Full Idea: An objection is that structuralism fails to explain why certain mathematical patterns are unified wholes while others are not; for instance, some think that an ontological account of mathematics must explain why a triangle is not a 'random' set of points. | |
| From: Michael D. Resnik (Maths as a Science of Patterns [1997], Three.10.4) | |
| A reaction: This is an indication that we are not just saying that we recognise patterns in nature, but that we also 'see' various underlying characteristics of the patterns. The obvious suggestion is that we see meta-patterns. |
| 1513 | The Egyptians were the first to say the soul is immortal and reincarnated [Herodotus] |
| Full Idea: The Egyptians were the first to claim that the soul of a human being is immortal, and that each time the body dies the soul enters another creature just as it is being born. | |
| From: Herodotus (The Histories [c.435 BCE], 2.123.2) |