39 ideas
| 10888 | Sets can be defined by 'enumeration', or by 'abstraction' (based on a property) [Zalabardo] |
| Full Idea: We can define a set by 'enumeration' (by listing the items, within curly brackets), or by 'abstraction' (by specifying the elements as instances of a property), pretending that they form a determinate totality. The latter is written {x | x is P}. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §1.3) |
| 10859 | A set is 'well-ordered' if every subset has a first element [Clegg] |
| Full Idea: For a set to be 'well-ordered' it is required that every subset of the set has a first element. | |
| From: Brian Clegg (Infinity: Quest to Think the Unthinkable [2003], Ch.13) |
| 10889 | The 'Cartesian Product' of two sets relates them by pairing every element with every element [Zalabardo] |
|
Full Idea:
The 'Cartesian Product' of two sets, written A x B, is the relation which pairs every element of A with every element of B. So A x B = { |
|
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §1.6) |
| 10890 | A 'partial ordering' is reflexive, antisymmetric and transitive [Zalabardo] |
| Full Idea: A binary relation in a set is a 'partial ordering' just in case it is reflexive, antisymmetric and transitive. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §1.6) |
| 10857 | Set theory made a closer study of infinity possible [Clegg] |
| Full Idea: Set theory made a closer study of infinity possible. | |
| From: Brian Clegg (Infinity: Quest to Think the Unthinkable [2003], Ch.13) |
| 10864 | Any set can always generate a larger set - its powerset, of subsets [Clegg] |
| Full Idea: The idea of the 'power set' means that it is always possible to generate a bigger one using only the elements of that set, namely the set of all its subsets. | |
| From: Brian Clegg (Infinity: Quest to Think the Unthinkable [2003], Ch.14) |
| 10886 | Determinacy: an object is either in a set, or it isn't [Zalabardo] |
| Full Idea: Principle of Determinacy: For every object a and every set S, either a is an element of S or a is not an element of S. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §1.2) |
| 10872 | Extensionality: Two sets are equal if and only if they have the same elements [Clegg] |
| Full Idea: Axiom of Extension: Two sets are equal if and only if they have the same elements. | |
| From: Brian Clegg (Infinity: Quest to Think the Unthinkable [2003], Ch.15) |
| 10875 | Pairing: For any two sets there exists a set to which they both belong [Clegg] |
| Full Idea: Axiom of Pairing: For any two sets there exists a set to which they both belong. So you can make a set out of two other sets. | |
| From: Brian Clegg (Infinity: Quest to Think the Unthinkable [2003], Ch.15) |
| 10876 | Unions: There is a set of all the elements which belong to at least one set in a collection [Clegg] |
| Full Idea: Axiom of Unions: For every collection of sets there exists a set that contains all the elements that belong to at least one of the sets in the collection. | |
| From: Brian Clegg (Infinity: Quest to Think the Unthinkable [2003], Ch.15) |
| 10878 | Infinity: There exists a set of the empty set and the successor of each element [Clegg] |
| Full Idea: Axiom of Infinity: There exists a set containing the empty set and the successor of each of its elements. | |
| From: Brian Clegg (Infinity: Quest to Think the Unthinkable [2003], Ch.15) | |
| A reaction: This is rather different from the other axioms because it contains the notion of 'successor', though that can be generated by an ordering procedure. |
| 10877 | Powers: All the subsets of a given set form their own new powerset [Clegg] |
| Full Idea: Axiom of Powers: For each set there exists a collection of sets that contains amongst its elements all the subsets of the given set. | |
| From: Brian Clegg (Infinity: Quest to Think the Unthinkable [2003], Ch.15) | |
| A reaction: Obviously this must include the whole of the base set (i.e. not just 'proper' subsets), otherwise the new set would just be a duplicate of the base set. |
| 10879 | Choice: For every set a mechanism will choose one member of any non-empty subset [Clegg] |
| Full Idea: Axiom of Choice: For every set we can provide a mechanism for choosing one member of any non-empty subset of the set. | |
| From: Brian Clegg (Infinity: Quest to Think the Unthinkable [2003], Ch.15) | |
| A reaction: This axiom is unusual because it makes the bold claim that such a 'mechanism' can always be found. Cohen showed that this axiom is separate. The tricky bit is choosing from an infinite subset. |
| 10871 | Axiom of Existence: there exists at least one set [Clegg] |
| Full Idea: Axiom of Existence: there exists at least one set. This may be the empty set, but you need to start with something. | |
| From: Brian Clegg (Infinity: Quest to Think the Unthinkable [2003], Ch.15) |
| 10887 | Specification: Determinate totals of objects always make a set [Zalabardo] |
| Full Idea: Principle of Specification: Whenever we can specify a determinate totality of objects, we shall say that there is a set whose elements are precisely the objects that we have specified. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §1.3) | |
| A reaction: Compare the Axiom of Specification. Zalabardo says we may wish to consider sets of which we cannot specify the members. |
| 10874 | Specification: a condition applied to a set will always produce a new set [Clegg] |
| Full Idea: Axiom of Specification: For every set and every condition, there corresponds a set whose elements are exactly the same as those elements of the original set for which the condition is true. So the concept 'number is even' produces a set from the integers. | |
| From: Brian Clegg (Infinity: Quest to Think the Unthinkable [2003], Ch.15) | |
| A reaction: What if the condition won't apply to the set? 'Number is even' presumably won't produce a set if it is applied to a set of non-numbers. |
| 10897 | A first-order 'sentence' is a formula with no free variables [Zalabardo] |
| Full Idea: A formula of a first-order language is a 'sentence' just in case it has no free variables. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §3.2) |
| 10899 | Γ |= φ if φ is true when all of Γ is true, for all structures and interpretations [Zalabardo] |
| Full Idea: A formula is the 'logical consequence' of a set of formulas (Γ |= φ) if for every structure in the language and every variable interpretation of the structure, if all the formulas within the set are true and the formula itself is true. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §3.5) |
| 10893 | Γ |= φ for sentences if φ is true when all of Γ is true [Zalabardo] |
| Full Idea: A propositional logic sentence is a 'logical consequence' of a set of sentences (written Γ |= φ) if for every admissible truth-assignment all the sentences in the set Γ are true, then φ is true. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §2.4) | |
| A reaction: The definition is similar for predicate logic. |
| 10896 | Propositional logic just needs ¬, and one of ∧, ∨ and → [Zalabardo] |
| Full Idea: In propositional logic, any set containing ¬ and at least one of ∧, ∨ and → is expressively complete. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §2.8) |
| 10898 | The semantics shows how truth values depend on instantiations of properties and relations [Zalabardo] |
| Full Idea: The semantic pattern of a first-order language is the ways in which truth values depend on which individuals instantiate the properties and relations which figure in them. ..So we pair a truth value with each combination of individuals, sets etc. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §3.3) | |
| A reaction: So truth reduces to a combination of 'instantiations', which is rather like 'satisfaction'. |
| 10902 | We can do semantics by looking at given propositions, or by building new ones [Zalabardo] |
| Full Idea: We can look at semantics from the point of view of how truth values are determined by instantiations of properties and relations, or by asking how we can build, using the resources of the language, a proposition corresponding to a given semantic pattern. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §3.6) | |
| A reaction: The second version of semantics is model theory. |
| 10892 | We make a truth assignment to T and F, which may be true and false, but merely differ from one another [Zalabardo] |
| Full Idea: A truth assignment is a function from propositions to the set {T,F}. We will think of T and F as the truth values true and false, but for our purposes all we need to assume about the identity of these objects is that they are different from each other. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §2.4) | |
| A reaction: Note that T and F are 'objects'. This remark is important in understanding modern logical semantics. T and F can be equated to 1 and 0 in the language of a computer. They just mean as much as you want them to mean. |
| 10895 | 'Logically true' (|= φ) is true for every truth-assignment [Zalabardo] |
| Full Idea: A propositional logic sentence is 'logically true', written |= φ, if it is true for every admissible truth-assignment. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §2.4) |
| 10900 | Logically true sentences are true in all structures [Zalabardo] |
| Full Idea: In first-order languages, logically true sentences are true in all structures. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §3.5) |
| 10894 | A sentence-set is 'satisfiable' if at least one truth-assignment makes them all true [Zalabardo] |
| Full Idea: A propositional logic set of sentences Γ is 'satisfiable' if there is at least one admissible truth-assignment that makes all of its sentences true. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §2.4) |
| 10901 | Some formulas are 'satisfiable' if there is a structure and interpretation that makes them true [Zalabardo] |
| Full Idea: A set of formulas of a first-order language is 'satisfiable' if there is a structure and a variable interpretation in that structure such that all the formulas of the set are true. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §3.5) |
| 10903 | A structure models a sentence if it is true in the model, and a set of sentences if they are all true in the model [Zalabardo] |
| Full Idea: A structure is a model of a sentence if the sentence is true in the model; a structure is a model of a set of sentences if they are all true in the structure. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §3.6) |
| 10880 | Mathematics can be 'pure' (unapplied), 'real' (physically grounded); or 'applied' (just applicable) [Clegg] |
| Full Idea: Three views of mathematics: 'pure' mathematics, where it doesn't matter if it could ever have any application; 'real' mathematics, where every concept must be physically grounded; and 'applied' mathematics, using the non-real if the results are real. | |
| From: Brian Clegg (Infinity: Quest to Think the Unthinkable [2003], Ch.17) | |
| A reaction: Very helpful. No one can deny the activities of 'pure' mathematics, but I think it is undeniable that the origins of the subject are 'real' (rather than platonic). We do economics by pretending there are concepts like the 'average family'. |
| 10860 | An ordinal number is defined by the set that comes before it [Clegg] |
| Full Idea: You can think of an ordinal number as being defined by the set that comes before it, so, in the non-negative integers, ordinal 5 is defined as {0, 1, 2, 3, 4}. | |
| From: Brian Clegg (Infinity: Quest to Think the Unthinkable [2003], Ch.13) |
| 10861 | Beyond infinity cardinals and ordinals can come apart [Clegg] |
| Full Idea: With ordinary finite numbers ordinals and cardinals are in effect the same, but beyond infinity it is possible for two sets to have the same cardinality but different ordinals. | |
| From: Brian Clegg (Infinity: Quest to Think the Unthinkable [2003], Ch.13) |
| 10854 | Transcendental numbers can't be fitted to finite equations [Clegg] |
| Full Idea: The 'transcendental numbers' are those irrationals that can't be fitted to a suitable finite equation, of which π is far and away the best known. | |
| From: Brian Clegg (Infinity: Quest to Think the Unthinkable [2003], Ch. 6) |
| 10858 | By adding an axis of imaginary numbers, we get the useful 'number plane' instead of number line [Clegg] |
| Full Idea: The realisation that brought 'i' into the toolkit of physicists and engineers was that you could extend the 'number line' into a new dimension, with an imaginary number axis at right angles to it. ...We now have a 'number plane'. | |
| From: Brian Clegg (Infinity: Quest to Think the Unthinkable [2003], Ch.12) |
| 10853 | Either lack of zero made early mathematics geometrical, or the geometrical approach made zero meaningless [Clegg] |
| Full Idea: It is a chicken-and-egg problem, whether the lack of zero forced forced classical mathematicians to rely mostly on a geometric approach to mathematics, or the geometric approach made 0 a meaningless concept, but the two remain strongly tied together. | |
| From: Brian Clegg (Infinity: Quest to Think the Unthinkable [2003], Ch. 6) |
| 10866 | Cantor's account of infinities has the shaky foundation of irrational numbers [Clegg] |
| Full Idea: As far as Kronecker was concerned, Cantor had built a whole structure on the irrational numbers, and so that structure had no foundation at all. | |
| From: Brian Clegg (Infinity: Quest to Think the Unthinkable [2003], Ch.15) |
| 10869 | The Continuum Hypothesis is independent of the axioms of set theory [Clegg] |
| Full Idea: Paul Cohen showed that the Continuum Hypothesis is independent of the axioms of set theory. | |
| From: Brian Clegg (Infinity: Quest to Think the Unthinkable [2003], Ch.15) |
| 10862 | The 'continuum hypothesis' says aleph-one is the cardinality of the reals [Clegg] |
| Full Idea: The 'continuum hypothesis' says that aleph-one is the cardinality of the rational and irrational numbers. | |
| From: Brian Clegg (Infinity: Quest to Think the Unthinkable [2003], Ch.14) |
| 10891 | If a set is defined by induction, then proof by induction can be applied to it [Zalabardo] |
| Full Idea: Defining a set by induction enables us to use the method of proof by induction to establish that all the elements of the set have a certain property. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §2.3) |
| 8628 | I hold that algebra and number are developments of logic [Jevons] |
| Full Idea: I hold that algebra is a highly developed logic, and number but logical discrimination. | |
| From: William S. Jevons (The Principles of Science [1879], p.156), quoted by Gottlob Frege - Grundlagen der Arithmetik (Foundations) §15 | |
| A reaction: Thus Frege shows that logicism was an idea that was in the air before he started writing. Riemann's geometry and Boole's logic presumably had some influence here. |