Combining Philosophers

All the ideas for Rescher,N/Oppenheim,P, Penelope Maddy and M Fitting/R Mendelsohn

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


102 ideas

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]
4. Formal Logic / F. Set Theory ST / 2. Mechanics of Set Theory / b. Terminology of ST
'Forcing' can produce new models of ZFC from old models [Maddy]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / a. Axioms for sets
A Large Cardinal Axiom would assert ever-increasing stages in the hierarchy [Maddy]
New axioms are being sought, to determine the size of the continuum [Maddy]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / b. Axiom of Extensionality I
The Axiom of Extensionality seems to be analytic [Maddy]
Extensional sets are clearer, simpler, unique and expressive [Maddy]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / f. Axiom of Infinity V
Axiom of Infinity: completed infinite collections can be treated mathematically [Maddy]
The Axiom of Infinity states Cantor's breakthrough that launched modern mathematics [Maddy]
Infinite sets are essential for giving an account of the real numbers [Maddy]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / g. Axiom of Powers VI
The Power Set Axiom is needed for, and supported by, accounts of the continuum [Maddy]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / i. Axiom of Foundation VIII
The Axiom of Foundation says every set exists at a level in the set hierarchy [Maddy]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / j. Axiom of Choice IX
Efforts to prove the Axiom of Choice have failed [Maddy]
Modern views say the Choice set exists, even if it can't be constructed [Maddy]
A large array of theorems depend on the Axiom of Choice [Maddy]
The Axiom of Choice paradoxically allows decomposing a sphere into two identical spheres [Maddy]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / p. Axiom of Reducibility
Axiom of Reducibility: propositional functions are extensionally predicative [Maddy]
4. Formal Logic / F. Set Theory ST / 5. Conceptions of Set / e. Iterative sets
The Iterative Conception says everything appears at a stage, derived from the preceding appearances [Maddy]
4. Formal Logic / F. Set Theory ST / 5. Conceptions of Set / f. Limitation of Size
Limitation of Size is a vague intuition that over-large sets may generate paradoxes [Maddy]
4. Formal Logic / F. Set Theory ST / 7. Natural Sets
The master science is physical objects divided into sets [Maddy]
Maddy replaces pure sets with just objects and perceived sets of objects [Maddy, by Shapiro]
5. Theory of Logic / A. Overview of Logic / 7. Second-Order Logic
Henkin semantics is more plausible for plural logic than for second-order logic [Maddy]
5. Theory of Logic / C. Ontology of Logic / 3. If-Thenism
Critics of if-thenism say that not all starting points, even consistent ones, are worth studying [Maddy]
5. Theory of Logic / E. Structures of Logic / 1. Logical Form
'Propositional functions' are propositions with a variable as subject or predicate [Maddy]
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 / K. Features of Logics / 1. Axiomatisation
Hilbert's geometry and Dedekind's real numbers were role models for axiomatization [Maddy]
If two mathematical themes coincide, that suggest a single deep truth [Maddy]
6. Mathematics / A. Nature of Mathematics / 5. The Infinite / d. Actual infinite
Completed infinities resulted from giving foundations to calculus [Maddy]
Cantor and Dedekind brought completed infinities into mathematics [Maddy]
6. Mathematics / A. Nature of Mathematics / 5. The Infinite / g. Continuum Hypothesis
Every infinite set of reals is either countable or of the same size as the full set of reals [Maddy]
6. Mathematics / A. Nature of Mathematics / 5. The Infinite / i. Cardinal infinity
Infinity has degrees, and large cardinals are the heart of set theory [Maddy]
For any cardinal there is always a larger one (so there is no set of all sets) [Maddy]
An 'inaccessible' cardinal cannot be reached by union sets or power sets [Maddy]
6. Mathematics / A. Nature of Mathematics / 5. The Infinite / l. Limits
Theorems about limits could only be proved once the real numbers were understood [Maddy]
6. Mathematics / B. Foundations for Mathematics / 5. Definitions of Number / c. Fregean numbers
The extension of concepts is not important to me [Maddy]
In the ZFC hierarchy it is impossible to form Frege's set of all three-element sets [Maddy]
6. Mathematics / B. Foundations for Mathematics / 5. Definitions of Number / e. Caesar problem
Frege solves the Caesar problem by explicitly defining each number [Maddy]
6. Mathematics / B. Foundations for Mathematics / 6. Mathematics as Set Theory / a. Mathematics is set theory
Set theory (unlike the Peano postulates) can explain why multiplication is commutative [Maddy]
Standardly, numbers are said to be sets, which is neat ontology and epistemology [Maddy]
Numbers are properties of sets, just as lengths are properties of physical objects [Maddy]
A natural number is a property of sets [Maddy, by Oliver]
Making set theory foundational to mathematics leads to very fruitful axioms [Maddy]
Unified set theory gives a final court of appeal for mathematics [Maddy]
Set theory brings mathematics into one arena, where interrelations become clearer [Maddy]
Mathematics rests on the logic of proofs, and on the set theoretic axioms [Maddy]
Identifying geometric points with real numbers revealed the power of set theory [Maddy]
The line of rationals has gaps, but set theory provided an ordered continuum [Maddy]
Set-theory tracks the contours of mathematical depth and fruitfulness [Maddy]
6. Mathematics / B. Foundations for Mathematics / 6. Mathematics as Set Theory / b. Mathematics is not set theory
Number theory doesn't 'reduce' to set theory, because sets have number properties [Maddy]
Sets exist where their elements are, but numbers are more like universals [Maddy]
6. Mathematics / C. Sources of Mathematics / 1. Mathematical Platonism / b. Against mathematical platonism
If mathematical objects exist, how can we know them, and which objects are they? [Maddy]
6. Mathematics / C. Sources of Mathematics / 2. Intuition of Mathematics
Intuition doesn't support much mathematics, and we should question its reliability [Maddy, by Shapiro]
6. Mathematics / C. Sources of Mathematics / 4. Mathematical Empiricism / a. Mathematical empiricism
We know mind-independent mathematical truths through sets, which rest on experience [Maddy, by Jenkins]
6. Mathematics / C. Sources of Mathematics / 4. Mathematical Empiricism / b. Indispensability of mathematics
Scientists posit as few entities as possible, but set theorist posit as many as possible [Maddy]
Maybe applications of continuum mathematics are all idealisations [Maddy]
6. Mathematics / C. Sources of Mathematics / 4. Mathematical Empiricism / c. Against mathematical empiricism
The connection of arithmetic to perception has been idealised away in modern infinitary mathematics [Maddy]
6. Mathematics / C. Sources of Mathematics / 5. Numbers as Adjectival
Number words are unusual as adjectives; we don't say 'is five', and numbers always come first [Maddy]
6. Mathematics / C. Sources of Mathematics / 6. Logicism / c. Neo-logicism
We can get arithmetic directly from HP; Law V was used to get HP from the definition of number [Maddy]
7. Existence / D. Theories of Reality / 11. Ontological Commitment / e. Ontological commitment problems
The theoretical indispensability of atoms did not at first convince scientists that they were real [Maddy]
9. Objects / C. Structure of Objects / 8. Parts of Objects / c. Wholes from parts
A whole must have one characteristic, an internal relation, and a structure [Rescher/Oppenheim]
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]
15. Nature of Minds / C. Capacities of Minds / 6. Idealisation
Science idealises the earth's surface, the oceans, continuities, and liquids [Maddy]