75 ideas
3593 | The only way to specify the corresponding fact is asserting the sentence [Williams,M] |
3585 | Coherence needs positive links, not just absence of conflict [Williams,M] |
3584 | Justification needs coherence, while truth might be ideal coherence [Williams,M] |
10073 | There cannot be a set theory which is complete [Smith,P] |
3599 | Deduction shows entailments, not what to believe [Williams,M] |
10616 | Second-order arithmetic can prove new sentences of first-order [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] |
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] |
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] |
10078 | An 'injective' ('one-to-one') function creates a distinct output element from each original [Smith,P] |
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] |
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] |
10608 | The number of Fs is the 'successor' of the Gs if there is a single F that isn't G [Smith,P] |
10618 | All numbers are related to zero by the ancestral of the successor relation [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] |
10851 | Robinson Arithmetic 'Q' has basic axioms, quantifiers and first-order logic [Smith,P] |
10852 | Robinson Arithmetic (Q) is not negation complete [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] |
3591 | We could never pin down how many beliefs we have [Williams,M] |
3582 | Propositions make error possible, so basic experiential knowledge is impossible [Williams,M] |
3592 | Phenomenalism is a form of idealism [Williams,M] |
3579 | Sense data avoid the danger of misrepresenting the world [Williams,M] |
3581 | Sense data can't give us knowledge if they are non-propositional [Williams,M] |
3564 | Is it people who are justified, or propositions? [Williams,M] |
3595 | What works always takes precedence over theories [Williams,M] |
3580 | Experience must be meaningful to act as foundations [Williams,M] |
3578 | Are empirical foundations judgements or experiences? [Williams,M] |
3576 | Foundationalists are torn between adequacy and security [Williams,M] |
3577 | Strong justification eliminates error, but also reduces our true beliefs [Williams,M] |
21513 | We can no more expect a precise definition of coherence than we can of the moral ideal [Ewing] |
21497 | If undetailed, 'coherence' is just a vague words that covers all possible arguments [Ewing] |
3589 | Why should diverse parts of our knowledge be connected? [Williams,M] |
3590 | Coherence theory must give a foundational status to coherence itself [Williams,M] |
3571 | Externalism does not require knowing that you know [Williams,M] |
3574 | Externalism ignores the social aspect of knowledge [Williams,M] |
3569 | In the causal theory of knowledge the facts must cause the belief [Williams,M] |
3567 | How could there be causal relations to mathematical facts? [Williams,M] |
3586 | Only a belief can justify a belief [Williams,M] |
3573 | Externalist reliability refers to a range of conventional conditions [Williams,M] |
3565 | Sometimes I ought to distrust sources which are actually reliable [Williams,M] |
3566 | We control our beliefs by virtue of how we enquire [Williams,M] |
3594 | Scepticism just reveals our limited ability to explain things [Williams,M] |
3575 | Scepticism can involve discrepancy, relativity, infinity, assumption and circularity [Williams,M] |
3587 | Seeing electrons in a cloud chamber requires theory [Williams,M] |
3588 | Foundationalists base meaning in words, coherentists base it in sentences [Williams,M] |