Combining Texts

All the ideas for 'talk', 'Review of Husserl's 'Phil of Arithmetic'' and 'First-Order Modal Logic'

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


71 ideas

2. Reason / D. Definition / 2. Aims of Definition
A definition need not capture the sense of an expression - just get the reference right [Frege, by Dummett]
4. Formal Logic / B. Propositional Logic PL / 2. Tools of Propositional Logic / e. Axioms of PL
Since every definition is an equation, one cannot define equality itself [Frege]
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
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 'constant' domain is the same for all worlds; 'varying' domains can be entirely separate [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
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]
Disj: 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]
Existential: a) if σ ◊X then σ.n X b) if σ ¬□X then σ.n ¬X [n is new] [Fitting/Mendelsohn]
Negation: if σ ¬¬X then σ X [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]
Implic: a) if σ ¬(X→Y) then σ X and σ ¬Y b) if σ X→Y then σ ¬X or σ Y [Fitting/Mendelsohn]
T reflexive: a) if σ □X then σ X b) if σ ¬◊X then σ ¬X [Fitting/Mendelsohn]
4r rev-trans: 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]
B symmetric: a) if σ.n □X then σ X b) if σ.n ¬◊X then σ ¬X [n occurs] [Fitting/Mendelsohn]
D serial: a) if σ □X then σ ◊X b) if σ ¬◊X then σ ¬□X [Fitting/Mendelsohn]
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]
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
Read epistemic box as 'a knows/believes P' and diamond as 'for all a knows/believes, P' [Fitting/Mendelsohn]
In epistemic logic knowers are logically omniscient, so they know that they know [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 corresponds to anti-monotonicity, and the Converse to monotonicity [Fitting/Mendelsohn]
The Barcan says nothing comes into existence; the Converse says nothing ceases; the pair imply stability [Fitting/Mendelsohn]
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 / 4. Using Numbers / e. Counting by correlation
Counting rests on one-one correspondence, of numerals to objects [Frege]
Husserl rests sameness of number on one-one correlation, forgetting the correlation with numbers themselves [Frege]
6. Mathematics / B. Foundations for Mathematics / 5. Definitions of Number / c. Fregean numbers
In a number-statement, something is predicated of a concept [Frege]
6. Mathematics / C. Sources of Mathematics / 1. Mathematical Platonism / a. For mathematical platonism
Our concepts recognise existing relations, they don't change them [Frege]
Numbers are not real like the sea, but (crucially) they are still objective [Frege]
6. Mathematics / C. Sources of Mathematics / 4. Mathematical Empiricism / c. Against mathematical empiricism
The naïve view of number is that it is like a heap of things, or maybe a property of a heap [Frege]
7. Existence / C. Structure of Existence / 7. Abstract/Concrete / b. Levels of abstraction
If objects are just presentation, we get increasing abstraction by ignoring their properties [Frege]
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 / 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]
18. Thought / A. Modes of Thought / 1. Thought
Many people have the same thought, which is the component, not the private presentation [Frege]
18. Thought / E. Abstraction / 3. Abstracta by Ignoring
Disregarding properties of two cats still leaves different objects, but what is now the difference? [Frege]
How do you find the right level of inattention; you eliminate too many or too few characteristics [Frege]
18. Thought / E. Abstraction / 8. Abstractionism Critique
Number-abstraction somehow makes things identical without changing them! [Frege]
19. Language / A. Nature of Meaning / 2. Meaning as Mental
Psychological logicians are concerned with sense of words, but mathematicians study the reference [Frege]
Identity baffles psychologists, since A and B must be presented differently to identify them [Frege]
20. Action / C. Motives for Action / 3. Acting on Reason / b. Intellectualism
Jesus said learning was unnecessary, and only the spirit of the Law was needed [Jesus, by Johnson,P]
22. Metaethics / B. Value / 2. Values / g. Love
Love your enemies [Jesus]
Love thy neighbour as thyself [Jesus]
23. Ethics / B. Contract Ethics / 2. Golden Rule
Treat others as you would have them treat you [Jesus]
23. Ethics / B. Contract Ethics / 4. Value of Authority
Blessed are the merciful: for they shall obtain mercy [Jesus]
23. Ethics / C. Virtue Theory / 2. Elements of Virtue Theory / c. Motivation for virtue
Except ye become as little children, ye shall not enter heaven [Jesus]
23. Ethics / C. Virtue Theory / 2. Elements of Virtue Theory / h. Right feelings
If you lust after a woman, you have committed adultery [Jesus]
23. Ethics / C. Virtue Theory / 3. Virtues / a. Virtues
Blessed are the meek; for they shall inherit the earth [Jesus]
23. Ethics / C. Virtue Theory / 3. Virtues / c. Justice
Don't resist evil, but turn the other cheek [Jesus]
23. Ethics / C. Virtue Theory / 4. External Goods / c. Wealth
It is almost impossible for the rich to go to heaven [Jesus]
28. God / A. Divine Nature / 6. Divine Morality / c. God is the good
No one is good except God [Jesus]
29. Religion / B. Monotheistic Religion / 4. Christianity / a. Christianity
Jesus turned the ideas of Hillel into a theology reduced to its moral elements [Jesus, by Johnson,P]