Combining Texts

All the ideas for 'Logical Consequence', 'Introduction to the Theory of Logic' and 'The Logical Syntax of Language'

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

28 ideas

4. Formal Logic / A. Syllogistic Logic / 2. Syllogistic Logic
10688 'Equivocation' is when terms do not mean the same thing in premises and conclusion [Beall/Restall]
4. Formal Logic / F. Set Theory ST / 1. Set Theory
10888 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
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]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / a. Axioms for sets
10886 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
10887 Specification: Determinate totals of objects always make a set [Zalabardo]
5. Theory of Logic / A. Overview of Logic / 4. Pure Logic
10690 Formal logic is invariant under permutations, or devoid of content, or gives the norms for thought [Beall/Restall]
5. Theory of Logic / A. Overview of Logic / 5. First-Order Logic
10897 A first-order 'sentence' is a formula with no free variables [Zalabardo]
5. Theory of Logic / B. Logical Consequence / 1. Logical Consequence
13342 Carnap defined consequence by contradiction, but this is unintuitive and changes with substitution [Tarski on Carnap]
5. Theory of Logic / B. Logical Consequence / 2. Types of Consequence
10691 Logical consequence needs either proofs, or absence of counterexamples [Beall/Restall]
5. Theory of Logic / B. Logical Consequence / 4. Semantic Consequence |=
10893 Γ |= φ for sentences if φ is true when all of Γ is true [Zalabardo]
10899 Γ |= φ if φ is true when all of Γ is true, for all structures and interpretations [Zalabardo]
10695 Logical consequence is either necessary truth preservation, or preservation based on interpretation [Beall/Restall]
5. Theory of Logic / B. Logical Consequence / 8. Material Implication
10689 A step is a 'material consequence' if we need contents as well as form [Beall/Restall]
5. Theory of Logic / C. Ontology of Logic / 4. Logic by Convention
13251 Each person is free to build their own logic, just by specifying a syntax [Carnap]
5. Theory of Logic / E. Structures of Logic / 2. Logical Connectives / b. Basic connectives
10896 Propositional logic just needs ¬, and one of ∧, ∨ and → [Zalabardo]
5. Theory of Logic / I. Semantics of Logic / 1. Semantics of Logic
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]
5. Theory of Logic / I. Semantics of Logic / 2. Formal Truth
10892 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
10895 'Logically true' (|= φ) is true for every truth-assignment [Zalabardo]
10696 A 'logical truth' (or 'tautology', or 'theorem') follows from empty premises [Beall/Restall]
10900 Logically true sentences are true in all structures [Zalabardo]
5. Theory of Logic / I. Semantics of Logic / 4. Satisfaction
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]
5. Theory of Logic / J. Model Theory in Logic / 1. Logical Models
10693 Models are mathematical structures which interpret the non-logical primitives [Beall/Restall]
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]
6. Mathematics / B. Foundations for Mathematics / 2. Proof in Mathematics
10692 Hilbert proofs have simple rules and complex axioms, and natural deduction is the opposite [Beall/Restall]
6. Mathematics / B. Foundations for Mathematics / 4. Axioms for Number / f. Mathematical induction
10891 If a set is defined by induction, then proof by induction can be applied to it [Zalabardo]