75 ideas
| 6887 | Linguistic philosophy approaches problems by attending to actual linguistic usage [Mautner] |
| 6881 | Analytic philosophy studies the unimportant, and sharpens tools instead of using them [Mautner] |
| 5439 | The 'hermeneutic circle' says parts and wholes are interdependent, and so cannot be interpreted [Mautner] |
| 9959 | 'Real' definitions give the essential properties of things under a concept [Mautner] |
| 9961 | 'Contextual definitions' replace whole statements, not just expressions [Mautner] |
| 9958 | Recursive definition defines each instance from a previous instance [Mautner] |
| 9960 | A stipulative definition lays down that an expression is to have a certain meaning [Mautner] |
| 9957 | Ostensive definitions point to an object which an expression denotes [Mautner] |
| 6219 | The fallacy of composition is the assumption that what is true of the parts is true of the whole [Mautner] |
| 6888 | Fuzzy logic is based on the notion that there can be membership of a set to some degree [Mautner] |
| 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] |
| 6877 | Entailment is logical requirement; it may be not(p and not-q), but that has problems [Mautner] |
| 6880 | Strict implication says false propositions imply everything, and everything implies true propositions [Mautner] |
| 6879 | 'Material implication' is defined as 'not(p and not-q)', but seems to imply a connection between p and q [Mautner] |
| 6878 | A person who 'infers' draws the conclusion, but a person who 'implies' leaves it to the audience [Mautner] |
| 6889 | Vagueness seems to be inconsistent with the view that every proposition is true or false [Mautner] |
| 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] |
| 6890 | Quantifiers turn an open sentence into one to which a truth-value can be assigned [Mautner] |
| 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] |
| 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] |
| 6882 | Counterfactuals presuppose a belief (or a fact) that the condition is false [Mautner] |
| 6886 | Counterfactuals are not true, they are merely valid [Mautner] |
| 6885 | Counterfactuals are true if in every world close to actual where p is the case, q is also the case [Mautner] |
| 6884 | Counterfactuals say 'If it had been, or were, p, then it would be q' [Mautner] |
| 6883 | Maybe counterfactuals are only true if they contain valid inference from premisses [Mautner] |
| 5449 | Essentialism is often identified with belief in 'de re' necessary truths [Mautner] |
| 6898 | Fallibilism is the view that all knowledge-claims are provisional [Mautner] |
| 6452 | 'Sense-data' arrived in 1910, but it denotes ideas in Locke, Berkeley and Hume [Mautner] |
| 4783 | Observing lots of green x can confirm 'all x are green' or 'all x are grue', where 'grue' is arbitrary [Mautner, by PG] |
| 4782 | 'All x are y' is equivalent to 'all non-y are non-x', so observing paper is white confirms 'ravens are black' [Mautner, by PG] |
| 6899 | The references of indexicals ('there', 'now', 'I') depend on the circumstances of utterance [Mautner] |
| 6896 | Double effect is the distinction between what is foreseen and what is intended [Mautner] |
| 6897 | Double effect acts need goodness, unintended evil, good not caused by evil, and outweighing [Mautner] |
| 5452 | 'Essentialism' is opposed to existentialism, and claims there is a human nature [Mautner] |
| 4800 | Natural laws result from eliminative induction, where enumerative induction gives generalisations [Cohen,LJ, by Psillos] |