Combining Texts

All the ideas for 'The Origin of the Work of Art', 'Computing Machinery and Intelligence' and 'Modal Logics and Philosophy'

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


18 ideas

1. Philosophy / D. Nature of Philosophy / 5. Aims of Philosophy / b. Philosophy as transcendent
Later Heidegger sees philosophy as more like poetry than like science [Heidegger, by Polt]
     Full Idea: In his later work Heidegger came to view philosophy as closer to poetry than to science.
     From: report of Martin Heidegger (The Origin of the Work of Art [1935], p.178) by Richard Polt - Heidegger: an introduction 5 'Signs'
4. Formal Logic / B. Propositional Logic PL / 1. Propositional Logic
Propositional logic handles negation, disjunction, conjunction; predicate logic adds quantifiers, predicates, relations [Girle]
     Full Idea: Propositional logic can deal with negation, disjunction and conjunction of propositions, but predicate logic goes beyond it to deal with quantifiers, predicates and relations.
     From: Rod Girle (Modal Logics and Philosophy [2000], 1.1)
     A reaction: This is on the first page of an introduction to the next stage, which is to include modal notions like 'must' and 'possibly'.
There are three axiom schemas for propositional logic [Girle]
     Full Idea: The axioms of propositional logic are: A→(B→A); A→(B→C)→(A→B)→(A→C) ; and (¬A→¬B)→(B→A).
     From: Rod Girle (Modal Logics and Philosophy [2000], 6.5)
4. Formal Logic / B. Propositional Logic PL / 2. Tools of Propositional Logic / a. Symbols of PL
Proposition logic has definitions for its three operators: or, and, and identical [Girle]
     Full Idea: The operators of propositional logic are defined as follows: 'or' (v) is not-A implies B; 'and' (ampersand) is not A-implies-not-B; and 'identity' (three line equals) is A-implies-B and B-implies-A.
     From: Rod Girle (Modal Logics and Philosophy [2000], 6.5)
4. Formal Logic / B. Propositional Logic PL / 2. Tools of Propositional Logic / e. Axioms of PL
Axiom systems of logic contain axioms, inference rules, and definitions of proof and theorems [Girle]
     Full Idea: An axiom system for a logic contains three elements: a set of axioms; a set of inference rules; and definitions for proofs and theorems. There are also definitions for the derivation of conclusions from sets of premises.
     From: Rod Girle (Modal Logics and Philosophy [2000], 6.5)
4. Formal Logic / D. Modal Logic ML / 3. Modal Logic Systems / g. System S4
There are seven modalities in S4, each with its negation [Girle]
     Full Idea: In S4 there are fourteen modalities: no-operator; necessarily; possibly; necessarily-possibly; possibly-necessarily; necessarily-possibly-necessarily; and possibly-necessarily-possibly (each with its negation).
     From: Rod Girle (Modal Logics and Philosophy [2000], 3.5)
     A reaction: This is said to be 'more complex' than S5, but also 'weaker'.
4. Formal Logic / D. Modal Logic ML / 3. Modal Logic Systems / h. System S5
◊p → □◊p is the hallmark of S5 [Girle]
     Full Idea: The critical formula that distinguishes S5 from all others is: ◊p → □◊p.
     From: Rod Girle (Modal Logics and Philosophy [2000], 3.3)
     A reaction: If it is possible that it is raining, then it is necessary that it is possible that it is raining. But if it is possible in this world, how can that possibility be necessary in all possible worlds?
S5 has just six modalities, and all strings can be reduced to those [Girle]
     Full Idea: In S5 there are six modalities: no-operator; necessarily; and possibly (and their negations). In any sequence of operators we may delete all but the last to gain an equivalent formula.
     From: Rod Girle (Modal Logics and Philosophy [2000], 3.5)
     A reaction: Such drastic simplification seems attractive. Is there really no difference, though, between 'necessarily-possibly', 'possibly-possibly' and just 'possibly'? Could p be contingently possible in this world, and necessarily possible in another?
4. Formal Logic / D. Modal Logic ML / 4. Alethic Modal Logic
Possible worlds logics use true-in-a-world rather than true [Girle]
     Full Idea: In possible worlds logics a statement is true-in-a-world rather than just true.
     From: Rod Girle (Modal Logics and Philosophy [2000], 1.1)
     A reaction: This sounds relativist, but I don't think it is. It is the facts which change, not the concept of truth. So 'donkeys can talk' may be true in a world, but not in the actual one.
