Combining Philosophers

All the ideas for John Austin, Edwin D. Mares and Herbert B. Enderton

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


66 ideas

1. Philosophy / E. Nature of Metaphysics / 7. Against Metaphysics
After 1903, Husserl avoids metaphysical commitments [Mares]
2. Reason / A. Nature of Reason / 9. Limits of Reason
Inconsistency doesn't prevent us reasoning about some system [Mares]
4. Formal Logic / B. Propositional Logic PL / 3. Truth Tables
Until the 1960s the only semantics was truth-tables [Enderton]
4. Formal Logic / E. Nonclassical Logics / 2. Intuitionist Logic
Intuitionist logic looks best as natural deduction [Mares]
Intuitionism as natural deduction has no rule for negation [Mares]
4. Formal Logic / E. Nonclassical Logics / 3. Many-Valued Logic
Three-valued logic is useful for a theory of presupposition [Mares]
4. Formal Logic / F. Set Theory ST / 2. Mechanics of Set Theory / a. Symbols of ST
'F(x)' is the unique value which F assumes for a value of x [Enderton]
'fld R' indicates the 'field' of all objects in the relation [Enderton]
'ran R' indicates the 'range' of objects being related to [Enderton]
'dom R' indicates the 'domain' of objects having a relation [Enderton]
We write F:A→B to indicate that A maps into B (the output of F on A is in B) [Enderton]
4. Formal Logic / F. Set Theory ST / 2. Mechanics of Set Theory / b. Terminology of ST
∈ says the whole set is in the other; ⊆ says the members of the subset are in the other [Enderton]
A 'linear or total ordering' must be transitive and satisfy trichotomy [Enderton]
The 'ordered pair' <x,y> is defined to be {{x}, {x,y}} [Enderton]
The 'powerset' of a set is all the subsets of a given set [Enderton]
Two sets are 'disjoint' iff their intersection is empty [Enderton]
A relation is 'symmetric' on a set if every ordered pair has the relation in both directions [Enderton]
A relation is 'transitive' if it can be carried over from two ordered pairs to a third [Enderton]
A 'relation' is a set of ordered pairs [Enderton]
A 'domain' of a relation is the set of members of ordered pairs in the relation [Enderton]
A function 'maps A into B' if the relating things are set A, and the things related to are all in B [Enderton]
A function 'maps A onto B' if the relating things are set A, and the things related to are set B [Enderton]
A relation is 'reflexive' on a set if every member bears the relation to itself [Enderton]
A 'function' is a relation in which each object is related to just one other object [Enderton]
A relation satisfies 'trichotomy' if all pairs are either relations, or contain identical objects [Enderton]
A set is 'dominated' by another if a one-to-one function maps the first set into a subset of the second [Enderton]
4. Formal Logic / F. Set Theory ST / 3. Types of Set / b. Empty (Null) Set
Note that {Φ} =/= Φ, because Φ ∈ {Φ} but Φ ∉ Φ [Enderton]
The empty set may look pointless, but many sets can be constructed from it [Enderton]
4. Formal Logic / F. Set Theory ST / 3. Types of Set / c. Unit (Singleton) Sets
The singleton is defined using the pairing axiom (as {x,x}) [Enderton]
4. Formal Logic / F. Set Theory ST / 3. Types of Set / e. Equivalence classes
We 'partition' a set into distinct subsets, according to each relation on its objects [Enderton]
An 'equivalence relation' is a reflexive, symmetric and transitive binary relation [Enderton]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / h. Axiom of Replacement VII
Fraenkel added Replacement, to give a theory of ordinal numbers [Enderton]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / j. Axiom of Choice IX
We can only define functions if Choice tells us which items are involved [Enderton]
5. Theory of Logic / A. Overview of Logic / 1. Overview of Logic
Inference not from content, but from the fact that it was said, is 'conversational implicature' [Enderton]
5. Theory of Logic / A. Overview of Logic / 6. Classical Logic
Material implication (and classical logic) considers nothing but truth values for implications [Mares]
In classical logic the connectives can be related elegantly, as in De Morgan's laws [Mares]
5. Theory of Logic / B. Logical Consequence / 2. Types of Consequence
Validity is either semantic (what preserves truth), or proof-theoretic (following procedures) [Enderton]
5. Theory of Logic / D. Assumptions for Logic / 1. Bivalence
Standard disjunction and negation force us to accept the principle of bivalence [Mares]
Excluded middle standardly implies bivalence; attacks use non-contradiction, De M 3, or double negation [Mares]
5. Theory of Logic / E. Structures of Logic / 2. Logical Connectives / a. Logical connectives
The connectives are studied either through model theory or through proof theory [Mares]
5. Theory of Logic / H. Proof Systems / 4. Natural Deduction
Many-valued logics lack a natural deduction system [Mares]
5. Theory of Logic / I. Semantics of Logic / 1. Semantics of Logic
Situation semantics for logics: not possible worlds, but information in situations [Mares]
5. Theory of Logic / I. Semantics of Logic / 3. Logical Truth
A logical truth or tautology is a logical consequence of the empty set [Enderton]
5. Theory of Logic / I. Semantics of Logic / 4. Satisfaction
A truth assignment to the components of a wff 'satisfy' it if the wff is then True [Enderton]
5. Theory of Logic / K. Features of Logics / 2. Consistency
Consistency is semantic, but non-contradiction is syntactic [Mares]
5. Theory of Logic / K. Features of Logics / 3. Soundness
A proof theory is 'sound' if its valid inferences entail semantic validity [Enderton]
5. Theory of Logic / K. Features of Logics / 4. Completeness
A proof theory is 'complete' if semantically valid inferences entail proof-theoretic validity [Enderton]
5. Theory of Logic / K. Features of Logics / 6. Compactness
Proof in finite subsets is sufficient for proof in an infinite set [Enderton]
5. Theory of Logic / K. Features of Logics / 7. Decidability
Expressions are 'decidable' if inclusion in them (or not) can be proved [Enderton]
5. Theory of Logic / K. Features of Logics / 8. Enumerability
For a reasonable language, the set of valid wff's can always be enumerated [Enderton]
6. Mathematics / B. Foundations for Mathematics / 4. Axioms for Number / a. Axioms for numbers
The truth of the axioms doesn't matter for pure mathematics, but it does for applied [Mares]
6. Mathematics / C. Sources of Mathematics / 4. Mathematical Empiricism / a. Mathematical empiricism
Mathematics is relations between properties we abstract from experience [Mares]
6. Mathematics / C. Sources of Mathematics / 10. Constructivism / b. Intuitionism
For intuitionists there are not numbers and sets, but processes of counting and collecting [Mares]
10. Modality / B. Possibility / 8. Conditionals / f. Pragmatics of conditionals
Sentences with 'if' are only conditionals if they can read as A-implies-B [Enderton]
10. Modality / D. Knowledge of Modality / 2. A Priori Contingent
Light in straight lines is contingent a priori; stipulated as straight, because they happen to be so [Mares]
12. Knowledge Sources / A. A Priori Knowledge / 6. A Priori from Reason
Aristotelians dislike the idea of a priori judgements from pure reason [Mares]
12. Knowledge Sources / C. Rationalism / 1. Rationalism
Empiricists say rationalists mistake imaginative powers for modal insights [Mares]
13. Knowledge Criteria / B. Internal Justification / 5. Coherentism / a. Coherence as justification
The most popular view is that coherent beliefs explain one another [Mares]
14. Science / B. Scientific Theories / 3. Instrumentalism
Operationalism defines concepts by our ways of measuring them [Mares]
18. Thought / D. Concepts / 2. Origin of Concepts / b. Empirical concepts
Aristotelian justification uses concepts abstracted from experience [Mares]
18. Thought / D. Concepts / 4. Structure of Concepts / c. Classical concepts
The essence of a concept is either its definition or its conceptual relations? [Mares]
19. Language / C. Assigning Meanings / 2. Semantics
In 'situation semantics' our main concepts are abstracted from situations [Mares]
19. Language / C. Assigning Meanings / 8. Possible Worlds Semantics
Possible worlds semantics has a nice compositional account of modal statements [Mares]
19. Language / D. Propositions / 3. Concrete Propositions
Unstructured propositions are sets of possible worlds; structured ones have components [Mares]
25. Social Practice / D. Justice / 2. The Law / d. Legal positivism
The existence of law is one thing, its merits and demerits another [Austin,J]
27. Natural Reality / C. Space / 3. Points in Space
Maybe space has points, but processes always need regions with a size [Mares]