Combining Texts

All the ideas for 'Unconscious Cerebral Initiative', 'First-Order Logic' and 'The Runabout Inference Ticket'

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


14 ideas

5. Theory of Logic / A. Overview of Logic / 1. Overview of Logic
Logic is the study of sound argument, or of certain artificial languages (or applying the latter to the former) [Hodges,W]
     Full Idea: A logic is a collection of closely related artificial languages, and its older meaning is the study of the rules of sound argument. The languages can be used as a framework for studying rules of argument.
     From: Wilfrid Hodges (First-Order Logic [2001], 1.1)
     A reaction: [Hodges then says he will stick to the languages] The suspicion is that one might confine the subject to the artificial languages simply because it is easier, and avoids the tricky philosophical questions. That approximates to computer programming.
5. Theory of Logic / E. Structures of Logic / 2. Logical Connectives / a. Logical connectives
We need to know the meaning of 'and', prior to its role in reasoning [Prior,AN, by Belnap]
     Full Idea: For Prior, so the moral goes, we must first have a notion of what 'and' means, independently of the role it plays as premise and as conclusion.
     From: report of Arthur N. Prior (The Runabout Inference Ticket [1960]) by Nuel D. Belnap - Tonk, Plonk and Plink p.132
     A reaction: The meaning would be given by the truth tables (the truth-conditions), whereas the role would be given by the natural deduction introduction and elimination rules. This seems to be the basic debate about logical connectives.
Prior's 'tonk' is inconsistent, since it allows the non-conservative inference A |- B [Belnap on Prior,AN]
     Full Idea: Prior's definition of 'tonk' is inconsistent. It gives us an extension of our original characterisation of deducibility which is not conservative, since in the extension (but not the original) we have, for arbitrary A and B, A |- B.
     From: comment on Arthur N. Prior (The Runabout Inference Ticket [1960]) by Nuel D. Belnap - Tonk, Plonk and Plink p.135
     A reaction: Belnap's idea is that connectives don't just rest on their rules, but also on the going concern of normal deduction.
Prior rejected accounts of logical connectives by inference pattern, with 'tonk' his absurd example [Prior,AN, by Read]
     Full Idea: Prior dislike the holism inherent in the claim that the meaning of a logical connective was determined by the inference patterns into which it validly fitted. ...His notorious example of 'tonk' (A → A-tonk-B → B) was a reductio of the view.
     From: report of Arthur N. Prior (The Runabout Inference Ticket [1960]) by Stephen Read - Thinking About Logic Ch.8
     A reaction: [The view being attacked was attributed to Gentzen]
Maybe introducing or defining logical connectives by rules of inference leads to absurdity [Prior,AN, by Hacking]
     Full Idea: Prior intended 'tonk' (a connective which leads to absurdity) as a criticism of the very idea of introducing or defining logical connectives by rules of inference.
     From: report of Arthur N. Prior (The Runabout Inference Ticket [1960], §09) by Ian Hacking - What is Logic?
5. Theory of Logic / I. Semantics of Logic / 1. Semantics of Logic
A formula needs an 'interpretation' of its constants, and a 'valuation' of its variables [Hodges,W]
     Full Idea: To have a truth-value, a first-order formula needs an 'interpretation' (I) of its constants, and a 'valuation' (ν) of its variables. Something in the world is attached to the constants; objects are attached to variables.
     From: Wilfrid Hodges (First-Order Logic [2001], 1.3)
There are three different standard presentations of semantics [Hodges,W]
     Full Idea: Semantic rules can be presented in 'Tarski style', where the interpretation-plus-valuation is reduced to the same question for simpler formulas, or the 'Henkin-Hintikka style' in terms of games, or the 'Barwise-Etchemendy style' for computers.
     From: Wilfrid Hodges (First-Order Logic [2001], 1.3)
     A reaction: I haven't yet got the hang of the latter two, but I note them to map the territory.
I |= φ means that the formula φ is true in the interpretation I [Hodges,W]
     Full Idea: I |= φ means that the formula φ is true in the interpretation I.
     From: Wilfrid Hodges (First-Order Logic [2001], 1.5)
     A reaction: [There should be no space between the vertical and the two horizontals!] This contrasts with |-, which means 'is proved in'. That is a syntactic or proof-theoretic symbol, whereas |= is a semantic symbol (involving truth).
5. Theory of Logic / J. Model Theory in Logic / 3. Löwenheim-Skolem Theorems
Down Löwenheim-Skolem: if a countable language has a consistent theory, that has a countable model [Hodges,W]
     Full Idea: Downward Löwenheim-Skolem (the weakest form): If L is a first-order language with at most countably many formulas, and T is a consistent theory in L. Then T has a model with at most countably many elements.
     From: Wilfrid Hodges (First-Order Logic [2001], 1.10)
Up Löwenheim-Skolem: if infinite models, then arbitrarily large models [Hodges,W]
     Full Idea: Upward Löwenheim-Skolem: every first-order theory with infinite models has arbitrarily large models.
     From: Wilfrid Hodges (First-Order Logic [2001], 1.10)
5. Theory of Logic / K. Features of Logics / 6. Compactness
If a first-order theory entails a sentence, there is a finite subset of the theory which entails it [Hodges,W]
     Full Idea: Compactness Theorem: suppose T is a first-order theory, ψ is a first-order sentence, and T entails ψ. Then there is a finite subset U of T such that U entails ψ.
     From: Wilfrid Hodges (First-Order Logic [2001], 1.10)
     A reaction: If entailment is possible, it can be done finitely.
6. Mathematics / B. Foundations for Mathematics / 6. Mathematics as Set Theory / a. Mathematics is set theory
A 'set' is a mathematically well-behaved class [Hodges,W]
     Full Idea: A 'set' is a mathematically well-behaved class.
     From: Wilfrid Hodges (First-Order Logic [2001], 1.6)
20. Action / B. Preliminaries of Action / 2. Willed Action / a. Will to Act
Libet says the processes initiated in the cortex can still be consciously changed [Libet, by Papineau]
     Full Idea: Libet himself points out that the conscious decisions still have the power to 'endorse' or 'cancel', so to speak, the processes initiated by the earlier cortical activity: no action will result if the action's execution is consciously countermanded.
     From: report of Benjamin Libet (Unconscious Cerebral Initiative [1985]) by David Papineau - Thinking about Consciousness 1.4
     A reaction: This is why Libet's findings do not imply 'epiphenomenalism'. It seems that part of a decisive action is non-conscious, undermining the all-or-nothing view of consciousness. Searle tries to smuggle in free will at this point (Idea 3817).
Libet found conscious choice 0.2 secs before movement, well after unconscious 'readiness potential' [Libet, by Lowe]
     Full Idea: Libet found that a subject's conscious choice to move was about a fifth of a second before movement, and thus later than the onset of the brain's so-called 'readiness potential', which seems to imply that unconscious processes initiates action.
     From: report of Benjamin Libet (Unconscious Cerebral Initiative [1985]) by E.J. Lowe - Introduction to the Philosophy of Mind Ch.9
     A reaction: Of great interest to philosophers! It seems to make conscious choices epiphenomenal. The key move, I think, is to give up the idea of consciousness as being all-or-nothing. My actions are still initiated by 'me', but 'me' shades off into unconsciousness.