79 ideas
18835 | Logic doesn't have a metaphysical basis, but nor can logic give rise to the metaphysics [Rumfitt] |
18819 | The idea that there are unrecognised truths is basic to our concept of truth [Rumfitt] |
18826 | 'True at a possibility' means necessarily true if what is said had obtained [Rumfitt] |
18803 | Semantics for propositions: 1) validity preserves truth 2) non-contradition 3) bivalence 4) truth tables [Rumfitt] |
13520 | A 'tautology' must include connectives [Wolf,RS] |
13524 | Deduction Theorem: T∪{P}|-Q, then T|-(P→Q), which justifies Conditional Proof [Wolf,RS] |
13522 | Universal Generalization: If we prove P(x) with no special assumptions, we can conclude ∀xP(x) [Wolf,RS] |
13521 | Universal Specification: ∀xP(x) implies P(t). True for all? Then true for an instance [Wolf,RS] |
13523 | Existential Generalization (or 'proof by example'): if we can say P(t), then we can say something is P [Wolf,RS] |
12204 | The logic of metaphysical necessity is S5 [Rumfitt] |
18814 | 'Absolute necessity' would have to rest on S5 [Rumfitt] |
18798 | It is the second-order part of intuitionistic logic which actually negates some classical theorems [Rumfitt] |
18799 | Intuitionists can accept Double Negation Elimination for decidable propositions [Rumfitt] |
18830 | Most set theorists doubt bivalence for the Continuum Hypothesis, but still use classical logic [Rumfitt] |
18843 | The iterated conception of set requires continual increase in axiom strength [Rumfitt] |
18836 | A set may well not consist of its members; the empty set, for example, is a problem [Rumfitt] |
18837 | A set can be determinate, because of its concept, and still have vague membership [Rumfitt] |
13529 | Empty Set: ∃x∀y ¬(y∈x). The unique empty set exists [Wolf,RS] |
18845 | If the totality of sets is not well-defined, there must be doubt about the Power Set Axiom [Rumfitt] |
13526 | Comprehension Axiom: if a collection is clearly specified, it is a set [Wolf,RS] |
11211 | If a sound conclusion comes from two errors that cancel out, the path of the argument must matter [Rumfitt] |
18815 | Logic is higher-order laws which can expand the range of any sort of deduction [Rumfitt] |
9390 | Logic guides thinking, but it isn't a substitute for it [Rumfitt] |
13534 | In first-order logic syntactic and semantic consequence (|- and |=) nicely coincide [Wolf,RS] |
13535 | First-order logic is weakly complete (valid sentences are provable); we can't prove every sentence or its negation [Wolf,RS] |
18804 | The case for classical logic rests on its rules, much more than on the Principle of Bivalence [Rumfitt] |
18805 | Classical logic rules cannot be proved, but various lines of attack can be repelled [Rumfitt] |
18827 | If truth-tables specify the connectives, classical logic must rely on Bivalence [Rumfitt] |
12195 | Soundness in argument varies with context, and may be achieved very informally indeed [Rumfitt] |
12199 | There is a modal element in consequence, in assessing reasoning from suppositions [Rumfitt] |
12201 | We reject deductions by bad consequence, so logical consequence can't be deduction [Rumfitt] |
18813 | Logical consequence is a relation that can extended into further statements [Rumfitt] |
18808 | Normal deduction presupposes the Cut Law [Rumfitt] |
18840 | When faced with vague statements, Bivalence is not a compelling principle [Rumfitt] |
12194 | Contradictions include 'This is red and not coloured', as well as the formal 'B and not-B' [Rumfitt] |
11210 | Standardly 'and' and 'but' are held to have the same sense by having the same truth table [Rumfitt] |
18802 | In specifying a logical constant, use of that constant is quite unavoidable [Rumfitt] |
11212 | The sense of a connective comes from primitively obvious rules of inference [Rumfitt] |
12198 | Geometrical axioms in logic are nowadays replaced by inference rules (which imply the logical truths) [Rumfitt] |
18800 | Introduction rules give deduction conditions, and Elimination says what can be deduced [Rumfitt] |
18809 | Logical truths are just the assumption-free by-products of logical rules [Rumfitt] |
13519 | Model theory uses sets to show that mathematical deduction fits mathematical truth [Wolf,RS] |
13533 | First-order model theory rests on completeness, compactness, and the Löwenheim-Skolem-Tarski theorem [Wolf,RS] |
13531 | Model theory reveals the structures of mathematics [Wolf,RS] |
13532 | Model theory 'structures' have a 'universe', some 'relations', some 'functions', and some 'constants' [Wolf,RS] |
13537 | An 'isomorphism' is a bijection that preserves all structural components [Wolf,RS] |
13539 | The LST Theorem is a serious limitation of first-order logic [Wolf,RS] |
13538 | If a theory is complete, only a more powerful language can strengthen it [Wolf,RS] |
13525 | Most deductive logic (unlike ordinary reasoning) is 'monotonic' - we don't retract after new givens [Wolf,RS] |
18807 | Monotonicity means there is a guarantee, rather than mere inductive support [Rumfitt] |
13530 | An ordinal is an equivalence class of well-orderings, or a transitive set whose members are transitive [Wolf,RS] |
18842 | Maybe an ordinal is a property of isomorphic well-ordered sets, and not itself a set [Rumfitt] |
17462 | A single object must not be counted twice, which needs knowledge of distinctness (negative identity) [Rumfitt] |
18834 | Infinitesimals do not stand in a determinate order relation to zero [Rumfitt] |
18846 | Cantor and Dedekind aimed to give analysis a foundation in set theory (rather than geometry) [Rumfitt] |
17461 | Some 'how many?' answers are not predications of a concept, like 'how many gallons?' [Rumfitt] |
13518 | Modern mathematics has unified all of its objects within set theory [Wolf,RS] |
16062 | A necessary relation between fact-levels seems to be a further irreducible fact [Lynch/Glasgow] |
16061 | If some facts 'logically supervene' on some others, they just redescribe them, adding nothing [Lynch/Glasgow] |
16060 | Nonreductive materialism says upper 'levels' depend on lower, but don't 'reduce' [Lynch/Glasgow] |
16064 | The hallmark of physicalism is that each causal power has a base causal power under it [Lynch/Glasgow] |
9389 | Vague membership of sets is possible if the set is defined by its concept, not its members [Rumfitt] |
18839 | An object that is not clearly red or orange can still be red-or-orange, which sweeps up problem cases [Rumfitt] |
18838 | The extension of a colour is decided by a concept's place in a network of contraries [Rumfitt] |
14532 | A distinctive type of necessity is found in logical consequence [Rumfitt, by Hale/Hoffmann,A] |
18816 | Metaphysical modalities respect the actual identities of things [Rumfitt] |
12193 | Logical necessity is when 'necessarily A' implies 'not-A is contradictory' [Rumfitt] |
12200 | A logically necessary statement need not be a priori, as it could be unknowable [Rumfitt] |
18825 | S5 is the logic of logical necessity [Rumfitt] |
12202 | Narrow non-modal logical necessity may be metaphysical, but real logical necessity is not [Rumfitt] |
18824 | Since possibilities are properties of the world, calling 'red' the determination of a determinable seems right [Rumfitt] |
18828 | If two possibilities can't share a determiner, they are incompatible [Rumfitt] |
12203 | If a world is a fully determinate way things could have been, can anyone consider such a thing? [Rumfitt] |
18821 | Possibilities are like possible worlds, but not fully determinate or complete [Rumfitt] |
18831 | Medieval logicians said understanding A also involved understanding not-A [Rumfitt] |
18820 | In English 'evidence' is a mass term, qualified by 'little' and 'more' [Rumfitt] |
18817 | We understand conditionals, but disagree over their truth-conditions [Rumfitt] |
18829 | The truth grounds for 'not A' are the possibilities incompatible with truth grounds for A [Rumfitt] |
11214 | We learn 'not' along with affirmation, by learning to either affirm or deny a sentence [Rumfitt] |