Combining Texts

All the ideas for 'Function and Concept', 'Confessions of a Philosopher' and 'Introduction to Mathematical Logic'

unexpand these ideas     |    start again     |     specify just one area for these texts


33 ideas

4. Formal Logic / A. Syllogistic Logic / 2. Syllogistic Logic
Frege thought traditional categories had psychological and linguistic impurities [Frege, by Rumfitt]
     Full Idea: Frege rejected the traditional categories as importing psychological and linguistic impurities into logic.
     From: report of Gottlob Frege (Function and Concept [1891]) by Ian Rumfitt - The Boundary Stones of Thought 1.2
     A reaction: Resisting such impurities is the main motivation for making logic entirely symbolic, but it doesn't follow that the traditional categories have to be dropped.
4. Formal Logic / B. Propositional Logic PL / 1. Propositional Logic
Post proved the consistency of propositional logic in 1921 [Walicki]
     Full Idea: A proof of the consistency of propositional logic was given by Emil Post in 1921.
     From: Michal Walicki (Introduction to Mathematical Logic [2012], History E.2.1)
Propositional language can only relate statements as the same or as different [Walicki]
     Full Idea: Propositional language is very rudimentary and has limited powers of expression. The only relation between various statements it can handle is that of identity and difference. As are all the same, but Bs can be different from As.
     From: Michal Walicki (Introduction to Mathematical Logic [2012], 7 Intro)
     A reaction: [second sentence a paraphrase] In predicate logic you could represent two statements as being the same except for one element (an object or predicate or relation or quantifier).
4. Formal Logic / B. Propositional Logic PL / 3. Truth Tables
Boolean connectives are interpreted as functions on the set {1,0} [Walicki]
     Full Idea: Boolean connectives are interpreted as functions on the set {1,0}.
     From: Michal Walicki (Introduction to Mathematical Logic [2012], 5.1)
     A reaction: 1 and 0 are normally taken to be true (T) and false (F). Thus the functions output various combinations of true and false, which are truth tables.
4. Formal Logic / F. Set Theory ST / 3. Types of Set / b. Empty (Null) Set
The empty set is useful for defining sets by properties, when the members are not yet known [Walicki]
     Full Idea: The empty set is mainly a mathematical convenience - defining a set by describing the properties of its members in an involved way, we may not know from the very beginning what its members are.
     From: Michal Walicki (Introduction to Mathematical Logic [2012], 1.1)
The empty set avoids having to take special precautions in case members vanish [Walicki]
     Full Idea: Without the assumption of the empty set, one would often have to take special precautions for the case where a set happened to contain no elements.
     From: Michal Walicki (Introduction to Mathematical Logic [2012], 1.1)
     A reaction: Compare the introduction of the concept 'zero', where special precautions are therefore required. ...But other special precautions are needed without zero. Either he pays us, or we pay him, or ...er. Intersecting sets need the empty set.
4. Formal Logic / F. Set Theory ST / 6. Ordering in Sets
Ordinals play the central role in set theory, providing the model of well-ordering [Walicki]
     Full Idea: Ordinals play the central role in set theory, providing the paradigmatic well-orderings.
     From: Michal Walicki (Introduction to Mathematical Logic [2012], 2.3)
     A reaction: When you draw the big V of the iterative hierarchy of sets (built from successive power sets), the ordinals are marked as a single line up the middle, one ordinal for each level.
5. Theory of Logic / A. Overview of Logic / 1. Overview of Logic
To determine the patterns in logic, one must identify its 'building blocks' [Walicki]
     Full Idea: In order to construct precise and valid patterns of arguments one has to determine their 'building blocks'. One has to identify the basic terms, their kinds and means of combination.
     From: Michal Walicki (Introduction to Mathematical Logic [2012], History Intro)
     A reaction: A deceptively simple and important idea. All explanation requires patterns and levels, and it is the idea of building blocks which makes such things possible. It is right at the centre of our grasp of everything.
