72 ideas
| 22026 | Philosophy is homesickness - the urge to be at home everywhere [Novalis] |
| 22317 | Truth does not admit of more and less [Frege] |
| 13455 | Frege did not think of himself as working with sets [Frege, by Hart,WD] |
| 16895 | The null set is indefensible, because it collects nothing [Frege, by Burge] |
| 10073 | There cannot be a set theory which is complete [Smith,P] |
| 3328 | Frege proposed a realist concept of a set, as the extension of a predicate or concept or function [Frege, by Benardete,JA] |
| 9179 | Frege frequently expressed a contempt for language [Frege, by Dummett] |
| 10616 | Second-order arithmetic can prove new sentences of first-order [Smith,P] |
| 13473 | Frege thinks there is an independent logical order of the truths, which we must try to discover [Frege, by Hart,WD] |
| 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] |
| 10076 | The 'range' of a function is the set of elements in the output set created by the function [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] |
| 3319 | Frege gives a functional account of predication so that we can dispense with predicates [Frege, by Benardete,JA] |
| 6076 | For Frege, predicates are names of functions that map objects onto the True and False [Frege, by McGinn] |
| 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] |
| 9871 | Frege always, and fatally, neglected the domain of quantification [Dummett on Frege] |
| 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] |
| 16884 | Basic truths of logic are not proved, but seen as true when they are understood [Frege, by Burge] |
| 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] |
| 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] |
| 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] |
| 10080 | 'Effective' means simple, unintuitive, independent, controlled, dumb, and terminating [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] |
| 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] |
| 3331 | If '5' is the set of all sets with five members, that may be circular, and you can know a priori if the set has content [Benardete,JA on Frege] |
| 16880 | Frege aimed to discover the logical foundations which justify arithmetical judgements [Frege, by Burge] |
| 8689 | Eventually Frege tried to found arithmetic in geometry instead of in logic [Frege, by Friend] |
| 5657 | Frege's logic showed that there is no concept of being [Frege, by Scruton] |
| 10617 | The 'ancestral' of a relation is a new relation which creates a long chain of the original relation [Smith,P] |
| 3318 | Frege made identity a logical notion, enshrined above all in the formula 'for all x, x=x' [Frege, by Benardete,JA] |
| 16885 | To understand a thought, understand its inferential connections to other thoughts [Frege, by Burge] |
| 16887 | Frege's concept of 'self-evident' makes no reference to minds [Frege, by Burge] |
| 16894 | An apriori truth is grounded in generality, which is universal quantification [Frege, by Burge] |
| 16882 | The building blocks contain the whole contents of a discipline [Frege] |
| 19591 | Desire for perfection is an illness, if it turns against what is imperfect [Novalis] |
| 5816 | Frege said concepts were abstract entities, not mental entities [Frege, by Putnam] |
| 7307 | A thought is not psychological, but a condition of the world that makes a sentence true [Frege, by Miller,A] |
| 7309 | Frege's 'sense' is the strict and literal meaning, stripped of tone [Frege, by Miller,A] |
| 7312 | 'Sense' solves the problems of bearerless names, substitution in beliefs, and informativeness [Frege, by Miller,A] |
| 7725 | 'P or not-p' seems to be analytic, but does not fit Kant's account, lacking clear subject or predicate [Frege, by Weiner] |
| 7316 | Analytic truths are those that can be demonstrated using only logic and definitions [Frege, by Miller,A] |
| 3307 | Frege put forward an ontological argument for the existence of numbers [Frege, by Benardete,JA] |