48 ideas
9023 | If you say that a contradiction is true, you change the meaning of 'not', and so change the subject [Quine] |
9012 | Talk of 'truth' when sentences are mentioned; it reminds us that reality is the point of sentences [Quine] |
9011 | Truth is redundant for single sentences; we do better to simply speak the sentence [Quine] |
9013 | We can eliminate 'or' from our basic theory, by paraphrasing 'p or q' as 'not(not-p and not-q)' [Quine] |
10888 | Sets can be defined by 'enumeration', or by 'abstraction' (based on a property) [Zalabardo] |
10889 | The 'Cartesian Product' of two sets relates them by pairing every element with every element [Zalabardo] |
10890 | A 'partial ordering' is reflexive, antisymmetric and transitive [Zalabardo] |
10886 | Determinacy: an object is either in a set, or it isn't [Zalabardo] |
10887 | Specification: Determinate totals of objects always make a set [Zalabardo] |
9020 | My logical grammar has sentences by predication, then negation, conjunction, and existential quantification [Quine] |
9028 | Maybe logical truth reflects reality, but in different ways in different languages [Quine] |
10897 | A first-order 'sentence' is a formula with no free variables [Zalabardo] |
10014 | Quine rejects second-order logic, saying that predicates refer to multiple objects [Quine, by Hodes] |
10828 | Quantifying over predicates is treating them as names of entities [Quine] |
10899 | Γ |= φ if φ is true when all of Γ is true, for all structures and interpretations [Zalabardo] |
10893 | Γ |= φ for sentences if φ is true when all of Γ is true [Zalabardo] |
9024 | Excluded middle has three different definitions [Quine] |
10012 | Quantification theory can still be proved complete if we add identity [Quine] |
10896 | Propositional logic just needs ¬, and one of ∧, ∨ and → [Zalabardo] |
9455 | Maybe proper names have the content of fixing a thing's category [Bealer] |
9016 | Names are not essential, because naming can be turned into predication [Quine] |
9454 | The four leading theories of definite descriptions are Frege's, Russell's, Evans's, and Prior's [Bealer] |
9015 | Universal quantification is widespread, but it is definable in terms of existential quantification [Quine] |
9025 | You can't base quantification on substituting names for variables, if the irrationals cannot all be named [Quine] |
9026 | Some quantifications could be false substitutionally and true objectually, because of nameless objects [Quine] |
10705 | Putting a predicate letter in a quantifier is to make it the name of an entity [Quine] |
10898 | The semantics shows how truth values depend on instantiations of properties and relations [Zalabardo] |
10902 | We can do semantics by looking at given propositions, or by building new ones [Zalabardo] |
10892 | We make a truth assignment to T and F, which may be true and false, but merely differ from one another [Zalabardo] |
9027 | A sentence is logically true if all sentences with that grammatical structure are true [Quine] |
10895 | 'Logically true' (|= φ) is true for every truth-assignment [Zalabardo] |
10900 | Logically true sentences are true in all structures [Zalabardo] |
10894 | A sentence-set is 'satisfiable' if at least one truth-assignment makes them all true [Zalabardo] |
10901 | Some formulas are 'satisfiable' if there is a structure and interpretation that makes them true [Zalabardo] |
10903 | A structure models a sentence if it is true in the model, and a set of sentences if they are all true in the model [Zalabardo] |
10891 | If a set is defined by induction, then proof by induction can be applied to it [Zalabardo] |
9017 | Predicates are not names; predicates are the other parties to predication [Quine] |
9018 | A physical object is the four-dimensional material content of a portion of space-time [Quine] |
9019 | Four-d objects helps predication of what no longer exists, and quantification over items from different times [Quine] |
9014 | Some conditionals can be explained just by negation and conjunction: not(p and not-q) [Quine] |
9009 | Single words are strongly synonymous if their interchange preserves truth [Quine] |
9453 | Sentences saying the same with the same rigid designators may still express different propositions [Bealer] |
9452 | Propositions might be reduced to functions (worlds to truth values), or ordered sets of properties and relations [Bealer] |
9451 | Modal logic and brain science have reaffirmed traditional belief in propositions [Bealer] |
9007 | It makes no sense to say that two sentences express the same proposition [Quine] |
9008 | There is no rule for separating the information from other features of sentences [Quine] |
9010 | We can abandon propositions, and just talk of sentences and equivalence [Quine] |
9021 | A good way of explaining an expression is saying what conditions make its contexts true [Quine] |