84 ideas
18730 | The history of philosophy only matters if the subject is a choice between rival theories [Wittgenstein] |
18704 | Philosophy tries to be rid of certain intellectual puzzles, irrelevant to daily life [Wittgenstein] |
18710 | Philosophers express puzzlement, but don't clearly state the puzzle [Wittgenstein] |
18732 | We don't need a theory of truth, because we use the word perfectly well [Wittgenstein] |
18714 | We already know what we want to know, and analysis gives us no new facts [Wittgenstein] |
18706 | Words of the same kind can be substituted in a proposition without producing nonsense [Wittgenstein] |
18719 | Grammar says that saying 'sound is red' is not false, but nonsense [Wittgenstein] |
18735 | Talking nonsense is not following the rules [Wittgenstein] |
18731 | There is no theory of truth, because it isn't a concept [Wittgenstein] |
18707 | All thought has the logical form of reality [Wittgenstein] |
10073 | There cannot be a set theory which is complete [Smith,P] |
18724 | In logic nothing is hidden [Wittgenstein] |
10616 | Second-order arithmetic can prove new sentences of first-order [Smith,P] |
18709 | Laws of logic are like laws of chess - if you change them, it's just a different game [Wittgenstein] |
18736 | Contradiction is between two rules, not between rule and reality [Wittgenstein] |
18723 | We may correctly use 'not' without making the rule explicit [Wittgenstein] |
18718 | Saying 'and' has meaning is just saying it works in a sentence [Wittgenstein] |
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] |
10612 | An argument is a 'fixed point' for a function if it is mapped back to itself [Smith,P] |
10074 | A 'total function' maps every element to one element in another set [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] |
18727 | A person's name doesn't mean their body; bodies don't sit down, and their existence can be denied [Wittgenstein] |
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] |
10077 | A 'surjective' ('onto') function creates every element of the output set [Smith,P] |
10078 | An 'injective' ('one-to-one') function creates a distinct output element from each original [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] |
10069 | A theory is 'negation complete' if one of its sentences or its negation can always be proved [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] |
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] |
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] |
10083 | A set is 'effectively enumerable' if a computer could eventually list every member [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] |
18738 | We don't get 'nearer' to something by adding decimals to 1.1412... (root-2) [Wittgenstein] |
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] |
18708 | Infinity is not a number, so doesn't say how many; it is the property of a law [Wittgenstein] |
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] |
10850 | Baby Arithmetic is complete, but not very expressive [Smith,P] |
10849 | Baby arithmetic covers addition and multiplication, but no general facts about numbers [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] |
10604 | Incompleteness results in arithmetic from combining addition and successor with multiplication [Smith,P] |
10848 | Multiplication only generates incompleteness if combined with addition and successor [Smith,P] |
18737 | There are no positive or negative facts; these are just the forms of propositions [Wittgenstein] |
10617 | The 'ancestral' of a relation is a new relation which creates a long chain of the original relation [Smith,P] |
18715 | Using 'green' is a commitment to future usage of 'green' [Wittgenstein] |
18726 | For each necessity in the world there is an arbitrary rule of language [Wittgenstein] |
18712 | Understanding is translation, into action or into other symbols [Wittgenstein] |
18280 | We live in sense-data, but talk about physical objects [Wittgenstein] |
18729 | Part of what we mean by stating the facts is the way we tend to experience them [Wittgenstein] |
18734 | If you remember wrongly, then there must be some other criterion than your remembering [Wittgenstein] |
18721 | Explanation and understanding are the same [Wittgenstein] |
18720 | Explanation gives understanding by revealing the full multiplicity of the thing [Wittgenstein] |
18716 | A machine strikes us as being a rule of movement [Wittgenstein] |
18713 | If an explanation is good, the symbol is used properly in the future [Wittgenstein] |
7658 | Obviously there can't be a functional anaylsis of qualia if they are defined by intrinsic properties [Dennett] |
7655 | The work done by the 'homunculus in the theatre' must be spread amongst non-conscious agencies [Dennett] |
7657 | Intelligent agents are composed of nested homunculi, of decreasing intelligence, ending in machines [Dennett] |
7656 | I don't deny consciousness; it just isn't what people think it is [Dennett] |
18717 | Thought is an activity which we perform by the expression of it [Wittgenstein] |
7654 | What matters about neuro-science is the discovery of the functional role of the chemistry [Dennett] |
18725 | A proposition draws a line around the facts which agree with it [Wittgenstein] |
18728 | The meaning of a proposition is the mode of its verification [Wittgenstein] |
18705 | Words function only in propositions, like levers in a machine [Wittgenstein] |
18711 | A proposition is any expression which can be significantly negated [Wittgenstein] |
18733 | Laws of nature are an aspect of the phenomena, and are just our mode of description [Wittgenstein] |