5. Theory of Logic / E. Structures of Logic / 5. Functions in Logic
First-level functions have objects as arguments; second-level functions take functions as arguments [Frege]
     Full Idea: Just as functions are fundamentally different from objects, so also functions whose arguments are and must be functions are fundamentally different from functions whose arguments are objects. The latter are first-level, the former second-level, functions.
     From: Gottlob Frege (Function and Concept [1891], p.38)
     A reaction: In 1884 he called it 'second-order'. This is the standard distinction between first- and second-order logic. The first quantifies over objects, the second over intensional entities such as properties and propositions.
5. Theory of Logic / E. Structures of Logic / 6. Relations in Logic
Relations are functions with two arguments [Frege]
     Full Idea: Functions of one argument are concepts; functions of two arguments are relations.
     From: Gottlob Frege (Function and Concept [1891], p.39)
     A reaction: Nowadays we would say 'two or more'. Another interesting move in the aim of analytic philosophy to reduce the puzzling features of the world to mathematical logic. There is, of course, rather more to some relations than being two-argument functions.
5. Theory of Logic / J. Model Theory in Logic / 1. Logical Models
A 'model' of a theory specifies interpreting a language in a domain to make all theorems true [Walicki]
     Full Idea: A specification of a domain of objects, and of the rules for interpreting the symbols of a logical language in this domain such that all the theorems of the logical theory are true is said to be a 'model' of the theory.
     From: Michal Walicki (Introduction to Mathematical Logic [2012], History E.1.3)
     A reaction: The basic ideas of this emerged 1915-30, but it needed Tarski's account of truth to really get it going.
5. Theory of Logic / J. Model Theory in Logic / 3. Löwenheim-Skolem Theorems
The L-S Theorem says no theory (even of reals) says more than a natural number theory [Walicki]
     Full Idea: The L-S Theorem is ...a shocking result, since it implies that any consistent formal theory of everything - even about biology, physics, sets or the real numbers - can just as well be understood as being about natural numbers. It says nothing more.
     From: Michal Walicki (Introduction to Mathematical Logic [2012], History E.2)
     A reaction: Illuminating. Particularly the point that no theory about the real numbers can say anything more than a theory about the natural numbers. So the natural numbers contain all the truths we can ever express? Eh?????
