Combining Philosophers

Ideas for Melvin Fitting, Theodore Sider and Ludwig Wittgenstein

expand these ideas     |    start again     |     choose another area for these philosophers

display all the ideas for this combination of philosophers


61 ideas

5. Theory of Logic / A. Overview of Logic / 1. Overview of Logic
Logic fills the world, to its limits [Wittgenstein]
In logic nothing is hidden [Wittgenstein]
We can dispense with self-evidence, if language itself prevents logical mistakes [Jeshion on Wittgenstein]
Logic concerns everything that is subject to law; the rest is accident [Wittgenstein]
There is a real issue over what is the 'correct' logic [Sider]
'It is raining' and 'it is not raining' can't be legislated, so we can't legislate 'p or ¬p' [Sider]
5. Theory of Logic / A. Overview of Logic / 3. Value of Logic
Wittgenstein is right that logic is just tautologies [Wittgenstein, by Russell]
5. Theory of Logic / A. Overview of Logic / 4. Pure Logic
Logic is a priori because it is impossible to think illogically [Wittgenstein]
5. Theory of Logic / A. Overview of Logic / 6. Classical Logic
Classical logic is good for mathematics and science, but less good for natural language [Sider]
5. Theory of Logic / A. Overview of Logic / 8. Logic of Mathematics
Classical logic is deliberately extensional, in order to model mathematics [Fitting]
5. Theory of Logic / B. Logical Consequence / 1. Logical Consequence
The most popular account of logical consequence is the semantic or model-theoretic one [Sider]
Maybe logical consequence is more a matter of provability than of truth-preservation [Sider]
Maybe logical consequence is impossibility of the premises being true and the consequent false [Sider]
Maybe logical consequence is a primitive notion [Sider]
Modal accounts of logical consequence are simple necessity, or essential use of logical words [Sider]
5. Theory of Logic / B. Logical Consequence / 3. Deductive Consequence |-
A 'theorem' is an axiom, or the last line of a legitimate proof [Sider]
If q implies p, that is justified by q and p, not by some 'laws' of inference [Wittgenstein]
5. Theory of Logic / C. Ontology of Logic / 1. Ontology of Logic
The propositions of logic are analytic tautologies [Wittgenstein]
5. Theory of Logic / C. Ontology of Logic / 2. Platonism in Logic
Wittgenstein convinced Russell that logic is tautologies, not Platonic forms [Wittgenstein, by Monk]
5. Theory of Logic / C. Ontology of Logic / 4. Logic by Convention
Laws of logic are like laws of chess - if you change them, it's just a different game [Wittgenstein]
5. Theory of Logic / D. Assumptions for Logic / 3. Contradiction
Two colours in the same place is ruled out by the logical structure of colour [Wittgenstein]
Contradiction is between two rules, not between rule and reality [Wittgenstein]
5. Theory of Logic / D. Assumptions for Logic / 4. Identity in Logic
The sign of identity is not allowed in 'Tractatus' [Wittgenstein, by Bostock]
The identity sign is not essential in logical notation, if every sign has a different meaning [Wittgenstein, by Ramsey]
5. Theory of Logic / E. Structures of Logic / 1. Logical Form
A statement's logical form derives entirely from its constituents [Wittgenstein]
Wittgenstein says we want the grammar of problems, not their first-order logical structure [Wittgenstein, by Horsten/Pettigrew]
Apparent logical form may not be real logical form [Wittgenstein]
5. Theory of Logic / E. Structures of Logic / 2. Logical Connectives / a. Logical connectives
My fundamental idea is that the 'logical constants' do not represent [Wittgenstein]
'And' and 'not' are non-referring terms, which do not represent anything [Wittgenstein, by Fogelin]
Define logical constants by role in proofs, or as fixed in meaning, or as topic-neutral [Sider]
5. Theory of Logic / E. Structures of Logic / 2. Logical Connectives / c. not
'Not' isn't an object, because not-not-p would then differ from p [Wittgenstein]
We may correctly use 'not' without making the rule explicit [Wittgenstein]
5. Theory of Logic / E. Structures of Logic / 2. Logical Connectives / d. and
Saying 'and' has meaning is just saying it works in a sentence [Wittgenstein]
5. Theory of Logic / E. Structures of Logic / 4. Variables in Logic
'Object' is a pseudo-concept, properly indicated in logic by the variable x [Wittgenstein]
When a variable is 'free' of the quantifier, the result seems incapable of truth or falsity [Sider]
5. Theory of Logic / E. Structures of Logic / 5. Functions in Logic
A 'total' function must always produce an output for a given domain [Sider]
5. Theory of Logic / F. Referring in Logic / 1. Naming / a. Names
Names are primitive, and cannot be analysed [Wittgenstein]
A person's name doesn't mean their body; bodies don't sit down, and their existence can be denied [Wittgenstein]
Naming is a preparation for description [Wittgenstein]
5. Theory of Logic / F. Referring in Logic / 1. Naming / b. Names as descriptive
A name is not determined by a description, but by a cluster or family [Wittgenstein, by Kripke]
5. Theory of Logic / F. Referring in Logic / 1. Naming / c. Names as referential
A name is primitive, and its meaning is the object [Wittgenstein]
5. Theory of Logic / F. Referring in Logic / 3. Property (λ-) Abstraction
λ-abstraction disambiguates the scope of modal operators [Fitting]
λ can treat 'is cold and hungry' as a single predicate [Sider]
5. Theory of Logic / G. Quantification / 1. Quantification
Wittgenstein tried unsuccessfully to reduce quantifiers to conjunctions and disjunctions [Wittgenstein, by Jacquette]
5. Theory of Logic / H. Proof Systems / 1. Proof Systems
Logical proof just explicates complicated tautologies [Wittgenstein]
5. Theory of Logic / H. Proof Systems / 2. Axiomatic Proof
Good axioms should be indisputable logical truths [Sider]
No assumptions in axiomatic proofs, so no conditional proof or reductio [Sider]
5. Theory of Logic / H. Proof Systems / 3. Proof from Assumptions
Proof by induction 'on the length of the formula' deconstructs a formula into its accepted atoms [Sider]
Induction has a 'base case', then an 'inductive hypothesis', and then the 'inductive step' [Sider]
5. Theory of Logic / H. Proof Systems / 4. Natural Deduction
Natural deduction helpfully allows reasoning with assumptions [Sider]
'Tonk' is supposed to follow the elimination and introduction rules, but it can't be so interpreted [Sider]
5. Theory of Logic / H. Proof Systems / 6. Sequent Calculi
We can build proofs just from conclusions, rather than from plain formulae [Sider]
5. Theory of Logic / I. Semantics of Logic / 1. Semantics of Logic
Valuations in PC assign truth values to formulas relative to variable assignments [Sider]
5. Theory of Logic / I. Semantics of Logic / 3. Logical Truth
Logical truths are just 'by-products' of the introduction rules for logical constants [Wittgenstein, by Hacking]
The semantical notion of a logical truth is validity, being true in all interpretations [Sider]
It is hard to say which are the logical truths in modal logic, especially for iterated modal operators [Sider]
5. Theory of Logic / J. Model Theory in Logic / 1. Logical Models
In model theory, first define truth, then validity as truth in all models, and consequence as truth-preservation [Sider]
5. Theory of Logic / K. Features of Logics / 1. Axiomatisation
Logic doesn't split into primitive and derived propositions; they all have the same status [Wittgenstein]
5. Theory of Logic / K. Features of Logics / 4. Completeness
In a complete logic you can avoid axiomatic proofs, by using models to show consequences [Sider]
5. Theory of Logic / K. Features of Logics / 6. Compactness
Compactness surprisingly says that no contradictions can emerge when the set goes infinite [Sider]
5. Theory of Logic / L. Paradox / 6. Paradoxes in Language / a. The Liar paradox
'This sentence is false' sends us in a looping search for its proposition [Wittgenstein, by Fogelin]