25 ideas
| 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) |
| 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) |
| 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. |
| 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) |
| 12149 | Indexicals are a problem for beliefs being just subject-proposition relations [Perry] |
| Full Idea: The essential indexical is a problem for the view that belief is a relation between subjects and propositions conceived as bearers of truth and falsity. | |
| From: John Perry (The Problem of the Essential Indexical [1979], 'Intro') | |
| A reaction: My immediate reaction would be that it depends on how you conceive of 'propositions'. If they are objective, you have a problem. I take them to be subjective events in brains, and the indexical meaning to be evident within the proposition. |
| 1556 | By nature people are close to one another, but culture drives them apart [Hippias] |
| Full Idea: I regard you all as relatives - by nature, not by convention. By nature like is akin to like, but convention is a tyrant over humankind and often constrains people to act contrary to nature. | |
| From: Hippias (fragments/reports [c.430 BCE]), quoted by Plato - Protagoras 337c8 |
| 12151 | If we replace 'I' in sentences about me, they are different beliefs and explanations of behaviour [Perry] |
| Full Idea: If I leave a trail of sugar, and realise 'that I am making a mess', ...when we replace the word 'I' with other designations of me, we no longer have an explanation of my behaviour, or an attribution of the same belief, so it is an 'essential indexical'. | |
| From: John Perry (The Problem of the Essential Indexical [1979], 'Intro') | |
| A reaction: [compressed] A famous observation of Perry's, which leads him to challenge traditional accounts of belief and of propositions. I don't think I see a problem, if we have a thoroughly non-linguistic account of essentially unambiguous propositions. |
| 18412 | Indexicals individuate certain belief states, helping in explanation and prediction [Perry] |
| Full Idea: We use sentences with indexicals or relativized propositions to individuate belief states, for the purposes of classifying believers in ways useful for explanation and prediction. | |
| From: John Perry (The Problem of the Essential Indexical [1979], 'Obvious') | |
| A reaction: He goes on to apparently connect this with some sort of moral integrity involved in 'owning up' to the fact that the person in question is you (who has spilled the sugar etc.). |
| 12150 | Indexicals reveal big problems with the traditional idea of a proposition [Perry] |
| Full Idea: The problem of the essential indexical reveals that something is badly wrong with the traditional doctrine of propositions. | |
| From: John Perry (The Problem of the Essential Indexical [1979], 'Prob') | |
| A reaction: See the reaction to 12149. The traditional view of propositions, or at least Russell's view, seems to be that they are same as facts, which strikes me as daft. I take propositions to be brain events, probably expressed in mentalese. |
| 15203 | Tense is essential for thought and action [Perry, by Le Poidevin] |
| Full Idea: Tense plays a crucial role in thought and action. | |
| From: report of John Perry (The Problem of the Essential Indexical [1979]) by Robin Le Poidevin - Past, Present and Future of Debate about Tense 3 a | |
| A reaction: This is important, because much of our metaphysics is dominated by a detached 'scientific' description of reality, which is given a rather passive character. If processes take centre stage, which they should, then our own processes are part of it. |
| 15204 | Actual tensed sentences cannot be tenseless, because they can cite their own context [Perry, by Le Poidevin] |
| Full Idea: In the new tenseless theory, no tensed token sentence can be equivalent to a tenseless token, because the former, unlike the latter, draws attention to the context in which it is tokened. | |
| From: report of John Perry (The Problem of the Essential Indexical [1979]) by Robin Le Poidevin - Past, Present and Future of Debate about Tense 3 a | |
| A reaction: So the problem about indexicals was worrying fans of the tenseless B-series view of time (and so it should). I'm inclined to translate sentences containing indexicals into their actual propositions, which tend to avoid them. 'Time/person of utterance'. |