79 ideas
| 21943 | Since Kant, self-criticism has been part of philosophy [Gutting] |
| 21944 | Structuralism describes human phenomena in terms of unconscious structures [Gutting] |
| 19160 | A comprehensive theory of truth probably includes a theory of predication [Davidson] |
| 19151 | Antirealism about truth prevents its use as an intersubjective standard [Davidson] |
| 19144 | 'Epistemic' truth depends what rational creatures can verify [Davidson] |
| 19148 | There is nothing interesting or instructive for truths to correspond to [Davidson] |
| 19166 | The Slingshot assumes substitutions give logical equivalence, and thus identical correspondence [Davidson] |
| 19167 | Two sentences can be rephrased by equivalent substitutions to correspond to the same thing [Davidson] |
| 19150 | Coherence truth says a consistent set of sentences is true - which ties truth to belief [Davidson] |
| 19145 | We can explain truth in terms of satisfaction - but also explain satisfaction in terms of truth [Davidson] |
| 19146 | Satisfaction is a sort of reference, so maybe we can define truth in terms of reference? [Davidson] |
| 19174 | Axioms spell out sentence satisfaction. With no free variables, all sequences satisfy the truths [Davidson] |
| 19136 | Many say that Tarski's definitions fail to connect truth to meaning [Davidson] |
| 19139 | Tarski does not tell us what his various truth predicates have in common [Davidson] |
| 19147 | Truth is the basic concept, because Convention-T is agreed to fix the truths of a language [Davidson] |
| 19172 | To define a class of true sentences is to stipulate a possible language [Davidson] |
| 19153 | Truth is basic and clear, so don't try to replace it with something simpler [Davidson] |
| 19170 | Tarski is not a disquotationalist, because you can assign truth to a sentence you can't quote [Davidson] |
| 13689 | 'Theorems' are formulas provable from no premises at all [Sider] |
| 13705 | Truth tables assume truth functionality, and are just pictures of truth functions [Sider] |
| 13706 | Intuitively, deontic accessibility seems not to be reflexive, but to be serial [Sider] |
| 13710 | In D we add that 'what is necessary is possible'; then tautologies are possible, and contradictions not necessary [Sider] |
| 13711 | System B introduces iterated modalities [Sider] |
| 13708 | S5 is the strongest system, since it has the most valid formulas, because it is easy to be S5-valid [Sider] |
| 13712 | Epistemic accessibility is reflexive, and allows positive and negative introspection (KK and K¬K) [Sider] |
| 13714 | We can treat modal worlds as different times [Sider] |
| 13720 | Converse Barcan Formula: □∀αφ→∀α□φ [Sider] |
| 13718 | The Barcan Formula ∀x□Fx→□∀xFx may be a defect in modal logic [Sider] |
| 13723 | System B is needed to prove the Barcan Formula [Sider] |
| 13715 | You can employ intuitionist logic without intuitionism about mathematics [Sider] |
| 13678 | The most popular account of logical consequence is the semantic or model-theoretic one [Sider] |
| 13679 | Maybe logical consequence is more a matter of provability than of truth-preservation [Sider] |
| 13682 | Maybe logical consequence is impossibility of the premises being true and the consequent false [Sider] |
| 13680 | Maybe logical consequence is a primitive notion [Sider] |
| 13722 | A 'theorem' is an axiom, or the last line of a legitimate proof [Sider] |
| 13696 | When a variable is 'free' of the quantifier, the result seems incapable of truth or falsity [Sider] |
| 13700 | A 'total' function must always produce an output for a given domain [Sider] |
| 13703 | λ can treat 'is cold and hungry' as a single predicate [Sider] |
| 13688 | Good axioms should be indisputable logical truths [Sider] |
| 13687 | No assumptions in axiomatic proofs, so no conditional proof or reductio [Sider] |
| 13690 | Proof by induction 'on the length of the formula' deconstructs a formula into its accepted atoms [Sider] |
| 13691 | Induction has a 'base case', then an 'inductive hypothesis', and then the 'inductive step' [Sider] |
| 13685 | Natural deduction helpfully allows reasoning with assumptions [Sider] |
| 13686 | We can build proofs just from conclusions, rather than from plain formulae [Sider] |
| 13697 | Valuations in PC assign truth values to formulas relative to variable assignments [Sider] |
| 13684 | The semantical notion of a logical truth is validity, being true in all interpretations [Sider] |
| 13704 | It is hard to say which are the logical truths in modal logic, especially for iterated modal operators [Sider] |
| 19140 | 'Satisfaction' is a generalised form of reference [Davidson] |
| 13724 | In model theory, first define truth, then validity as truth in all models, and consequence as truth-preservation [Sider] |
| 13698 | In a complete logic you can avoid axiomatic proofs, by using models to show consequences [Sider] |
| 13699 | Compactness surprisingly says that no contradictions can emerge when the set goes infinite [Sider] |
| 13701 | A single second-order sentence validates all of arithmetic - but this can't be proved axiomatically [Sider] |
| 13692 | A 'precisification' of a trivalent interpretation reduces it to a bivalent interpretation [Sider] |
| 13695 | Supervaluational logic is classical, except when it adds the 'Definitely' operator [Sider] |
| 13693 | A 'supervaluation' assigns further Ts and Fs, if they have been assigned in every precisification [Sider] |
| 13694 | We can 'sharpen' vague terms, and then define truth as true-on-all-sharpenings [Sider] |
| 13683 | A relation is a feature of multiple objects taken together [Sider] |
| 19173 | Treating predicates as sets drops the predicate for a new predicate 'is a member of', which is no help [Davidson] |
| 13702 | The identity of indiscernibles is necessarily true, if being a member of some set counts as a property [Sider] |
| 13721 | 'Strong' necessity in all possible worlds; 'weak' necessity in the worlds where the relevant objects exist [Sider] |
| 13707 | Maybe metaphysical accessibility is intransitive, if a world in which I am a frog is impossible [Sider] |
| 13709 | Logical truths must be necessary if anything is [Sider] |
| 19142 | Probability can be constrained by axioms, but that leaves open its truth nature [Davidson] |
| 13716 | 'If B hadn't shot L someone else would have' if false; 'If B didn't shoot L, someone else did' is true [Sider] |
| 13717 | Transworld identity is not a problem in de dicto sentences, which needn't identify an individual [Sider] |
| 13719 | Barcan Formula problem: there might have been a ghost, despite nothing existing which could be a ghost [Sider] |
| 19169 | Predicates are a source of generality in sentences [Davidson] |
| 19149 | If we reject corresponding 'facts', we should also give up the linked idea of 'representations' [Davidson] |
| 19163 | You only understand an order if you know what it is to obey it [Davidson] |
| 19152 | Utterances have the truth conditions intended by the speaker [Davidson] |
| 19162 | Meaning involves use, but a sentence has many uses, while meaning stays fixed [Davidson] |
| 19131 | We recognise sentences at once as linguistic units; we then figure out their parts [Davidson] |
| 19156 | Modern predicates have 'places', and are sentences with singular terms deleted from the places [Davidson] |
| 19176 | The concept of truth can explain predication [Davidson] |
| 19133 | If you assign semantics to sentence parts, the sentence fails to compose a whole [Davidson] |
| 19132 | Top-down semantic analysis must begin with truth, as it is obvious, and explains linguistic usage [Davidson] |
| 19158 | 'Humanity belongs to Socrates' is about humanity, so it's a different proposition from 'Socrates is human' [Davidson] |
| 19154 | The principle of charity says an interpreter must assume the logical constants [Davidson] |
| 19161 | We indicate use of a metaphor by its obvious falseness, or trivial truth [Davidson] |