78 ideas
| 21887 | Derrida focuses on other philosophers, rather than on science [Derrida] |
| 21888 | Philosophy is just a linguistic display [Derrida] |
| 21896 | Philosophy aims to build foundations for thought [Derrida, by May] |
| 21893 | Philosophy is necessarily metaphorical, and its writing is aesthetic [Derrida] |
| 21892 | Interpretations can be interpreted, so there is no original 'meaning' available [Derrida] |
| 20925 | Hermeneutics blunts truth, by conforming it to the interpreter [Derrida, by Zimmermann,J] |
| 20934 | Hermeneutics is hostile, trying to overcome the other person's difference [Derrida, by Zimmermann,J] |
| 21895 | Structuralism destroys awareness of dynamic meaning [Derrida] |
| 21934 | The idea of being as persistent presence, and meaning as conscious intelligibility, are self-destructive [Derrida, by Glendinning] |
| 21883 | Sincerity can't be verified, so fiction infuses speech, and hence reality also [Derrida] |
| 21882 | Sentences are contradictory, as they have opposite meanings in some contexts [Derrida] |
| 21881 | We aim to explore the limits of expression (as in Mallarmé's poetry) [Derrida] |
| 4756 | Derrida says that all truth-talk is merely metaphor [Derrida, by Engel] |
| 21877 | True thoughts are inaccessible, in the subconscious, prior to speech or writing [Derrida] |
| 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] |
| 11970 | Logicians like their entities to exhibit a maximum degree of purity [Kaplan] |
| 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] |
| 21878 | Names have a subjective aspect, especially the role of our own name [Derrida] |
| 21889 | 'I' is the perfect name, because it denotes without description [Derrida] |
| 21879 | Even Kripke can't explain names; the word is the thing, and the thing is the word [Derrida] |
| 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] |
| 10079 | A 'bijective' function has one-to-one correspondence in both directions [Smith,P] |
| 10077 | A 'surjective' ('onto') function creates every element of the output set [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] |
| 11969 | Models nicely separate particulars from their clothing, and logicians often accept that metaphysically [Kaplan] |
| 11971 | The simplest solution to transworld identification is to adopt bare particulars [Kaplan] |
| 11973 | Unusual people may have no counterparts, or several [Kaplan] |
| 11972 | Essence is a transworld heir line, rather than a collection of properties [Kaplan] |
| 21890 | Heidegger showed that passing time is the key to consciousness [Derrida] |
| 21880 | 'Tacit theory' controls our thinking (which is why Freud is important) [Derrida] |
| 21886 | Meanings depend on differences and contrasts [Derrida] |
| 21930 | For Aristotle all proper nouns must have a single sense, which is the purpose of language [Derrida] |
| 21884 | Capacity for repetitions is the hallmark of language [Derrida] |
| 21935 | The sign is only conceivable as a movement between elusive presences [Derrida] |
| 21933 | Writing functions even if the sender or the receiver are absent [Derrida, by Glendinning] |
| 21894 | Madness and instability ('the demonic hyperbole') lurks in all language [Derrida] |
| 11967 | Sentences might have the same sense when logically equivalent - or never have the same sense [Kaplan] |
| 21931 | 'Dissemination' is opposed to polysemia, since that is irreducible, because of multiple understandings [Derrida, by Glendinning] |
| 21885 | Words exist in 'spacing', so meanings are never synchronic except in writing [Derrida] |
| 21891 | The good is implicitly violent (against evil), so there is no pure good [Derrida] |