77 ideas
| 16010 | While faith is a passion (as Kierkegaard says), wisdom is passionless [Wittgenstein] |
| 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] |
| 10073 | There cannot be a set theory which is complete [Smith,P] |
| 10616 | Second-order arithmetic can prove new sentences of first-order [Smith,P] |
| 10075 | A 'partial function' maps only some elements to another set [Smith,P] |
| 10074 | A 'total function' maps every element to one element in another set [Smith,P] |
| 10612 | An argument is a 'fixed point' for a function if it is mapped back to itself [Smith,P] |
| 10076 | The 'range' of a function is the set of elements in the output set created by the function [Smith,P] |
| 10605 | Two functions are the same if they have the same extension [Smith,P] |
| 10615 | The Comprehension Schema says there is a property only had by things satisfying a condition [Smith,P] |
| 10595 | A 'theorem' of a theory is a sentence derived from the axioms using the proof system [Smith,P] |
| 10602 | A 'natural deduction system' has no axioms but many rules [Smith,P] |
| 10613 | No nice theory can define truth for its own language [Smith,P] |
| 19140 | 'Satisfaction' is a generalised form of reference [Davidson] |
| 10077 | A 'surjective' ('onto') function creates every element of the output set [Smith,P] |
| 10079 | A 'bijective' function has one-to-one correspondence in both directions [Smith,P] |
| 10078 | An 'injective' ('one-to-one') function creates a distinct output element from each original [Smith,P] |
| 10070 | If everything that a theory proves is true, then it is 'sound' [Smith,P] |
| 10086 | Soundness is true axioms and a truth-preserving proof system [Smith,P] |
| 10596 | A theory is 'sound' iff every theorem is true (usually from true axioms and truth-preservation) [Smith,P] |
| 10598 | A theory is 'negation complete' if it proves all sentences or their negation [Smith,P] |
| 10597 | 'Complete' applies both to whole logics, and to theories within them [Smith,P] |
| 10069 | A theory is 'negation complete' if one of its sentences or its negation can always be proved [Smith,P] |
| 10609 | Two routes to Incompleteness: semantics of sound/expressible, or syntax of consistency/proof [Smith,P] |
| 10080 | 'Effective' means simple, unintuitive, independent, controlled, dumb, and terminating [Smith,P] |
| 10087 | A theory is 'decidable' if all of its sentences could be mechanically proved [Smith,P] |
| 10088 | Any consistent, axiomatized, negation-complete formal theory is decidable [Smith,P] |
| 10081 | A set is 'enumerable' is all of its elements can result from a natural number function [Smith,P] |
| 10083 | A set is 'effectively enumerable' if a computer could eventually list every member [Smith,P] |
| 10084 | A finite set of finitely specifiable objects is always effectively enumerable (e.g. primes) [Smith,P] |
| 10085 | The set of ordered pairs of natural numbers <i,j> is effectively enumerable [Smith,P] |
| 10601 | The thorems of a nice arithmetic can be enumerated, but not the truths (so they're diffferent) [Smith,P] |
| 10600 | Being 'expressible' depends on language; being 'capture/represented' depends on axioms and proof system [Smith,P] |
| 10599 | For primes we write (x not= 1 ∧ ∀u∀v(u x v = x → (u = 1 ∨ v = 1))) [Smith,P] |
| 10610 | The reals contain the naturals, but the theory of reals doesn't contain the theory of naturals [Smith,P] |
| 10619 | The truths of arithmetic are just true equations and their universally quantified versions [Smith,P] |
| 10618 | All numbers are related to zero by the ancestral of the successor relation [Smith,P] |
| 10608 | The number of Fs is the 'successor' of the Gs if there is a single F that isn't G [Smith,P] |
| 10849 | Baby arithmetic covers addition and multiplication, but no general facts about numbers [Smith,P] |
| 10850 | Baby Arithmetic is complete, but not very expressive [Smith,P] |
| 10852 | Robinson Arithmetic (Q) is not negation complete [Smith,P] |
| 10851 | Robinson Arithmetic 'Q' has basic axioms, quantifiers and first-order logic [Smith,P] |
| 10068 | Natural numbers have zero, unique successors, unending, no circling back, and no strays [Smith,P] |
| 10603 | The logic of arithmetic must quantify over properties of numbers to handle induction [Smith,P] |
| 10848 | Multiplication only generates incompleteness if combined with addition and successor [Smith,P] |
| 10604 | Incompleteness results in arithmetic from combining addition and successor with multiplication [Smith,P] |
| 10617 | The 'ancestral' of a relation is a new relation which creates a long chain of the original relation [Smith,P] |
| 19173 | Treating predicates as sets drops the predicate for a new predicate 'is a member of', which is no help [Davidson] |
| 19142 | Probability can be constrained by axioms, but that leaves open its truth nature [Davidson] |
| 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] |