Combining Texts

All the ideas for 'Individuals without Sortals', 'Are there propositions?' and 'First-Order Modal Logic'

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


72 ideas

3. Truth / C. Correspondence Truth / 2. Correspondence to Facts
A true proposition seems true of one fact, but a false proposition seems true of nothing at all. [Ryle]
3. Truth / C. Correspondence Truth / 3. Correspondence Truth critique
Two maps might correspond to one another, but they are only 'true' of the country they show [Ryle]
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]
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]
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]
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]
5. Theory of Logic / A. Overview of Logic / 1. Overview of Logic
Logic studies consequence, compatibility, contradiction, corroboration, necessitation, grounding.... [Ryle]
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 / d. Counting via concepts
Counting 'coin in this box' may have coin as the unit, with 'in this box' merely as the scope [Ayers]
If counting needs a sortal, what of things which fall under two sortals? [Ayers]
7. Existence / B. Change in Existence / 4. Events / a. Nature of events
Events do not have natural boundaries, and we have to set them [Ayers]
7. Existence / D. Theories of Reality / 8. Facts / c. Facts and truths
Many sentences do not state facts, but there are no facts which could not be stated [Ryle]
9. Objects / A. Existence of Objects / 5. Individuation / a. Individuation
To express borderline cases of objects, you need the concept of an 'object' [Ayers]
9. Objects / A. Existence of Objects / 5. Individuation / e. Individuation by kind
Speakers need the very general category of a thing, if they are to think about it [Ayers]
We use sortals to classify physical objects by the nature and origin of their unity [Ayers]
Seeing caterpillar and moth as the same needs continuity, not identity of sortal concepts [Ayers]
Recognising continuity is separate from sortals, and must precede their use [Ayers]
9. Objects / B. Unity of Objects / 1. Unifying an Object / a. Intrinsic unification
Could the same matter have more than one form or principle of unity? [Ayers]
9. Objects / B. Unity of Objects / 3. Unity Problems / c. Statue and clay
If there are two objects, then 'that marble, man-shaped object' is ambiguous [Ayers]
9. Objects / D. Essence of Objects / 5. Essence as Kind
Sortals basically apply to individuals [Ayers]
9. Objects / E. Objects over Time / 5. Temporal Parts
You can't have the concept of a 'stage' if you lack the concept of an object [Ayers]
Temporal 'parts' cannot be separated or rearranged [Ayers]
9. Objects / F. Identity among Objects / 1. Concept of Identity
Some say a 'covering concept' completes identity; others place the concept in the reference [Ayers]
9. Objects / F. Identity among Objects / 3. Relative Identity
If diachronic identities need covering concepts, why not synchronic identities too? [Ayers]
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]
12. Knowledge Sources / B. Perception / 3. Representation
Representation assumes you know the ideas, and the reality, and the relation between the two [Ryle]
18. Thought / A. Modes of Thought / 6. Judgement / a. Nature of Judgement
If you like judgments and reject propositions, what are the relata of incoherence in a judgment? [Ryle]
19. Language / A. Nature of Meaning / 1. Meaning
Husserl and Meinong wanted objective Meanings and Propositions, as subject-matter for Logic [Ryle]
19. Language / A. Nature of Meaning / 3. Meaning as Speaker's Intention
When I utter a sentence, listeners grasp both my meaning and my state of mind [Ryle]
19. Language / D. Propositions / 1. Propositions
'Propositions' name what is thought, because 'thoughts' and 'judgments' are too ambiguous [Ryle]
19. Language / D. Propositions / 4. Mental Propositions
Several people can believe one thing, or make the same mistake, or share one delusion [Ryle]
We may think in French, but we don't know or believe in French [Ryle]
19. Language / D. Propositions / 6. Propositions Critique
There are no propositions; they are just sentences, used for thinking, which link to facts in a certain way [Ryle]
If we accept true propositions, it is hard to reject false ones, and even nonsensical ones [Ryle]