96 ideas
13634 | Satisfaction is 'truth in a model', which is a model of 'truth' [Shapiro] |
13643 | Aristotelian logic is complete [Shapiro] |
10987 | Three traditional names of rules are 'Simplification', 'Addition' and 'Disjunctive Syllogism' [Read] |
11004 | Necessity is provability in S4, and true in all worlds in S5 [Read] |
11018 | There are fuzzy predicates (and sets), and fuzzy quantifiers and modifiers [Read] |
11011 | Same say there are positive, negative and neuter free logics [Read] |
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] |
11020 | Realisms like the full Comprehension Principle, that all good concepts determine sets [Read] |
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] |
11211 | If a sound conclusion comes from two errors that cancel out, the path of the argument must matter [Rumfitt] |
13667 | Skolem and Gödel championed first-order, and Zermelo, Hilbert, and Bernays championed higher-order [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] |
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] |
10986 | Not all validity is captured in first-order logic [Read] |
10972 | The non-emptiness of the domain is characteristic of classical logic [Read] |
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] |
11024 | Semantics must precede proof in higher-order logics, since they are incomplete [Read] |
10985 | We should exclude second-order logic, precisely because it captures arithmetic [Read] |
10970 | A theory of logical consequence is a conceptual analysis, and a set of validity techniques [Read] |
10984 | Logical consequence isn't just a matter of form; it depends on connections like round-square [Read] |
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] |
11210 | Standardly 'and' and 'but' are held to have the same sense by having the same truth table [Rumfitt] |
11212 | The sense of a connective comes from primitively obvious rules of inference [Rumfitt] |
10973 | A theory is logically closed, which means infinite premisses [Read] |
11007 | Quantifiers are second-order predicates [Read] |
13674 | We might reduce ontology by using truth of sentences and terms, instead of using objects satisfying models [Shapiro] |
10978 | In second-order logic the higher-order variables range over all the properties of the objects [Read] |
10971 | A logical truth is the conclusion of a valid inference with no premisses [Read] |
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] |
10988 | Any first-order theory of sets is inadequate [Read] |
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] |
10974 | Compactness is when any consequence of infinite propositions is the consequence of a finite subset [Read] |
10975 | Compactness does not deny that an inference can have infinitely many premisses [Read] |
13646 | Compactness is derived from soundness and completeness [Shapiro] |
10977 | Compactness blocks the proof of 'for every n, A(n)' (as the proof would be infinite) [Read] |
10976 | Compactness makes consequence manageable, but restricts expressive power [Read] |
13661 | A language is 'semantically effective' if its logical truths are recursively enumerable [Shapiro] |
11014 | Self-reference paradoxes seem to arise only when falsity is involved [Read] |
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] |
11025 | Infinite cuts and successors seems to suggest an actual infinity there waiting for us [Read] |
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] |
10979 | Although second-order arithmetic is incomplete, it can fully model normal arithmetic [Read] |
10980 | Second-order arithmetic covers all properties, ensuring categoricity [Read] |
10997 | Von Neumann numbers are helpful, but don't correctly describe numbers [Read] |
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] |
11016 | Would a language without vagueness be usable at all? [Read] |
11019 | Supervaluations say there is a cut-off somewhere, but at no particular place [Read] |
11012 | A 'supervaluation' gives a proposition consistent truth-value for classical assignments [Read] |
11013 | Identities and the Indiscernibility of Identicals don't work with supervaluations [Read] |
13638 | Properties are often seen as intensional; equiangular and equilateral are different, despite identity of objects [Shapiro] |
10995 | A haecceity is a set of individual properties, essential to each thing [Read] |
11001 | Equating necessity with truth in every possible world is the S5 conception of necessity [Read] |
10992 | The point of conditionals is to show that one will accept modus ponens [Read] |
10989 | The standard view of conditionals is that they are truth-functional [Read] |
11017 | Some people even claim that conditionals do not express propositions [Read] |
10983 | Knowledge of possible worlds is not causal, but is an ontology entailed by semantics [Read] |
10982 | How can modal Platonists know the truth of a modal proposition? [Read] |
10996 | Actualism is reductionist (to parts of actuality), or moderate realist (accepting real abstractions) [Read] |
10981 | A possible world is a determination of the truth-values of all propositions of a domain [Read] |
11000 | If worlds are concrete, objects can't be present in more than one, and can only have counterparts [Read] |
10998 | The mind abstracts ways things might be, which are nonetheless real [Read] |
11005 | Negative existentials with compositionality make the whole sentence meaningless [Read] |
10966 | A proposition objectifies what a sentence says, as indicative, with secure references [Read] |
11214 | We learn 'not' along with affirmation, by learning to either affirm or deny a sentence [Rumfitt] |