Combining Texts

All the ideas for 'The Evolution of Modern Metaphysics', 'First-Order Modal Logic' and 'Introduction to Mathematical Philosophy'

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


100 ideas

1. Philosophy / E. Nature of Metaphysics / 1. Nature of Metaphysics
Metaphysics is the most general attempt to make sense of things [Moore,AW]
1. Philosophy / F. Analytic Philosophy / 5. Linguistic Analysis
'Socrates is human' expresses predication, and 'Socrates is a man' expresses identity [Russell]
2. Reason / D. Definition / 3. Types of Definition
A definition by 'extension' enumerates items, and one by 'intension' gives a defining property [Russell]
2. Reason / F. Fallacies / 8. Category Mistake / a. Category mistakes
The sentence 'procrastination drinks quadruplicity' is meaningless, rather than false [Russell, by Orenstein]
3. Truth / F. Semantic Truth / 1. Tarski's Truth / b. Satisfaction and truth
An argument 'satisfies' a function φx if φa is true [Russell]
4. Formal Logic / A. Syllogistic Logic / 2. Syllogistic Logic
The Darapti syllogism is fallacious: All M is S, all M is P, so some S is P' - but if there is no M? [Russell]
4. Formal Logic / B. Propositional Logic PL / 3. Truth Tables
Each line of a truth table is a model [Fitting/Mendelsohn]
4. Formal Logic / D. Modal Logic ML / 2. Tools of Modal Logic / a. Symbols of ML
Modal logic adds □ (necessarily) and ◊ (possibly) to classical logic [Fitting/Mendelsohn]
We let 'R' be the accessibility relation: xRy is read 'y is accessible from x' [Fitting/Mendelsohn]
The symbol ||- is the 'forcing' relation; 'Γ ||- P' means that P is true in world Γ [Fitting/Mendelsohn]
The prefix σ names a possible world, and σ.n names a world accessible from that one [Fitting/Mendelsohn]
4. Formal Logic / D. Modal Logic ML / 2. Tools of Modal Logic / b. Terminology of ML
A 'constant' domain is the same for all worlds; 'varying' domains can be entirely separate [Fitting/Mendelsohn]
Modern modal logic introduces 'accessibility', saying xRy means 'y is accessible from x' [Fitting/Mendelsohn]
A 'model' is a frame plus specification of propositions true at worlds, written < G,R,||- > [Fitting/Mendelsohn]
A 'frame' is a set G of possible worlds, with an accessibility relation R, written < G,R > [Fitting/Mendelsohn]
Accessibility relations can be 'reflexive' (self-referring), 'transitive' (carries over), or 'symmetric' (mutual) [Fitting/Mendelsohn]
4. Formal Logic / D. Modal Logic ML / 2. Tools of Modal Logic / c. Derivation rules of ML
S5: a) if n ◊X then kX b) if n ¬□X then k ¬X c) if n □X then k X d) if n ¬◊X then k ¬X [Fitting/Mendelsohn]
Negation: if σ ¬¬X then σ X [Fitting/Mendelsohn]
Disj: a) if σ ¬(X∨Y) then σ ¬X and σ ¬Y b) if σ X∨Y then σ X or σ Y [Fitting/Mendelsohn]
Existential: a) if σ ◊X then σ.n X b) if σ ¬□X then σ.n ¬X [n is new] [Fitting/Mendelsohn]
T reflexive: a) if σ □X then σ X b) if σ ¬◊X then σ ¬X [Fitting/Mendelsohn]
D serial: a) if σ □X then σ ◊X b) if σ ¬◊X then σ ¬□X [Fitting/Mendelsohn]
B symmetric: a) if σ.n □X then σ X b) if σ.n ¬◊X then σ ¬X [n occurs] [Fitting/Mendelsohn]
4 transitive: a) if σ □X then σ.n □X b) if σ ¬◊X then σ.n ¬◊X [n occurs] [Fitting/Mendelsohn]
4r rev-trans: a) if σ.n □X then σ □X b) if σ.n ¬◊X then σ ¬◊X [n occurs] [Fitting/Mendelsohn]
If a proposition is possibly true in a world, it is true in some world accessible from that world [Fitting/Mendelsohn]
If a proposition is necessarily true in a world, it is true in all worlds accessible from that world [Fitting/Mendelsohn]
Conj: a) if σ X∧Y then σ X and σ Y b) if σ ¬(X∧Y) then σ ¬X or σ ¬Y [Fitting/Mendelsohn]
Bicon: a)if σ(X↔Y) then σ(X→Y) and σ(Y→X) b) [not biconditional, one or other fails] [Fitting/Mendelsohn]
Implic: a) if σ ¬(X→Y) then σ X and σ ¬Y b) if σ X→Y then σ ¬X or σ Y [Fitting/Mendelsohn]
Universal: a) if σ ¬◊X then σ.m ¬X b) if σ □X then σ.m X [m exists] [Fitting/Mendelsohn]
4. Formal Logic / D. Modal Logic ML / 3. Modal Logic Systems / b. System K
The system K has no accessibility conditions [Fitting/Mendelsohn]
4. Formal Logic / D. Modal Logic ML / 3. Modal Logic Systems / c. System D
□P → P is not valid in D (Deontic Logic), since an obligatory action may be not performed [Fitting/Mendelsohn]
The system D has the 'serial' conditon imposed on its accessibility relation [Fitting/Mendelsohn]
4. Formal Logic / D. Modal Logic ML / 3. Modal Logic Systems / d. System T
The system T has the 'reflexive' conditon imposed on its accessibility relation [Fitting/Mendelsohn]
4. Formal Logic / D. Modal Logic ML / 3. Modal Logic Systems / e. System K4
The system K4 has the 'transitive' condition on its accessibility relation [Fitting/Mendelsohn]
4. Formal Logic / D. Modal Logic ML / 3. Modal Logic Systems / f. System B
The system B has the 'reflexive' and 'symmetric' conditions on its accessibility relation [Fitting/Mendelsohn]
4. Formal Logic / D. Modal Logic ML / 3. Modal Logic Systems / g. System S4
The system S4 has the 'reflexive' and 'transitive' conditions on its accessibility relation [Fitting/Mendelsohn]
4. Formal Logic / D. Modal Logic ML / 3. Modal Logic Systems / h. System S5
System S5 has the 'reflexive', 'symmetric' and 'transitive' conditions on its accessibility relation [Fitting/Mendelsohn]
4. Formal Logic / D. Modal Logic ML / 4. Alethic Modal Logic
Modality affects content, because P→◊P is valid, but ◊P→P isn't [Fitting/Mendelsohn]
4. Formal Logic / D. Modal Logic ML / 5. Epistemic Logic
In epistemic logic knowers are logically omniscient, so they know that they know [Fitting/Mendelsohn]
Read epistemic box as 'a knows/believes P' and diamond as 'for all a knows/believes, P' [Fitting/Mendelsohn]
4. Formal Logic / D. Modal Logic ML / 6. Temporal Logic
F: will sometime, P: was sometime, G: will always, H: was always [Fitting/Mendelsohn]
4. Formal Logic / D. Modal Logic ML / 7. Barcan Formula
The Barcan says nothing comes into existence; the Converse says nothing ceases; the pair imply stability [Fitting/Mendelsohn]
The Barcan corresponds to anti-monotonicity, and the Converse to monotonicity [Fitting/Mendelsohn]
4. Formal Logic / F. Set Theory ST / 3. Types of Set / d. Infinite Sets
We can enumerate finite classes, but an intensional definition is needed for infinite classes [Russell]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / b. Axiom of Extensionality I
Members define a unique class, whereas defining characteristics are numerous [Russell]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / f. Axiom of Infinity V
Infinity says 'for any inductive cardinal, there is a class having that many terms' [Russell]
We may assume that there are infinite collections, as there is no logical reason against them [Russell]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / j. Axiom of Choice IX
The British parliament has one representative selected from each constituency [Russell]
Choice shows that if any two cardinals are not equal, one must be the greater [Russell]
Choice is equivalent to the proposition that every class is well-ordered [Russell]
We can pick all the right or left boots, but socks need Choice to insure the representative class [Russell]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / p. Axiom of Reducibility
Reducibility: a family of functions is equivalent to a single type of function [Russell]
4. Formal Logic / F. Set Theory ST / 5. Conceptions of Set / c. Logical sets
Propositions about classes can be reduced to propositions about their defining functions [Russell]
4. Formal Logic / F. Set Theory ST / 7. Natural Sets
Russell's proposal was that only meaningful predicates have sets as their extensions [Russell, by Orenstein]
4. Formal Logic / F. Set Theory ST / 8. Critique of Set Theory
Classes are logical fictions, and are not part of the ultimate furniture of the world [Russell]
5. Theory of Logic / A. Overview of Logic / 4. Pure Logic
All the propositions of logic are completely general [Russell]
5. Theory of Logic / A. Overview of Logic / 8. Logic of Mathematics
In modern times, logic has become mathematical, and mathematics has become logical [Russell]
5. Theory of Logic / C. Ontology of Logic / 1. Ontology of Logic
Logic can only assert hypothetical existence [Russell]
Logic is concerned with the real world just as truly as zoology [Russell]
Logic can be known a priori, without study of the actual world [Russell]
5. Theory of Logic / F. Referring in Logic / 1. Naming / b. Names as descriptive
Asking 'Did Homer exist?' is employing an abbreviated description [Russell]
Russell admitted that even names could also be used as descriptions [Russell, by Bach]
Names are really descriptions, except for a few words like 'this' and 'that' [Russell]
5. Theory of Logic / F. Referring in Logic / 1. Naming / f. Names eliminated
The only genuine proper names are 'this' and 'that' [Russell]
5. Theory of Logic / F. Referring in Logic / 2. Descriptions / a. Descriptions
'I met a unicorn' is meaningful, and so is 'unicorn', but 'a unicorn' is not [Russell]
5. Theory of Logic / F. Referring in Logic / 3. Property (λ-) Abstraction
'Predicate abstraction' abstracts predicates from formulae, giving scope for constants and functions [Fitting/Mendelsohn]
6. Mathematics / A. Nature of Mathematics / 2. Geometry
If straight lines were like ratios they might intersect at a 'gap', and have no point in common [Russell]
6. Mathematics / A. Nature of Mathematics / 3. Nature of Numbers / b. Types of number
New numbers solve problems: negatives for subtraction, fractions for division, complex for equations [Russell]
6. Mathematics / A. Nature of Mathematics / 3. Nature of Numbers / c. Priority of numbers
Could a number just be something which occurs in a progression? [Russell, by Hart,WD]
6. Mathematics / A. Nature of Mathematics / 3. Nature of Numbers / i. Reals from cuts
A series can be 'Cut' in two, where the lower class has no maximum, the upper no minimum [Russell]
6. Mathematics / A. Nature of Mathematics / 3. Nature of Numbers / j. Complex numbers
A complex number is simply an ordered couple of real numbers [Russell]
6. Mathematics / A. Nature of Mathematics / 3. Nature of Numbers / m. One
Discovering that 1 is a number was difficult [Russell]
6. Mathematics / A. Nature of Mathematics / 4. Using Numbers / c. Counting procedure
Numbers are needed for counting, so they need a meaning, and not just formal properties [Russell]
6. Mathematics / A. Nature of Mathematics / 4. Using Numbers / f. Arithmetic
The formal laws of arithmetic are the Commutative, the Associative and the Distributive [Russell]
6. Mathematics / A. Nature of Mathematics / 5. The Infinite / a. The Infinite
Infinity and continuity used to be philosophy, but are now mathematics [Russell]
6. Mathematics / B. Foundations for Mathematics / 4. Axioms for Number / a. Axioms for numbers
The definition of order needs a transitive relation, to leap over infinite intermediate terms [Russell]
6. Mathematics / B. Foundations for Mathematics / 4. Axioms for Number / d. Peano arithmetic
Any founded, non-repeating series all reachable in steps will satisfy Peano's axioms [Russell]
'0', 'number' and 'successor' cannot be defined by Peano's axioms [Russell]
6. Mathematics / B. Foundations for Mathematics / 5. Definitions of Number / d. Hume's Principle
A number is something which characterises collections of the same size [Russell]
6. Mathematics / B. Foundations for Mathematics / 7. Mathematical Structuralism / a. Structuralism
What matters is the logical interrelation of mathematical terms, not their intrinsic nature [Russell]
6. Mathematics / C. Sources of Mathematics / 5. Numbers as Adjectival
Maybe numbers are adjectives, since 'ten men' grammatically resembles 'white men' [Russell]
6. Mathematics / C. Sources of Mathematics / 6. Logicism / a. Early logicism
For Russell, numbers are sets of equivalent sets [Russell, by Benacerraf]
6. Mathematics / C. Sources of Mathematics / 10. Constructivism / e. Psychologism
There is always something psychological about inference [Russell]
7. Existence / A. Nature of Existence / 1. Nature of Existence
Existence can only be asserted of something described, not of something named [Russell]
7. Existence / D. Theories of Reality / 7. Fictionalism
Classes are logical fictions, made from defining characteristics [Russell]
8. Modes of Existence / A. Relations / 4. Formal Relations / a. Types of relation
If a relation is symmetrical and transitive, it has to be reflexive [Russell]
'Asymmetry' is incompatible with its converse; a is husband of b, so b can't be husband of a [Russell]
9. Objects / D. Essence of Objects / 3. Individual Essences
The essence of individuality is beyond description, and hence irrelevant to science [Russell]
9. Objects / F. Identity among Objects / 7. Indiscernible Objects
The Indiscernibility of Identicals has been a big problem for modal logic [Fitting/Mendelsohn]
10. Modality / B. Possibility / 8. Conditionals / c. Truth-function conditionals
Inferring q from p only needs p to be true, and 'not-p or q' to be true [Russell]
All forms of implication are expressible as truth-functions [Russell]
10. Modality / E. Possible worlds / 1. Possible Worlds / a. Possible worlds
If something is true in all possible worlds then it is logically necessary [Russell]
10. Modality / E. Possible worlds / 3. Transworld Objects / a. Transworld identity
□ must be sensitive as to whether it picks out an object by essential or by contingent properties [Fitting/Mendelsohn]
Objects retain their possible properties across worlds, so a bundle theory of them seems best [Fitting/Mendelsohn]
10. Modality / E. Possible worlds / 3. Transworld Objects / c. Counterparts
Counterpart relations are neither symmetric nor transitive, so there is no logic of equality for them [Fitting/Mendelsohn]
11. Knowledge Aims / C. Knowing Reality / 3. Idealism / b. Transcendental idealism
Appearances are nothing beyond representations, which is transcendental ideality [Moore,AW]
14. Science / B. Scientific Theories / 1. Scientific Theory
Mathematically expressed propositions are true of the world, but how to interpret them? [Russell]
19. Language / D. Propositions / 1. Propositions
Propositions are mainly verbal expressions of true or false, and perhaps also symbolic thoughts [Russell]