25 ideas
| 23367 | Even pointing a finger should only be done for a reason [Epictetus] |
| Full Idea: Philosophy says it is not right even to stretch out a finger without some reason. | |
| From: Epictetus (fragments/reports [c.57], 15) | |
| A reaction: The key point here is that philosophy concerns action, an idea on which Epictetus is very keen. He rather despise theory. This idea perfectly sums up the concept of the wholly rational life (which no rational person would actually want to live!). |
| 10888 | Sets can be defined by 'enumeration', or by 'abstraction' (based on a property) [Zalabardo] |
| Full Idea: We can define a set by 'enumeration' (by listing the items, within curly brackets), or by 'abstraction' (by specifying the elements as instances of a property), pretending that they form a determinate totality. The latter is written {x | x is P}. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §1.3) |
| 10889 | The 'Cartesian Product' of two sets relates them by pairing every element with every element [Zalabardo] |
|
Full Idea:
The 'Cartesian Product' of two sets, written A x B, is the relation which pairs every element of A with every element of B. So A x B = { |
|
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §1.6) |
| 10890 | A 'partial ordering' is reflexive, antisymmetric and transitive [Zalabardo] |
| Full Idea: A binary relation in a set is a 'partial ordering' just in case it is reflexive, antisymmetric and transitive. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §1.6) |
| 10886 | Determinacy: an object is either in a set, or it isn't [Zalabardo] |
| Full Idea: Principle of Determinacy: For every object a and every set S, either a is an element of S or a is not an element of S. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §1.2) |
| 10887 | Specification: Determinate totals of objects always make a set [Zalabardo] |
| Full Idea: Principle of Specification: Whenever we can specify a determinate totality of objects, we shall say that there is a set whose elements are precisely the objects that we have specified. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §1.3) | |
| A reaction: Compare the Axiom of Specification. Zalabardo says we may wish to consider sets of which we cannot specify the members. |
| 10897 | A first-order 'sentence' is a formula with no free variables [Zalabardo] |
| Full Idea: A formula of a first-order language is a 'sentence' just in case it has no free variables. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §3.2) |
| 10893 | Γ |= φ for sentences if φ is true when all of Γ is true [Zalabardo] |
| Full Idea: A propositional logic sentence is a 'logical consequence' of a set of sentences (written Γ |= φ) if for every admissible truth-assignment all the sentences in the set Γ are true, then φ is true. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §2.4) | |
| A reaction: The definition is similar for predicate logic. |
| 10899 | Γ |= φ if φ is true when all of Γ is true, for all structures and interpretations [Zalabardo] |
| Full Idea: A formula is the 'logical consequence' of a set of formulas (Γ |= φ) if for every structure in the language and every variable interpretation of the structure, if all the formulas within the set are true and the formula itself is true. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §3.5) |
| 10896 | Propositional logic just needs ¬, and one of ∧, ∨ and → [Zalabardo] |
| Full Idea: In propositional logic, any set containing ¬ and at least one of ∧, ∨ and → is expressively complete. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §2.8) |
| 10898 | The semantics shows how truth values depend on instantiations of properties and relations [Zalabardo] |
| Full Idea: The semantic pattern of a first-order language is the ways in which truth values depend on which individuals instantiate the properties and relations which figure in them. ..So we pair a truth value with each combination of individuals, sets etc. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §3.3) | |
| A reaction: So truth reduces to a combination of 'instantiations', which is rather like 'satisfaction'. |
| 10902 | We can do semantics by looking at given propositions, or by building new ones [Zalabardo] |
| Full Idea: We can look at semantics from the point of view of how truth values are determined by instantiations of properties and relations, or by asking how we can build, using the resources of the language, a proposition corresponding to a given semantic pattern. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §3.6) | |
| A reaction: The second version of semantics is model theory. |
| 10892 | We make a truth assignment to T and F, which may be true and false, but merely differ from one another [Zalabardo] |
| Full Idea: A truth assignment is a function from propositions to the set {T,F}. We will think of T and F as the truth values true and false, but for our purposes all we need to assume about the identity of these objects is that they are different from each other. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §2.4) | |
| A reaction: Note that T and F are 'objects'. This remark is important in understanding modern logical semantics. T and F can be equated to 1 and 0 in the language of a computer. They just mean as much as you want them to mean. |
| 10900 | Logically true sentences are true in all structures [Zalabardo] |
| Full Idea: In first-order languages, logically true sentences are true in all structures. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §3.5) |
| 10895 | 'Logically true' (|= φ) is true for every truth-assignment [Zalabardo] |
| Full Idea: A propositional logic sentence is 'logically true', written |= φ, if it is true for every admissible truth-assignment. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §2.4) |
| 10901 | Some formulas are 'satisfiable' if there is a structure and interpretation that makes them true [Zalabardo] |
| Full Idea: A set of formulas of a first-order language is 'satisfiable' if there is a structure and a variable interpretation in that structure such that all the formulas of the set are true. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §3.5) |
| 10894 | A sentence-set is 'satisfiable' if at least one truth-assignment makes them all true [Zalabardo] |
| Full Idea: A propositional logic set of sentences Γ is 'satisfiable' if there is at least one admissible truth-assignment that makes all of its sentences true. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §2.4) |
| 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] |
| Full Idea: A structure is a model of a sentence if the sentence is true in the model; a structure is a model of a set of sentences if they are all true in the structure. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §3.6) |
| 10891 | If a set is defined by induction, then proof by induction can be applied to it [Zalabardo] |
| Full Idea: Defining a set by induction enables us to use the method of proof by induction to establish that all the elements of the set have a certain property. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §2.3) |
| 20475 | Maybe modal sentences cannot be true or false [Casullo] |
| Full Idea: Some people claim that modal sentences do not express truths or falsehoods. | |
| From: Albert Casullo (A Priori Knowledge [2002], 3.2) | |
| A reaction: I can only imagine this coming from a narrow hardline empiricist. It seems to me obvious that we make true or false statements about what is possible or impossible. |
| 20476 | If the necessary is a priori, so is the contingent, because the same evidence is involved [Casullo] |
| Full Idea: If one can only know a priori that a proposition is necessary, then one can know only a priori that a proposition is contingent. The evidence relevant to determining the latter is the same as that relevant to determining the former. | |
| From: Albert Casullo (A Priori Knowledge [2002], 3.2) | |
| A reaction: This seems a telling point, but I suppose it is obvious. If you see that the cat is on the mat, nothing in the situation tells you whether this is contingent or necessary. We assume it is contingent, but that may be an a priori assumption. |
| 20471 | Epistemic a priori conditions concern either the source, defeasibility or strength [Casullo] |
| Full Idea: There are three suggested epistemic conditions on a priori knowledge: the first regards the source of justification, the second regards the defeasibility of justification, and the third appeals to the strength of justification. | |
| From: Albert Casullo (A Priori Knowledge [2002], 2) | |
| A reaction: [compressed] He says these are all inspired by Kant. The non-epistemic suggested condition involve necessity or analyticity. The source would have to be entirely mental; the defeasibly could not be experiential; the strength would be certainty. |
| 20477 | The main claim of defenders of the a priori is that some justifications are non-experiential [Casullo] |
| Full Idea: The leading claim of proponents of the a priori is that sources of justification are of two significantly different types: experiential and nonexperiential. Initially this difference is marked at the phenomenological level. | |
| From: Albert Casullo (A Priori Knowledge [2002], 5) | |
| A reaction: He cites Plantinga and Bealer for the phenomenological starting point (that some knowledge just seems rationally obvious, certain, and perhaps necessary). |
| 20472 | Analysis of the a priori by necessity or analyticity addresses the proposition, not the justification [Casullo] |
| Full Idea: There is reason to view non-epistemic analyses of a priori knowledge (in terms of necessity or analyticity) with suspicion. The a priori concerns justification. Analysis by necessity or analyticity concerns the proposition rather than the justification. | |
| From: Albert Casullo (A Priori Knowledge [2002], 2.1) | |
| A reaction: [compressed] The fact that the a priori is entirely a mode of justification, rather than a type of truth, is the modern view, influenced by Kripke. Given that assumption, this is a good objection. |
| 20474 | 'Overriding' defeaters rule it out, and 'undermining' defeaters weaken in [Casullo] |
| Full Idea: A justified belief that a proposition is not true is an 'overriding' defeater, ...and the belief that a justification is inadequate or defective is an 'undermining' defeater. | |
| From: Albert Casullo (A Priori Knowledge [2002], n 40) | |
| A reaction: Sounds more like a sliding scale than a binary option. Quite useful, though. |