24 ideas
10147 | The Axiom of Choice is consistent with the other axioms of set theory [Feferman/Feferman] |
10148 | Axiom of Choice: a set exists which chooses just one element each of any set of sets [Feferman/Feferman] |
10149 | Platonist will accept the Axiom of Choice, but others want criteria of selection or definition [Feferman/Feferman] |
10150 | The Trichotomy Principle is equivalent to the Axiom of Choice [Feferman/Feferman] |
10146 | Cantor's theories needed the Axiom of Choice, but it has led to great controversy [Feferman/Feferman] |
10757 | Henkin semantics has a second domain of predicates and relations (in upper case) [Rossberg] |
10751 | Second-order logic needs the sets, and its consequence has epistemological problems [Rossberg] |
10759 | There are at least seven possible systems of semantics for second-order logic [Rossberg] |
10753 | Logical consequence is intuitively semantic, and captured by model theory [Rossberg] |
10752 | Γ |- S says S can be deduced from Γ; Γ |= S says a good model for Γ makes S true [Rossberg] |
10754 | In proof-theory, logical form is shown by the logical constants [Rossberg] |
10158 | A structure is a 'model' when the axioms are true. So which of the structures are models? [Feferman/Feferman] |
10162 | Tarski and Vaught established the equivalence relations between first-order structures [Feferman/Feferman] |
10756 | A model is a domain, and an interpretation assigning objects, predicates, relations etc. [Rossberg] |
10758 | If models of a mathematical theory are all isomorphic, it is 'categorical', with essentially one model [Rossberg] |
10160 | Löwenheim-Skolem says if the sentences are countable, so is the model [Feferman/Feferman] |
10159 | Löwenheim-Skolem Theorem, and Gödel's completeness of first-order logic, the earliest model theory [Feferman/Feferman] |
10161 | If a sentence holds in every model of a theory, then it is logically derivable from the theory [Feferman/Feferman] |
10761 | Completeness can always be achieved by cunning model-design [Rossberg] |
10755 | A deductive system is only incomplete with respect to a formal semantics [Rossberg] |
10156 | 'Recursion theory' concerns what can be solved by computing machines [Feferman/Feferman] |
10155 | Both Principia Mathematica and Peano Arithmetic are undecidable [Feferman/Feferman] |
1757 | The Electra: she knows this man, but not that he is her brother [Eucleides, by Diog. Laertius] |
3028 | The chief good is unity, sometimes seen as prudence, or God, or intellect [Eucleides] |