Combining Texts

All the ideas for 'Subjectivist's Guide to Objective Chance', 'First-Order Modal Logic' and 'On Denoting'

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


91 ideas

1. Philosophy / C. History of Philosophy / 5. Modern Philosophy / b. Modern philosophy beginnings
Russell started a whole movement in philosophy by providing an analysis of descriptions [Read on 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
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]
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
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 / D. Assumptions for Logic / 2. Excluded Middle
Russell's theories aim to preserve excluded middle (saying all sentences are T or F) [Sawyer on Russell]
5. Theory of Logic / E. Structures of Logic / 1. Logical Form
'Elizabeth = Queen of England' is really a predication, not an identity-statement [Russell, by Lycan]
5. Theory of Logic / E. Structures of Logic / 4. Variables in Logic
The idea of a variable is fundamental [Russell]
5. Theory of Logic / F. Referring in Logic / 1. Naming / b. Names as descriptive
Names don't have a sense, but are disguised definite descriptions [Russell, by Sawyer]
Russell says names are not denotations, but definite descriptions in disguise [Russell, by Kripke]
Russell says a name contributes a complex of properties, rather than an object [Russell, by Sawyer]
Are names descriptions, if the description is unknown, false, not special, or contains names? [McCullogh on Russell]
5. Theory of Logic / F. Referring in Logic / 1. Naming / c. Names as referential
Logically proper names introduce objects; definite descriptions introduce quantifications [Russell, by Bach]
The meaning of a logically proper name is its referent, but most names are not logically proper [Russell, by Soames]
5. Theory of Logic / F. Referring in Logic / 1. Naming / d. Singular terms
Russell rewrote singular term names as predicates [Russell, by Ayer]
"Nobody" is not a singular term, but a quantifier [Russell, by Lycan]
5. Theory of Logic / F. Referring in Logic / 1. Naming / e. Empty names
Russell implies that all sentences containing empty names are false [Sawyer on Russell]
5. Theory of Logic / F. Referring in Logic / 2. Descriptions / b. Definite descriptions
Critics say definite descriptions can refer, and may not embody both uniqueness and existence claims [Grayling on Russell]
Definite descriptions fail to refer in three situations, so they aren't essentially referring [Russell, by Sainsbury]
5. Theory of Logic / F. Referring in Logic / 2. Descriptions / c. Theory of definite descriptions
The theory of descriptions eliminates the name of the entity whose existence was presupposed [Russell, by Quine]
Russell's theory explains non-existents, negative existentials, identity problems, and substitutivity [Russell, by Lycan]
Russell showed how to define 'the', and thereby reduce the ontology of logic [Russell, by Lackey]
The theory of definite descriptions reduces the definite article 'the' to the concepts of predicate logic [Russell, by Horwich]
Russell implies that 'the baby is crying' is only true if the baby is unique [Grayling on Russell]
Russell explained descriptions with quantifiers, where Frege treated them as names [Russell, by McCullogh]
Russell avoids non-existent objects by denying that definite descriptions are proper names [Russell, by Miller,A]
Denying definite description sentences are subject-predicate in form blocks two big problems [Russell, by Forbes,G]
Russell says apparent referring expressions are really assertions about properties [Russell, by Cooper,DE]
Russell's theory must be wrong if it says all statements about non-existents are false [Read on Russell]
The theory of descriptions lacks conventions for the scope of quantifiers [Lackey on Russell]
Non-count descriptions don't threaten Russell's theory, which is only about singulars [Laycock on Russell]
Denoting is crucial in Russell's account of mathematics, for identifying classes [Russell, by Monk]
Russell's analysis means molecular sentences are ambiguous over the scope of the description [Kaplan on 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]
5. Theory of Logic / G. Quantification / 3. Objectual Quantification
Existence is entirely expressed by the existential quantifier [Russell, by McGinn]
7. Existence / D. Theories of Reality / 11. Ontological Commitment / e. Ontological commitment problems
Russell showed that descriptions may not have ontological commitment [Russell, by Linsky,B]
7. Existence / E. Categories / 3. Proposed Categories
The Theory of Description dropped classes and numbers, leaving propositions, individuals and universals [Russell, by Monk]
8. Modes of Existence / B. Properties / 12. Denial of Properties
Russell can't attribute existence to properties [McGinn on Russell]
9. Objects / A. Existence of Objects / 4. Impossible objects
If the King of France is not bald, and not not-bald, this violates excluded middle [Linsky,B on 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 / 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]
19. Language / B. Reference / 1. Reference theories
Russell argued with great plausibility that we rarely, if ever, refer with our words [Russell, by Cooper,DE]
19. Language / B. Reference / 2. Denoting
Referring is not denoting, and Russell ignores the referential use of definite descriptions [Donnellan on Russell]
A definite description 'denotes' an entity if it fits the description uniquely [Russell, by Recanati]
Denoting phrases are meaningless, but guarantee meaning for propositions [Russell]
In 'Scott is the author of Waverley', denotation is identical, but meaning is different [Russell]
19. Language / B. Reference / 4. Descriptive Reference / a. Sense and reference
By eliminating descriptions from primitive notation, Russell seems to reject 'sense' [Russell, by Kripke]
19. Language / B. Reference / 5. Speaker's Reference
Russell assumes that expressions refer, but actually speakers refer by using expressions [Cooper,DE on Russell]
19. Language / C. Assigning Meanings / 5. Fregean Semantics
Russell rejected sense/reference, because it made direct acquaintance with things impossible [Russell, by Recanati]
'Sense' is superfluous (rather than incoherent) [Russell, by Miller,A]
19. Language / C. Assigning Meanings / 6. Truth-Conditions Semantics
The theory of definite descriptions aims at finding correct truth conditions [Russell, by Lycan]
19. Language / D. Propositions / 3. Concrete Propositions
In graspable propositions the constituents are real entities of acquaintance [Russell]
26. Natural Theory / D. Laws of Nature / 4. Regularities / b. Best system theory
Lewis later proposed the axioms at the intersection of the best theories (which may be few) [Mumford on Lewis]
28. God / B. Proving God / 2. Proofs of Reason / b. Ontological Proof critique
The ontological argument begins with an unproven claim that 'there exists an x..' [Russell]