Modal logic has four basic modal negation equivalences [Girle]
     Full Idea: The four important logical equivalences in modal logic (the Modal Negation equivalences) are: ¬◊p↔□¬p, ◊¬p↔¬□p, □p↔¬◊¬p, and ◊p↔¬□¬p.
     From: Rod Girle (Modal Logics and Philosophy [2000], 1.2)
     A reaction: [Possibly is written as a diamond, necessarily a square] These are parallel to a set of equivalences between quantifiers in predicate logic. They are called the four 'modal negation (MN) equivalences'.
Modal logics were studied in terms of axioms, but now possible worlds semantics is added [Girle]
     Full Idea: Modal logics were, for a long time, studied in terms of axiom systems. The advent of possible worlds semantics made it possible to study them in a semantic way as well.
     From: Rod Girle (Modal Logics and Philosophy [2000], 6.5)
5. Theory of Logic / B. Logical Consequence / 7. Strict Implication
Necessary implication is called 'strict implication'; if successful, it is called 'entailment' [Girle]
     Full Idea: Necessary implication is often called 'strict implication'. The sort of strict implication found in valid arguments, where the conjunction of the premises necessarily implies the conclusion, is often called 'entailment'.
     From: Rod Girle (Modal Logics and Philosophy [2000], 1.2)
     A reaction: These are basic concept for all logic.
5. Theory of Logic / H. Proof Systems / 5. Tableau Proof
If an argument is invalid, a truth tree will indicate a counter-example [Girle]
     Full Idea: The truth trees method for establishing the validity of arguments and formulas is easy to use, and has the advantage that if an argument or formula is not valid, then a counter-example can be retrieved from the tree.
     From: Rod Girle (Modal Logics and Philosophy [2000], 1.4)
10. Modality / A. Necessity / 3. Types of Necessity
Analytic truths are divided into logically and conceptually necessary [Girle]
     Full Idea: It has been customary to see analytic truths as dividing into the logically necessary and the conceptually necessary.
     From: Rod Girle (Modal Logics and Philosophy [2000], 7.3)
     A reaction: I suspect that this neglected distinction is important in discussions of Quine's elimination of the analytic/synthetic distinction. Was Quine too influenced by what is logically necessary, which might shift with a change of axioms?
10. Modality / B. Possibility / 1. Possibility
Possibilities can be logical, theoretical, physical, economic or human [Girle]
     Full Idea: Qualified modalities seem to form a hierarchy, if we say that 'the possibility that there might be no hunger' is possible logically, theoretically, physically, economically, and humanly.
     From: Rod Girle (Modal Logics and Philosophy [2000], 7.3)
     A reaction: Girle also mentions conceptual possibility. I take 'physically' to be the same as 'naturally'. I would take 'metaphysically' possible to equate to 'theoretically' rather than 'logically'. Almost anything might be logically possible, with bizarre logic.
10. Modality / E. Possible worlds / 1. Possible Worlds / a. Possible worlds
A world has 'access' to a world it generates, which is important in possible worlds semantics [Girle]
     Full Idea: When one world generates another then it has 'access' to the world it generated. The accessibility relation between worlds is very important in possible worlds semantics.
     From: Rod Girle (Modal Logics and Philosophy [2000], 3.2)
     A reaction: This invites the obvious question what is meant by 'generates'.
18. Thought / B. Mechanics of Thought / 6. Artificial Thought / b. Turing Machines
The Turing Machine is the best idea yet about how the mind works [Fodor on Turing]
     Full Idea: Alan Turing had (in his theory of the 'Turing Machine') what I suppose is the best thought about how the mind works that anyone has had so far.
     From: comment on Alan Turing (Computing Machinery and Intelligence [1950]) by Jerry A. Fodor - Jerry A. Fodor on himself p.296
     A reaction: I am not convinced, because I don't think rationality is possible without consciousness. The brain may bypass the representations used by a computer.
18. Thought / B. Mechanics of Thought / 6. Artificial Thought / c. Turing Test
In 50 years computers will successfully imitate humans with a 70% success rate [Turing]
     Full Idea: In about fifty years' time it will be possible to program computers to play the imitation game so well that an average interrogator will not have more than 70% chance of making the right identification after five minutes of questioning.
     From: Alan Turing (Computing Machinery and Intelligence [1950], p.57), quoted by Robert Kirk - Mind and Body §5.9
     A reaction: This is the famous prophecy called 'The Turing Test'. The current state (2004) seems to be that the figure of 70% is very near, but no one sees much prospect of advancing much further in the next 100 years. Dennett sees jokes as a big problem.