Combining Philosophers

All the ideas for Alexander, Charles Chihara and Jos L. Zalabardo

expand these ideas     |    start again     |     specify just one area for these philosophers


41 ideas

4. Formal Logic / F. Set Theory ST / 1. Set Theory
Sets can be defined by 'enumeration', or by 'abstraction' (based on a property) [Zalabardo]
4. Formal Logic / F. Set Theory ST / 2. Mechanics of Set Theory / b. Terminology of ST
The 'Cartesian Product' of two sets relates them by pairing every element with every element [Zalabardo]
A 'partial ordering' is reflexive, antisymmetric and transitive [Zalabardo]
4. Formal Logic / F. Set Theory ST / 3. Types of Set / b. Empty (Null) Set
Realists about sets say there exists a null set in the real world, with no members [Chihara]
We only know relational facts about the empty set, but nothing intrinsic [Chihara]
In simple type theory there is a hierarchy of null sets [Chihara]
The null set is a structural position which has no other position in membership relation [Chihara]
4. Formal Logic / F. Set Theory ST / 3. Types of Set / c. Unit (Singleton) Sets
What is special about Bill Clinton's unit set, in comparison with all the others? [Chihara]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / a. Axioms for sets
Determinacy: an object is either in a set, or it isn't [Zalabardo]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / l. Axiom of Specification
Specification: Determinate totals of objects always make a set [Zalabardo]
4. Formal Logic / F. Set Theory ST / 5. Conceptions of Set / a. Sets as existing
The set theorist cannot tell us what 'membership' is [Chihara]
4. Formal Logic / F. Set Theory ST / 7. Natural Sets
ZFU refers to the physical world, when it talks of 'urelements' [Chihara]
4. Formal Logic / F. Set Theory ST / 8. Critique of Set Theory
Could we replace sets by the open sentences that define them? [Chihara, by Bostock]
A pack of wolves doesn't cease when one member dies [Chihara]
We could talk of open sentences, instead of sets [Chihara, by Shapiro]
5. Theory of Logic / A. Overview of Logic / 5. First-Order Logic
A first-order 'sentence' is a formula with no free variables [Zalabardo]
5. Theory of Logic / B. Logical Consequence / 4. Semantic Consequence |=
Γ |= φ for sentences if φ is true when all of Γ is true [Zalabardo]
Γ |= φ if φ is true when all of Γ is true, for all structures and interpretations [Zalabardo]
5. Theory of Logic / E. Structures of Logic / 2. Logical Connectives / b. Basic connectives
Propositional logic just needs ¬, and one of ∧, ∨ and → [Zalabardo]
5. Theory of Logic / E. Structures of Logic / 6. Relations in Logic
The mathematics of relations is entirely covered by ordered pairs [Chihara]
5. Theory of Logic / I. Semantics of Logic / 1. Semantics of Logic
The semantics shows how truth values depend on instantiations of properties and relations [Zalabardo]
We can do semantics by looking at given propositions, or by building new ones [Zalabardo]
5. Theory of Logic / I. Semantics of Logic / 2. Formal Truth
We make a truth assignment to T and F, which may be true and false, but merely differ from one another [Zalabardo]
5. Theory of Logic / I. Semantics of Logic / 3. Logical Truth
'Logically true' (|= φ) is true for every truth-assignment [Zalabardo]
Logically true sentences are true in all structures [Zalabardo]
5. Theory of Logic / I. Semantics of Logic / 4. Satisfaction
A sentence-set is 'satisfiable' if at least one truth-assignment makes them all true [Zalabardo]
Some formulas are 'satisfiable' if there is a structure and interpretation that makes them true [Zalabardo]
5. Theory of Logic / J. Model Theory in Logic / 1. Logical Models
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]
5. Theory of Logic / K. Features of Logics / 2. Consistency
Sentences are consistent if they can all be true; for Frege it is that no contradiction can be deduced [Chihara]
6. Mathematics / B. Foundations for Mathematics / 3. Axioms for Geometry
Analytic geometry gave space a mathematical structure, which could then have axioms [Chihara]
6. Mathematics / B. Foundations for Mathematics / 4. Axioms for Number / f. Mathematical induction
If a set is defined by induction, then proof by induction can be applied to it [Zalabardo]
6. Mathematics / B. Foundations for Mathematics / 7. Mathematical Structuralism / c. Nominalist structuralism
We can replace existence of sets with possibility of constructing token sentences [Chihara, by MacBride]
6. Mathematics / C. Sources of Mathematics / 6. Logicism / b. Type theory
Chihara's system is a variant of type theory, from which he can translate sentences [Chihara, by Shapiro]
We can replace type theory with open sentences and a constructibility quantifier [Chihara, by Shapiro]
6. Mathematics / C. Sources of Mathematics / 10. Constructivism / a. Constructivism
Introduce a constructibility quantifiers (Cx)Φ - 'it is possible to construct an x such that Φ' [Chihara, by Shapiro]
7. Existence / D. Theories of Reality / 11. Ontological Commitment / e. Ontological commitment problems
If a successful theory confirms mathematics, presumably a failed theory disconfirms it? [Chihara]
No scientific explanation would collapse if mathematical objects were shown not to exist [Chihara]
18. Thought / E. Abstraction / 7. Abstracta by Equivalence
I prefer the open sentences of a Constructibility Theory, to Platonist ideas of 'equivalence classes' [Chihara]
19. Language / B. Reference / 3. Direct Reference / b. Causal reference
Mathematical entities are causally inert, so the causal theory of reference won't work for them [Chihara]
26. Natural Theory / A. Speculations on Nature / 6. Early Matter Theories / g. Atomism
How can things without weight compose weight? [Alexander]
27. Natural Reality / B. Modern Physics / 4. Standard Model / a. Concept of matter
'Gunk' is an individual possessing no parts that are atoms [Chihara]