32 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] |
10888 | Sets can be defined by 'enumeration', or by 'abstraction' (based on a property) [Zalabardo] |
15657 | To prove the consistency of set theory, we must go beyond set theory [Halbach] |
10889 | The 'Cartesian Product' of two sets relates them by pairing every element with every element [Zalabardo] |
10890 | A 'partial ordering' is reflexive, antisymmetric and transitive [Zalabardo] |
10886 | Determinacy: an object is either in a set, or it isn't [Zalabardo] |
10887 | Specification: Determinate totals of objects always make a set [Zalabardo] |
10897 | A first-order 'sentence' is a formula with no free variables [Zalabardo] |
10893 | Γ |= φ for sentences if φ is true when all of Γ is true [Zalabardo] |
10899 | Γ |= φ if φ is true when all of Γ is true, for all structures and interpretations [Zalabardo] |
15652 | We can use truth instead of ontologically loaded second-order comprehension assumptions about properties [Halbach] |
10896 | Propositional logic just needs ¬, and one of ∧, ∨ and → [Zalabardo] |
15651 | Instead of saying x has a property, we can say a formula is true of x - as long as we have 'true' [Halbach] |
10898 | The semantics shows how truth values depend on instantiations of properties and relations [Zalabardo] |
10902 | We can do semantics by looking at given propositions, or by building new ones [Zalabardo] |
10892 | We make a truth assignment to T and F, which may be true and false, but merely differ from one another [Zalabardo] |
10895 | 'Logically true' (|= φ) is true for every truth-assignment [Zalabardo] |
10900 | Logically true sentences are true in all structures [Zalabardo] |
10894 | A sentence-set is 'satisfiable' if at least one truth-assignment makes them all true [Zalabardo] |
10901 | Some formulas are 'satisfiable' if there is a structure and interpretation that makes them true [Zalabardo] |
10903 | A structure models a sentence if it is true in the model, and a set of sentences if they are all true in the model [Zalabardo] |
10891 | If a set is defined by induction, then proof by induction can be applied to it [Zalabardo] |
19520 | Evidentialism is not axiomatic; the evidence itself inclines us towards evidentialism [Conee] |
19521 | If pure guesses were reliable, reliabilists would have to endorse them [Conee] |
19522 | More than actual reliability is needed, since I may mistakenly doubt what is reliable [Conee] |
19523 | Reliabilism is poor on reflective judgements about hypothetical cases [Conee] |