80 ideas
6891 | Quine's naturalistic and empirical view is based entirely on first-order logic and set theory [Quine, by Mautner] |
6310 | Enquiry needs a conceptual scheme, so we should retain the best available [Quine] |
18344 | Truth and falsehood must track what does or doesn't exist [Bigelow] |
13634 | Satisfaction is 'truth in a model', which is a model of 'truth' [Shapiro] |
13643 | Aristotelian logic is complete [Shapiro] |
13651 | A set is 'transitive' if contains every member of each of its members [Shapiro] |
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] |
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] |
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] |
12798 | Plurals can in principle be paraphrased away altogether [Quine] |
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] |
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] |
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] |
13635 | 'Weakly sound' if every theorem is a logical truth; 'sound' if every deduction is a semantic consequence [Shapiro] |
13628 | We can live well without completeness in logic [Shapiro] |
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] |
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] |
17905 | Any progression will do nicely for numbers; they can all then be used to measure multiplicity [Quine] |
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] |
9556 | Nearly all of mathematics has to quantify over abstract objects [Quine] |
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] |
16462 | The quest for ultimate categories is the quest for a simple clear pattern of notation [Quine] |
13638 | Properties are often seen as intensional; equiangular and equilateral are different, despite identity of objects [Shapiro] |
15723 | Either dispositions rest on structures, or we keep saying 'all things being equal' [Quine] |
15490 | Explain unmanifested dispositions as structural similarities to objects which have manifested them [Quine, by Martin,CB] |
8504 | Quine aims to deal with properties by the use of eternal open sentences, or classes [Quine, by Devitt] |
8464 | Physical objects in space-time are just events or processes, no matter how disconnected [Quine] |
7924 | The notion of a physical object is by far the most useful one for science [Quine] |
8482 | Mathematicians must be rational but not two-legged, cyclists the opposite. So a mathematical cyclist? [Quine] |
12136 | Cyclist are not actually essentially two-legged [Brody on Quine] |
17594 | We can paraphrase 'x=y' as a sequence of the form 'if Fx then Fy' [Quine] |
15725 | Normal conditionals have a truth-value gap when the antecedent is false. [Quine] |
15722 | Conditionals are pointless if the truth value of the antecedent is known [Quine] |
15719 | We feign belief in counterfactual antecedents, and assess how convincing the consequent is [Quine] |
15721 | Counterfactuals are plausible when dispositions are involved, as they imply structures [Quine] |
15720 | What stays the same in assessing a counterfactual antecedent depends on context [Quine] |
15724 | Counterfactuals have no place in a strict account of science [Quine] |
4630 | Two theories can be internally consistent and match all the facts, yet be inconsistent with one another [Quine, by Baggini /Fosl] |
3131 | Quine expresses the instrumental version of eliminativism [Quine, by Rey] |
3988 | Indeterminacy of translation also implies indeterminacy in interpreting people's mental states [Dennett on Quine] |
6311 | The firmer the links between sentences and stimuli, the less translations can diverge [Quine] |
6312 | We can never precisely pin down how to translate the native word 'Gavagai' [Quine] |
6313 | Stimulus synonymy of 'Gavagai' and 'Rabbit' does not even guarantee they are coextensive [Quine] |
6317 | Dispositions to speech behaviour, and actual speech, are never enough to fix any one translation [Quine] |
6315 | We should be suspicious of a translation which implies that a people have very strange beliefs [Quine] |
6314 | Weird translations are always possible, but they improve if we impose our own logic on them [Quine] |