5. Theory of Logic / K. Features of Logics / 1. Axiomatisation
A compact axiomatisation makes it possible to understand a field as a whole [Walicki]
     Full Idea: Having such a compact [axiomatic] presentation of a complicated field [such as Euclid's], makes it possible to relate not only to particular theorems but also to the whole field as such.
     From: Michal Walicki (Introduction to Mathematical Logic [2012], 4.1)
Axiomatic systems are purely syntactic, and do not presuppose any interpretation [Walicki]
     Full Idea: Axiomatic systems, their primitive terms and proofs, are purely syntactic, that is, do not presuppose any interpretation. ...[142] They never address the world directly, but address a possible semantic model which formally represents the world.
     From: Michal Walicki (Introduction to Mathematical Logic [2012], 4.1)
6. Mathematics / A. Nature of Mathematics / 3. Nature of Numbers / e. Ordinal numbers
Ordinals are transitive sets of transitive sets; or transitive sets totally ordered by inclusion [Walicki]
     Full Idea: An ordinal can be defined as a transitive set of transitive sets, or else, as a transitive set totally ordered by set inclusion.
     From: Michal Walicki (Introduction to Mathematical Logic [2012], 2.3)
Ordinals are the empty set, union with the singleton, and any arbitrary union of ordinals [Walicki]
     Full Idea: The collection of ordinals is defined inductively: Basis: the empty set is an ordinal; Ind: for an ordinal x, the union with its singleton is also an ordinal; and any arbitrary (possibly infinite) union of ordinals is an ordinal.
     From: Michal Walicki (Introduction to Mathematical Logic [2012], 2.3)
     A reaction: [symbolism translated into English] Walicki says they are called 'ordinal numbers', but are in fact a set.
The union of finite ordinals is the first 'limit ordinal'; 2ω is the second... [Walicki]
     Full Idea: We can form infinite ordinals by taking unions of ordinals. We can thus form 'limit ordinals', which have no immediate predecessor. ω is the first (the union of all finite ordinals), ω + ω = sω is second, 3ω the third....
     From: Michal Walicki (Introduction to Mathematical Logic [2012], 2.3)
Two infinite ordinals can represent a single infinite cardinal [Walicki]
     Full Idea: There may be several ordinals for the same cardinality. ...Two ordinals can represent different ways of well-ordering the same number (aleph-0) of elements.
     From: Michal Walicki (Introduction to Mathematical Logic [2012], 2.3)
     A reaction: This only applies to infinite ordinals and cardinals. For the finite, the two coincide. In infinite arithmetic the rules are different.
Members of ordinals are ordinals, and also subsets of ordinals [Walicki]
     Full Idea: Every member of an ordinal is itself an ordinal, and every ordinal is a transitive set (its members are also its subsets; a member of a member of an ordinal is also a member of the ordinal).
     From: Michal Walicki (Introduction to Mathematical Logic [2012], 2.3)
6. Mathematics / B. Foundations for Mathematics / 3. Axioms for Geometry
In non-Euclidean geometry, all Euclidean theorems are valid that avoid the fifth postulate [Walicki]
     Full Idea: Since non-Euclidean geometry preserves all Euclid's postulates except the fifth one, all the theorems derived without the use of the fifth postulate remain valid.
     From: Michal Walicki (Introduction to Mathematical Logic [2012], 4.1)
6. Mathematics / B. Foundations for Mathematics / 4. Axioms for Number / f. Mathematical induction
Inductive proof depends on the choice of the ordering [Walicki]
     Full Idea: Inductive proof is not guaranteed to work in all cases and, particularly, it depends heavily on the choice of the ordering.
     From: Michal Walicki (Introduction to Mathematical Logic [2012], 2.1.1)
     A reaction: There has to be an well-founded ordering for inductive proofs to be possible.
6. Mathematics / C. Sources of Mathematics / 6. Logicism / a. Early logicism
Arithmetic is a development of logic, so arithmetical symbolism must expand into logical symbolism [Frege]
     Full Idea: I am of the opinion that arithmetic is a further development of logic, which leads to the requirement that the symbolic language of arithmetic must be expanded into a logical symbolism.
     From: Gottlob Frege (Function and Concept [1891], p.30)
     A reaction: This may the the one key idea at the heart of modern analytic philosophy (even though logicism may be a total mistake!). Logic and arithmetical foundations become the master of ontology, instead of the servant. The jury is out on the whole enterprise.
7. Existence / A. Nature of Existence / 6. Criterion for Existence
Frege takes the existence of horses to be part of their concept [Frege, by Sommers]
     Full Idea: Frege regarded the existence of horses as a property of the concept 'horse'.
     From: report of Gottlob Frege (Function and Concept [1891]) by Fred Sommers - Intellectual Autobiography 'Realism'
8. Modes of Existence / B. Properties / 10. Properties as Predicates
Frege allows either too few properties (as extensions) or too many (as predicates) [Mellor/Oliver on Frege]
     Full Idea: Frege's theory of properties (which he calls 'concepts') yields too few properties, by identifying coextensive properties, and also too many, by letting every predicate express a property.
     From: comment on Gottlob Frege (Function and Concept [1891]) by DH Mellor / A Oliver - Introduction to 'Properties' §2
     A reaction: Seems right; one extension may have two properties (have heart/kidneys), two predicates might express the same property. 'Cutting nature at the joints' covers properties as well as objects.
9. Objects / A. Existence of Objects / 3. Objects in Thought
The concept 'object' is too simple for analysis; unlike a function, it is an expression with no empty place [Frege]
     Full Idea: I regard a regular definition of 'object' as impossible, since it is too simple to admit of logical analysis. Briefly: an object is anything that is not a function, so that an expression for it does not contain any empty place.
     From: Gottlob Frege (Function and Concept [1891], p.32)
     A reaction: Here is the core of the programme for deriving our ontology from our logic and language, followed through by Russell and Quine. Once we extend objects beyond the physical, it becomes incredibly hard to individuate them.
10. Modality / A. Necessity / 2. Nature of Necessity
Scotus based modality on semantic consistency, instead of on what the future could allow [Walicki]
     Full Idea: The link between time and modality was severed by Duns Scotus, who proposed a notion of possibility based purely on the notion of semantic consistency. 'Possible' means for him logically possible, that is, not involving contradiction.
     From: Michal Walicki (Introduction to Mathematical Logic [2012], History B.4)
16. Persons / C. Self-Awareness / 3. Limits of Introspection
Why don't we experience or remember going to sleep at night? [Magee]
     Full Idea: As a child it was incomprehensible to me that I did not experience going to sleep, and never remembered it. When my sister said 'Nobody remembers that', I just thought 'How does she know?'
     From: Bryan Magee (Confessions of a Philosopher [1997], Ch.I)
     A reaction: This is actually evidence for something - that we do not have some sort of personal identity which is separate from consciousness, so that "I am conscious" would literally mean that an item has a property, which it can lose.
18. Thought / D. Concepts / 3. Ontology of Concepts / c. Fregean concepts
Concepts are the ontological counterparts of predicative expressions [Frege, by George/Velleman]
     Full Idea: Concepts, for Frege, are the ontological counterparts of predicative expressions.
     From: report of Gottlob Frege (Function and Concept [1891]) by A.George / D.J.Velleman - Philosophies of Mathematics Ch.2
     A reaction: That sounds awfully like what many philosophers call 'universals'. Frege, as a platonist (at least about numbers), I would take to be in sympathy with that. At least we can say that concepts seem to be properties.
An assertion about the concept 'horse' must indirectly speak of an object [Frege, by Hale]
     Full Idea: Frege had a notorious difficulty over the concept 'horse', when he suggests that if we wish to assert something about a concept, we are obliged to proceed indirectly by speaking of an object that represents it.
     From: report of Gottlob Frege (Function and Concept [1891], Ch.2.II) by Bob Hale - Abstract Objects
     A reaction: This sounds like the thin end of a wedge. The great champion of objects is forced to accept them here as a façon de parler, when elsewhere they have ontological status.
A concept is a function whose value is always a truth-value [Frege]
     Full Idea: A concept in logic is closely connected with what we call a function. Indeed, we may say at once: a concept is a function whose value is always a truth-value. ..I give the name 'function' to what is meant by the 'unsaturated' part.
     From: Gottlob Frege (Function and Concept [1891], p.30)
     A reaction: So a function becomes a concept when the variable takes a value. Problems arise when the value is vague, or the truth-value is indeterminable.
18. Thought / D. Concepts / 4. Structure of Concepts / a. Conceptual structure
Unlike objects, concepts are inherently incomplete [Frege, by George/Velleman]
     Full Idea: For Frege, concepts differ from objects in being inherently incomplete in nature.
     From: report of Gottlob Frege (Function and Concept [1891]) by A.George / D.J.Velleman - Philosophies of Mathematics Ch.2
     A reaction: This is because they are 'unsaturated', needing a quantified variable to complete the sentence. This could be a pointer towards Quine's view of properties, as simply an intrinsic feature of predication about objects, with no separate identity.
19. Language / B. Reference / 5. Speaker's Reference
I may regard a thought about Phosphorus as true, and the same thought about Hesperus as false [Frege]
     Full Idea: From sameness of meaning there does not follow sameness of thought expressed. A fact about the Morning Star may express something different from a fact about the Evening Star, as someone may regard one as true and the other false.
     From: Gottlob Frege (Function and Concept [1891], p.14)
     A reaction: This all gets clearer if we distinguish internalist and externalist theories of content. Why take sides on this? Why not just ask 'what is in the speaker's head?', 'what does the sentence mean in the community?', and 'what is the corresponding situation?'
28. God / B. Proving God / 2. Proofs of Reason / b. Ontological Proof critique
The Ontological Argument fallaciously treats existence as a first-level concept [Frege]
     Full Idea: The ontological proof of God's existence suffers from the fallacy of treating existence as a first-level concept.
     From: Gottlob Frege (Function and Concept [1891], p.38 n)
     A reaction: [See Idea 8490 for first- and second-order functions] This is usually summarised as the idea that existence is a quantifier rather than a predicate.