32 ideas
5750 | Consistency is modal, saying propositions are consistent if they could be true together [Melia] |
5737 | Predicate logic has connectives, quantifiers, variables, predicates, equality, names and brackets [Melia] |
5744 | First-order predicate calculus is extensional logic, but quantified modal logic is intensional (hence dubious) [Melia] |
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] |
5740 | Second-order logic needs second-order variables and quantification into predicate position [Melia] |
5741 | If every model that makes premises true also makes conclusion true, the argument is valid [Melia] |
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] |
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] |
10156 | 'Recursion theory' concerns what can be solved by computing machines [Feferman/Feferman] |
10155 | Both Principia Mathematica and Peano Arithmetic are undecidable [Feferman/Feferman] |
18200 | Very large sets should be studied in an 'if-then' spirit [Putnam] |
18199 | Indispensability strongly supports predicative sets, and somewhat supports impredicative sets [Putnam] |
8857 | We must quantify over numbers for science; but that commits us to their existence [Putnam] |
5736 | No sort of plain language or levels of logic can express modal facts properly [Melia] |
5735 | Maybe names and predicates can capture any fact [Melia] |
5746 | The Identity of Indiscernibles is contentious for qualities, and trivial for non-qualities [Melia] |
5738 | We may be sure that P is necessary, but is it necessarily necessary? [Melia] |
5732 | 'De re' modality is about things themselves, 'de dicto' modality is about propositions [Melia] |
5739 | Sometimes we want to specify in what ways a thing is possible [Melia] |
5734 | Possible worlds make it possible to define necessity and counterfactuals without new primitives [Melia] |
5742 | In possible worlds semantics the modal operators are treated as quantifiers [Melia] |
5743 | If possible worlds semantics is not realist about possible worlds, logic becomes merely formal [Melia] |
5749 | Possible worlds could be real as mathematics, propositions, properties, or like books [Melia] |
5751 | The truth of propositions at possible worlds are implied by the world, just as in books [Melia] |
5748 | We accept unverifiable propositions because of simplicity, utility, explanation and plausibility [Melia] |