Combining Texts

All the ideas for 'The Science of Rights', 'How Things Persist' and 'Intermediate Logic'

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


112 ideas

1. Philosophy / D. Nature of Philosophy / 7. Despair over Philosophy
Philosophers are good at denying the obvious [Hawley]
4. Formal Logic / A. Syllogistic Logic / 2. Syllogistic Logic
Venn Diagrams map three predicates into eight compartments, then look for the conclusion [Bostock]
4. Formal Logic / B. Propositional Logic PL / 2. Tools of Propositional Logic / b. Terminology of PL
'Disjunctive Normal Form' is ensuring that no conjunction has a disjunction within its scope [Bostock]
'Conjunctive Normal Form' is ensuring that no disjunction has a conjunction within its scope [Bostock]
4. Formal Logic / B. Propositional Logic PL / 2. Tools of Propositional Logic / d. Basic theorems of PL
'Disjunction' says that Γ,φ∨ψ|= iff Γ,φ|= and Γ,ψ|= [Bostock]
'Assumptions' says that a formula entails itself (φ|=φ) [Bostock]
'Thinning' allows that if premisses entail a conclusion, then adding further premisses makes no difference [Bostock]
The 'conditional' is that Γ|=φ→ψ iff Γ,φ|=ψ [Bostock]
'Cutting' allows that if x is proved, and adding y then proves z, you can go straight to z [Bostock]
'Negation' says that Γ,¬φ|= iff Γ|=φ [Bostock]
'Conjunction' says that Γ|=φ∧ψ iff Γ|=φ and Γ|=ψ [Bostock]
4. Formal Logic / B. Propositional Logic PL / 2. Tools of Propositional Logic / e. Axioms of PL
A logic with ¬ and → needs three axiom-schemas and one rule as foundation [Bostock]
4. Formal Logic / E. Nonclassical Logics / 6. Free Logic
A 'free' logic can have empty names, and a 'universally free' logic can have empty domains [Bostock]
5. Theory of Logic / A. Overview of Logic / 6. Classical Logic
Truth is the basic notion in classical logic [Bostock]
Elementary logic cannot distinguish clearly between the finite and the infinite [Bostock]
Fictional characters wreck elementary logic, as they have contradictions and no excluded middle [Bostock]
5. Theory of Logic / B. Logical Consequence / 3. Deductive Consequence |-
The syntactic turnstile |- φ means 'there is a proof of φ' or 'φ is a theorem' [Bostock]
5. Theory of Logic / B. Logical Consequence / 4. Semantic Consequence |=
Validity is a conclusion following for premises, even if there is no proof [Bostock]
It seems more natural to express |= as 'therefore', rather than 'entails' [Bostock]
Γ|=φ is 'entails'; Γ|= is 'is inconsistent'; |=φ is 'valid' [Bostock]
5. Theory of Logic / B. Logical Consequence / 5. Modus Ponens
MPP: 'If Γ|=φ and Γ|=φ→ψ then Γ|=ψ' (omit Γs for Detachment) [Bostock]
MPP is a converse of Deduction: If Γ |- φ→ψ then Γ,φ|-ψ [Bostock]
5. Theory of Logic / D. Assumptions for Logic / 4. Identity in Logic
The sign '=' is a two-place predicate expressing that 'a is the same thing as b' (a=b) [Bostock]
|= α=α and α=β |= φ(α/ξ ↔ φ(β/ξ) fix identity [Bostock]
If we are to express that there at least two things, we need identity [Bostock]
5. Theory of Logic / E. Structures of Logic / 2. Logical Connectives / a. Logical connectives
Truth-functors are usually held to be defined by their truth-tables [Bostock]
5. Theory of Logic / E. Structures of Logic / 5. Functions in Logic
A 'zero-place' function just has a single value, so it is a name [Bostock]
A 'total' function ranges over the whole domain, a 'partial' function over appropriate inputs [Bostock]
5. Theory of Logic / F. Referring in Logic / 1. Naming / a. Names
In logic, a name is just any expression which refers to a particular single object [Bostock]
5. Theory of Logic / F. Referring in Logic / 1. Naming / b. Names as descriptive
Part of the sense of a proper name is a criterion of the thing's identity [Hawley]
5. Theory of Logic / F. Referring in Logic / 1. Naming / e. Empty names
An expression is only a name if it succeeds in referring to a real object [Bostock]
5. Theory of Logic / F. Referring in Logic / 2. Descriptions / b. Definite descriptions
Definite desciptions resemble names, but can't actually be names, if they don't always refer [Bostock]
Because of scope problems, definite descriptions are best treated as quantifiers [Bostock]
Definite descriptions are usually treated like names, and are just like them if they uniquely refer [Bostock]
We are only obliged to treat definite descriptions as non-names if only the former have scope [Bostock]
Definite descriptions don't always pick out one thing, as in denials of existence, or errors [Bostock]
5. Theory of Logic / F. Referring in Logic / 2. Descriptions / c. Theory of definite descriptions
Names do not have scope problems (e.g. in placing negation), but Russell's account does have that problem [Bostock]
5. Theory of Logic / G. Quantification / 1. Quantification
'Prenex normal form' is all quantifiers at the beginning, out of the scope of truth-functors [Bostock]
5. Theory of Logic / G. Quantification / 2. Domain of Quantification
If we allow empty domains, we must allow empty names [Bostock]
5. Theory of Logic / H. Proof Systems / 1. Proof Systems
An 'informal proof' is in no particular system, and uses obvious steps and some ordinary English [Bostock]
5. Theory of Logic / H. Proof Systems / 2. Axiomatic Proof
Quantification adds two axiom-schemas and a new rule [Bostock]
Axiom systems from Frege, Russell, Church, Lukasiewicz, Tarski, Nicod, Kleene, Quine... [Bostock]
5. Theory of Logic / H. Proof Systems / 3. Proof from Assumptions
'Conditonalised' inferences point to the Deduction Theorem: If Γ,φ|-ψ then Γ|-φ→ψ [Bostock]
Proof by Assumptions can always be reduced to Proof by Axioms, using the Deduction Theorem [Bostock]
The Deduction Theorem and Reductio can 'discharge' assumptions - they aren't needed for the new truth [Bostock]
The Deduction Theorem greatly simplifies the search for proof [Bostock]
5. Theory of Logic / H. Proof Systems / 4. Natural Deduction
Natural deduction takes proof from assumptions (with its rules) as basic, and axioms play no part [Bostock]
Excluded middle is an introduction rule for negation, and ex falso quodlibet will eliminate it [Bostock]
In natural deduction we work from the premisses and the conclusion, hoping to meet in the middle [Bostock]
Natural deduction rules for → are the Deduction Theorem (→I) and Modus Ponens (→E) [Bostock]
5. Theory of Logic / H. Proof Systems / 5. Tableau Proof
Unlike natural deduction, semantic tableaux have recipes for proving things [Bostock]
A tree proof becomes too broad if its only rule is Modus Ponens [Bostock]
Tableau rules are all elimination rules, gradually shortening formulae [Bostock]
Tableau proofs use reduction - seeking an impossible consequence from an assumption [Bostock]
A completed open branch gives an interpretation which verifies those formulae [Bostock]
Non-branching rules add lines, and branching rules need a split; a branch with a contradiction is 'closed' [Bostock]
In a tableau proof no sequence is established until the final branch is closed; hypotheses are explored [Bostock]
5. Theory of Logic / H. Proof Systems / 6. Sequent Calculi
Each line of a sequent calculus is a conclusion of previous lines, each one explicitly recorded [Bostock]
A sequent calculus is good for comparing proof systems [Bostock]
5. Theory of Logic / I. Semantics of Logic / 1. Semantics of Logic
Interpretation by assigning objects to names, or assigning them to variables first [Bostock, by PG]
5. Theory of Logic / I. Semantics of Logic / 5. Extensionalism
Extensionality is built into ordinary logic semantics; names have objects, predicates have sets of objects [Bostock]
If an object has two names, truth is undisturbed if the names are swapped; this is Extensionality [Bostock]
5. Theory of Logic / K. Features of Logics / 2. Consistency
For 'negation-consistent', there is never |-(S)φ and |-(S)¬φ [Bostock]
A proof-system is 'absolutely consistent' iff we don't have |-(S)φ for every formula [Bostock]
A set of formulae is 'inconsistent' when there is no interpretation which can make them all true [Bostock]
5. Theory of Logic / K. Features of Logics / 6. Compactness
Inconsistency or entailment just from functors and quantifiers is finitely based, if compact [Bostock]
Compactness means an infinity of sequents on the left will add nothing new [Bostock]
6. Mathematics / B. Foundations for Mathematics / 4. Axioms for Number / f. Mathematical induction
Ordinary or mathematical induction assumes for the first, then always for the next, and hence for all [Bostock]
Complete induction assumes for all numbers less than n, then also for n, and hence for all numbers [Bostock]
7. Existence / C. Structure of Existence / 5. Supervenience / d. Humean supervenience
A homogeneous rotating disc should be undetectable according to Humean supervenience [Hawley]
7. Existence / D. Theories of Reality / 10. Vagueness / b. Vagueness of reality
Non-linguistic things cannot be indeterminate, because they don't have truth-values at all [Hawley]
Maybe for the world to be vague, it must be vague in its foundations? [Hawley]
7. Existence / D. Theories of Reality / 10. Vagueness / c. Vagueness as ignorance
Epistemic vagueness seems right in the case of persons [Hawley]
7. Existence / D. Theories of Reality / 10. Vagueness / f. Supervaluation for vagueness
Supervaluation refers to one vaguely specified thing, through satisfaction by everything in some range [Hawley]
Supervaluationism takes what the truth-value would have been if indecision was resolved [Hawley]
8. Modes of Existence / A. Relations / 4. Formal Relations / a. Types of relation
Relations can be one-many (at most one on the left) or many-one (at most one on the right) [Bostock]
A relation is not reflexive, just because it is transitive and symmetrical [Bostock]
8. Modes of Existence / B. Properties / 1. Nature of Properties
Maybe the only properties are basic ones like charge, mass and spin [Hawley]
9. Objects / A. Existence of Objects / 1. Physical Objects
An object is 'natural' if its stages are linked by certain non-supervenient relations [Hawley]
9. Objects / B. Unity of Objects / 3. Unity Problems / b. Cat and its tail
Are sortals spatially maximal - so no cat part is allowed to be a cat? [Hawley]
9. Objects / B. Unity of Objects / 3. Unity Problems / c. Statue and clay
The modal features of statue and lump are disputed; when does it stop being that statue? [Hawley]
Perdurantists can adopt counterpart theory, to explain modal differences of identical part-sums [Hawley]
9. Objects / B. Unity of Objects / 3. Unity Problems / e. Vague objects
Vagueness is either in our knowledge, in our talk, or in reality [Hawley]
Indeterminacy in objects and in properties are not distinct cases [Hawley]
9. Objects / C. Structure of Objects / 6. Constitution of an Object
The constitution theory is endurantism plus more than one object in a place [Hawley]
Constitution theory needs sortal properties like 'being a sweater' to distinguish it from its thread [Hawley]
If the constitution view says thread and sweater are two things, why do we talk of one thing? [Hawley]
9. Objects / E. Objects over Time / 2. Objects that Change
'Adverbialism' explains change by saying an object has-at-some-time a given property [Hawley]
Presentism solves the change problem: the green banana ceases, so can't 'relate' to the yellow one [Hawley]
The problem of change arises if there must be 'identity' of a thing over time [Hawley]
9. Objects / E. Objects over Time / 3. Three-Dimensionalism
Endurance theory can relate properties to times, or timed instantiations to properties [Hawley]
Endurance is a sophisticated theory, covering properties, instantiation and time [Hawley]
9. Objects / E. Objects over Time / 4. Four-Dimensionalism
How does perdurance theory explain our concern for our own future selves? [Hawley]
Perdurance needs an atemporal perspective, to say that the object 'has' different temporal parts [Hawley]
If an object is the sum of all of its temporal parts, its mass is staggeringly large! [Hawley]
Perdurance says things are sums of stages; Stage Theory says each stage is the thing [Hawley]
If a life is essentially the sum of its temporal parts, it couldn't be shorter or longer than it was? [Hawley]
9. Objects / E. Objects over Time / 5. Temporal Parts
Stage Theory seems to miss out the link between stages of the same object [Hawley]
Stage Theory says every stage is a distinct object, which gives too many objects [Hawley]
An isolated stage can't be a banana (which involves suitable relations to other stages) [Hawley]
Stages of one thing are related by extrinsic counterfactual and causal relations [Hawley]
Stages must be as fine-grained in length as change itself, so any change is a new stage [Hawley]
The stages of Stage Theory seem too thin to populate the world, or to be referred to [Hawley]
9. Objects / F. Identity among Objects / 5. Self-Identity
If non-existent things are self-identical, they are just one thing - so call it the 'null object' [Bostock]
9. Objects / F. Identity among Objects / 8. Leibniz's Law
If two things might be identical, there can't be something true of one and false of the other [Hawley]
10. Modality / A. Necessity / 6. Logical Necessity
The idea that anything which can be proved is necessary has a problem with empty names [Bostock]
10. Modality / E. Possible worlds / 3. Transworld Objects / c. Counterparts
To decide whether something is a counterpart, we need to specify a relevant sortal concept [Hawley]
16. Persons / D. Continuity of the Self / 5. Concerns of the Self
On any theory of self, it is hard to explain why we should care about our future selves [Hawley]
16. Persons / D. Continuity of the Self / 6. Body sustains Self
Effective individuals must posit a specific material body for themselves [Fichte]
19. Language / C. Assigning Meanings / 3. Predicates
A (modern) predicate is the result of leaving a gap for the name in a sentence [Bostock]
26. Natural Theory / C. Causation / 9. General Causation / c. Counterfactual causation
Causation is nothing more than the counterfactuals it grounds? [Hawley]
27. Natural Reality / D. Time / 3. Parts of Time / b. Instants
Time could be discrete (like integers) or dense (rationals) or continuous (reals) [Hawley]