30 ideas
15134 | The truthmaker principle requires some specific named thing to make the difference [Williamson] |
15140 | The converse Barcan formula will not allow contingent truths to have truthmakers [Williamson] |
15141 | Truthmaker is incompatible with modal semantics of varying domains [Williamson] |
15131 | If metaphysical possibility is not a contingent matter, then S5 seems to suit it best [Williamson] |
15135 | If the domain of propositional quantification is constant, the Barcan formulas hold [Williamson] |
15139 | Converse Barcan: could something fail to meet a condition, if everything meets that condition? [Williamson] |
10775 | The axiom of choice now seems acceptable and obvious (if it is meaningful) [Tharp] |
10766 | Logic is either for demonstration, or for characterizing structures [Tharp] |
10767 | Elementary logic is complete, but cannot capture mathematics [Tharp] |
10769 | Second-order logic isn't provable, but will express set-theory and classic problems [Tharp] |
10762 | In sentential logic there is a simple proof that all truth functions can be reduced to 'not' and 'and' [Tharp] |
18492 | Not all quantification is either objectual or substitutional [Williamson] |
10776 | The main quantifiers extend 'and' and 'or' to infinite domains [Tharp] |
15136 | Substitutional quantification is metaphysical neutral, and equivalent to a disjunction of instances [Williamson] |
10774 | There are at least five unorthodox quantifiers that could be used [Tharp] |
15138 | Not all quantification is objectual or substitutional [Williamson] |
10773 | The Löwenheim-Skolem property is a limitation (e.g. can't say there are uncountably many reals) [Tharp] |
10777 | Skolem mistakenly inferred that Cantor's conceptions were illusory [Tharp] |
10765 | Soundness would seem to be an essential requirement of a proof procedure [Tharp] |
10763 | Completeness and compactness together give axiomatizability [Tharp] |
10770 | If completeness fails there is no algorithm to list the valid formulas [Tharp] |
10771 | Compactness is important for major theories which have infinitely many axioms [Tharp] |
10772 | Compactness blocks infinite expansion, and admits non-standard models [Tharp] |
10764 | A complete logic has an effective enumeration of the valid formulas [Tharp] |
10768 | Effective enumeration might be proved but not specified, so it won't guarantee knowledge [Tharp] |
15137 | If 'fact' is a noun, can we name the fact that dogs bark 'Mary'? [Williamson] |
15142 | Our ability to count objects across possibilities favours the Barcan formulas [Williamson] |
1748 | Archelaus was the first person to say that the universe is boundless [Archelaus, by Diog. Laertius] |
5989 | Archelaus said life began in a primeval slime [Archelaus, by Schofield] |
15133 | A thing can't be the only necessary existent, because its singleton set would be as well [Williamson] |