81 ideas
| 13634 | Satisfaction is 'truth in a model', which is a model of 'truth' [Shapiro] |
| 13643 | Aristotelian logic is complete [Shapiro] |
| 9724 | Until the 1960s the only semantics was truth-tables [Enderton] |
| 9703 | 'dom R' indicates the 'domain' of objects having a relation [Enderton] |
| 9705 | 'fld R' indicates the 'field' of all objects in the relation [Enderton] |
| 9704 | 'ran R' indicates the 'range' of objects being related to [Enderton] |
| 9710 | We write F:A→B to indicate that A maps into B (the output of F on A is in B) [Enderton] |
| 9707 | 'F(x)' is the unique value which F assumes for a value of x [Enderton] |
| 9712 | A relation is 'symmetric' on a set if every ordered pair has the relation in both directions [Enderton] |
| 9713 | A relation is 'transitive' if it can be carried over from two ordered pairs to a third [Enderton] |
| 9699 | The 'powerset' of a set is all the subsets of a given set [Enderton] |
| 9700 | Two sets are 'disjoint' iff their intersection is empty [Enderton] |
| 9702 | A 'domain' of a relation is the set of members of ordered pairs in the relation [Enderton] |
| 9701 | A 'relation' is a set of ordered pairs [Enderton] |
| 9706 | A 'function' is a relation in which each object is related to just one other object [Enderton] |
| 9708 | A function 'maps A into B' if the relating things are set A, and the things related to are all in B [Enderton] |
| 9709 | A function 'maps A onto B' if the relating things are set A, and the things related to are set B [Enderton] |
| 9711 | A relation is 'reflexive' on a set if every member bears the relation to itself [Enderton] |
| 9714 | A relation satisfies 'trichotomy' if all pairs are either relations, or contain identical objects [Enderton] |
| 9717 | A set is 'dominated' by another if a one-to-one function maps the first set into a subset of the second [Enderton] |
| 13651 | A set is 'transitive' if contains every member of each of its members [Shapiro] |
| 9715 | An 'equivalence relation' is a reflexive, symmetric and transitive binary relation [Enderton] |
| 9716 | We 'partition' a set into distinct subsets, according to each relation on its objects [Enderton] |
| 13647 | Choice is essential for proving downward Löwenheim-Skolem [Shapiro] |
| 13631 | Are sets part of logic, or part of mathematics? [Shapiro] |
| 13654 | It is central to the iterative conception that membership is well-founded, with no infinite descending chains [Shapiro] |
| 13640 | Russell's paradox shows that there are classes which are not iterative sets [Shapiro] |
| 13666 | Iterative sets are not Boolean; the complement of an iterative set is not an iterative sets [Shapiro] |
| 13653 | 'Well-ordering' of a set is an irreflexive, transitive, and binary relation with a least element [Shapiro] |
| 9722 | Inference not from content, but from the fact that it was said, is 'conversational implicature' [Enderton] |
| 13627 | There is no 'correct' logic for natural languages [Shapiro] |
| 13642 | Logic is the ideal for learning new propositions on the basis of others [Shapiro] |
| 13668 | Bernays (1918) formulated and proved the completeness of propositional logic [Shapiro] |
| 13669 | Can one develop set theory first, then derive numbers, or are numbers more basic? [Shapiro] |
| 13667 | Skolem and Gödel championed first-order, and Zermelo, Hilbert, and Bernays championed higher-order [Shapiro] |
| 13662 | First-order logic was an afterthought in the development of modern logic [Shapiro] |
| 13624 | The 'triumph' of first-order logic may be related to logicism and the Hilbert programme, which failed [Shapiro] |
| 13660 | Maybe compactness, semantic effectiveness, and the Löwenheim-Skolem properties are desirable [Shapiro] |
| 13673 | The notion of finitude is actually built into first-order languages [Shapiro] |
| 15944 | Second-order logic is better than set theory, since it only adds relations and operations, and nothing else [Shapiro, by Lavine] |
| 13629 | Broad standard semantics, or Henkin semantics with a subclass, or many-sorted first-order semantics? [Shapiro] |
| 13650 | Henkin semantics has separate variables ranging over the relations and over the functions [Shapiro] |
| 13645 | In standard semantics for second-order logic, a single domain fixes the ranges for the variables [Shapiro] |
| 13649 | Completeness, Compactness and Löwenheim-Skolem fail in second-order standard semantics [Shapiro] |
| 9718 | Validity is either semantic (what preserves truth), or proof-theoretic (following procedures) [Enderton] |
| 13626 | Semantic consequence is ineffective in second-order logic [Shapiro] |
| 13637 | If a logic is incomplete, its semantic consequence relation is not effective [Shapiro] |
| 13632 | Finding the logical form of a sentence is difficult, and there are no criteria of correctness [Shapiro] |
| 13674 | We might reduce ontology by using truth of sentences and terms, instead of using objects satisfying models [Shapiro] |
| 9721 | A logical truth or tautology is a logical consequence of the empty set [Enderton] |
| 9994 | A truth assignment to the components of a wff 'satisfy' it if the wff is then True [Enderton] |
| 13633 | 'Satisfaction' is a function from models, assignments, and formulas to {true,false} [Shapiro] |
| 13644 | Semantics for models uses set-theory [Shapiro] |
| 13636 | An axiomatization is 'categorical' if its models are isomorphic, so there is really only one interpretation [Shapiro] |
| 13670 | Categoricity can't be reached in a first-order language [Shapiro] |
| 13648 | The Löwenheim-Skolem theorems show an explosion of infinite models, so 1st-order is useless for infinity [Shapiro] |
| 13675 | Substitutional semantics only has countably many terms, so Upward Löwenheim-Skolem trivially fails [Shapiro] |
| 13658 | Downward Löwenheim-Skolem: each satisfiable countable set always has countable models [Shapiro] |
| 13659 | Upward Löwenheim-Skolem: each infinite model has infinite models of all sizes [Shapiro] |
| 9719 | A proof theory is 'sound' if its valid inferences entail semantic validity [Enderton] |
| 13635 | 'Weakly sound' if every theorem is a logical truth; 'sound' if every deduction is a semantic consequence [Shapiro] |
| 9720 | A proof theory is 'complete' if semantically valid inferences entail proof-theoretic validity [Enderton] |
| 13628 | We can live well without completeness in logic [Shapiro] |
| 9995 | Proof in finite subsets is sufficient for proof in an infinite set [Enderton] |
| 13630 | Non-compactness is a strength of second-order logic, enabling characterisation of infinite structures [Shapiro] |
| 13646 | Compactness is derived from soundness and completeness [Shapiro] |
| 9996 | Expressions are 'decidable' if inclusion in them (or not) can be proved [Enderton] |
| 9997 | For a reasonable language, the set of valid wff's can always be enumerated [Enderton] |
| 13661 | A language is 'semantically effective' if its logical truths are recursively enumerable [Shapiro] |
| 13641 | Complex numbers can be defined as reals, which are defined as rationals, then integers, then naturals [Shapiro] |
| 13676 | Only higher-order languages can specify that 0,1,2,... are all the natural numbers that there are [Shapiro] |
| 13677 | Natural numbers are the finite ordinals, and integers are equivalence classes of pairs of finite ordinals [Shapiro] |
| 13652 | The 'continuum' is the cardinality of the powerset of a denumerably infinite set [Shapiro] |
| 13657 | First-order arithmetic can't even represent basic number theory [Shapiro] |
| 13656 | Some sets of natural numbers are definable in set-theory but not in arithmetic [Shapiro] |
| 13664 | Logicism is distinctive in seeking a universal language, and denying that logic is a series of abstractions [Shapiro] |
| 13625 | Mathematics and logic have no border, and logic must involve mathematics and its ontology [Shapiro] |
| 13663 | Some reject formal properties if they are not defined, or defined impredicatively [Shapiro] |
| 13638 | Properties are often seen as intensional; equiangular and equilateral are different, despite identity of objects [Shapiro] |
| 9723 | Sentences with 'if' are only conditionals if they can read as A-implies-B [Enderton] |
| 6672 | Moore's Paradox: you can't assert 'I believe that p but p is false', but can assert 'You believe p but p is false' [Moore,GE, by Lowe] |