82 ideas
| 9123 | Someone standing in a doorway seems to be both in and not-in the room [Priest,G, by Sorensen] |
| 8720 | A logic is 'relevant' if premise and conclusion are connected, and 'paraconsistent' allows contradictions [Priest,G, by Friend] |
| 9672 | Free logic is one of the few first-order non-classical logics [Priest,G] |
| 9697 | X1 x X2 x X3... x Xn indicates the 'cartesian product' of those sets [Priest,G] |
| 9685 | <a,b&62; is a set whose members occur in the order shown [Priest,G] |
| 9675 | a ∈ X says a is an object in set X; a ∉ X says a is not in X [Priest,G] |
| 9674 | {x; A(x)} is a set of objects satisfying the condition A(x) [Priest,G] |
| 9673 | {a1, a2, ...an} indicates that a set comprising just those objects [Priest,G] |
| 9677 | Φ indicates the empty set, which has no members [Priest,G] |
| 9676 | {a} is the 'singleton' set of a (not the object a itself) [Priest,G] |
| 9679 | X⊂Y means set X is a 'proper subset' of set Y [Priest,G] |
| 9678 | X⊆Y means set X is a 'subset' of set Y [Priest,G] |
| 9681 | X = Y means the set X equals the set Y [Priest,G] |
| 9683 | X ∩ Y indicates the 'intersection' of sets X and Y, the objects which are in both sets [Priest,G] |
| 9682 | X∪Y indicates the 'union' of all the things in sets X and Y [Priest,G] |
| 9684 | Y - X is the 'relative complement' of X with respect to Y; the things in Y that are not in X [Priest,G] |
| 9694 | The 'relative complement' is things in the second set not in the first [Priest,G] |
| 9693 | The 'intersection' of two sets is a set of the things that are in both sets [Priest,G] |
| 9692 | The 'union' of two sets is a set containing all the things in either of the sets [Priest,G] |
| 9698 | The 'induction clause' says complex formulas retain the properties of their basic formulas [Priest,G] |
| 9695 | An 'ordered pair' (or ordered n-tuple) is a set with its members in a particular order [Priest,G] |
| 9696 | A 'cartesian product' of sets is the set of all the n-tuples with one member in each of the sets [Priest,G] |
| 9686 | A 'set' is a collection of objects [Priest,G] |
| 9689 | The 'empty set' or 'null set' has no members [Priest,G] |
| 9690 | A set is a 'subset' of another set if all of its members are in that set [Priest,G] |
| 9691 | A 'proper subset' is smaller than the containing set [Priest,G] |
| 9688 | A 'singleton' is a set with only one member [Priest,G] |
| 9687 | A 'member' of a set is one of the objects in the set [Priest,G] |
| 9680 | The empty set Φ is a subset of every set (including itself) [Priest,G] |
| 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] |
| 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] |
| 13373 | Typically, paradoxes are dealt with by dividing them into two groups, but the division is wrong [Priest,G] |
| 13368 | The 'least indefinable ordinal' is defined by that very phrase [Priest,G] |
| 13370 | 'x is a natural number definable in less than 19 words' leads to contradiction [Priest,G] |
| 13369 | By diagonalization we can define a real number that isn't in the definable set of reals [Priest,G] |
| 13366 | The least ordinal greater than the set of all ordinals is both one of them and not one of them [Priest,G] |
| 13367 | The next set up in the hierarchy of sets seems to be both a member and not a member of it [Priest,G] |
| 13371 | If you know that a sentence is not one of the known sentences, you know its truth [Priest,G] |
| 13372 | There are Liar Pairs, and Liar Chains, which fit the same pattern as the basic Liar [Priest,G] |
| 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] |
| 3061 | Anaxarchus said that he was not even sure that he knew nothing [Anaxarchus, by Diog. Laertius] |