28 ideas
15647 | Truth definitions don't produce a good theory, because they go beyond your current language [Halbach] |
15649 | In semantic theories of truth, the predicate is in an object-language, and the definition in a metalanguage [Halbach] |
15655 | Should axiomatic truth be 'conservative' - not proving anything apart from implications of the axioms? [Halbach] |
15654 | If truth is defined it can be eliminated, whereas axiomatic truth has various commitments [Halbach] |
15650 | Axiomatic theories of truth need a weak logical framework, and not a strong metatheory [Halbach] |
15648 | Instead of a truth definition, add a primitive truth predicate, and axioms for how it works [Halbach] |
15656 | Deflationists say truth merely serves to express infinite conjunctions [Halbach] |
15657 | To prove the consistency of set theory, we must go beyond set theory [Halbach] |
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] |
15652 | We can use truth instead of ontologically loaded second-order comprehension assumptions about properties [Halbach] |
10762 | In sentential logic there is a simple proof that all truth functions can be reduced to 'not' and 'and' [Tharp] |
15651 | Instead of saying x has a property, we can say a formula is true of x - as long as we have 'true' [Halbach] |
10776 | The main quantifiers extend 'and' and 'or' to infinite domains [Tharp] |
10774 | There are at least five unorthodox quantifiers that could be used [Tharp] |
10777 | Skolem mistakenly inferred that Cantor's conceptions were illusory [Tharp] |
10773 | The Löwenheim-Skolem property is a limitation (e.g. can't say there are uncountably many reals) [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] |
3161 | If mind is just an explanation, the explainer must have beliefs [Rey on Dennett] |
3177 | You couldn't drive a car without folk psychology [Dennett] |