117 ideas
| 5196 | Philosophy is a department of logic [Ayer] |
| 5189 | Philosophers should abandon speculation, as philosophy is wholly critical [Ayer] |
| 7919 | Humeans rejected the a priori synthetic, and so rejected even Kantian metaphysics [Ayer, by Macdonald,C] |
| 5195 | Critics say analysis can only show the parts, and not their distinctive configuration [Ayer] |
| 5179 | Philosophy deals with the questions that scientists do not wish to handle [Ayer] |
| 4749 | We cannot analyse the concept of 'truth', because it is simply a mark that a sentence is asserted [Ayer] |
| 13439 | Venn Diagrams map three predicates into eight compartments, then look for the conclusion [Bostock] |
| 13421 | 'Disjunctive Normal Form' is ensuring that no conjunction has a disjunction within its scope [Bostock] |
| 13422 | 'Conjunctive Normal Form' is ensuring that no disjunction has a conjunction within its scope [Bostock] |
| 13355 | 'Disjunction' says that Γ,φ∨ψ|= iff Γ,φ|= and Γ,ψ|= [Bostock] |
| 13350 | 'Assumptions' says that a formula entails itself (φ|=φ) [Bostock] |
| 13351 | 'Thinning' allows that if premisses entail a conclusion, then adding further premisses makes no difference [Bostock] |
| 13356 | The 'conditional' is that Γ|=φ→ψ iff Γ,φ|=ψ [Bostock] |
| 13352 | 'Cutting' allows that if x is proved, and adding y then proves z, you can go straight to z [Bostock] |
| 13353 | 'Negation' says that Γ,¬φ|= iff Γ|=φ [Bostock] |
| 13354 | 'Conjunction' says that Γ|=φ∧ψ iff Γ|=φ and Γ|=ψ [Bostock] |
| 13610 | A logic with ¬ and → needs three axiom-schemas and one rule as foundation [Bostock] |
| 13846 | A 'free' logic can have empty names, and a 'universally free' logic can have empty domains [Bostock] |
| 11211 | If a sound conclusion comes from two errors that cancel out, the path of the argument must matter [Rumfitt] |
| 13346 | Truth is the basic notion in classical logic [Bostock] |
| 13545 | Elementary logic cannot distinguish clearly between the finite and the infinite [Bostock] |
| 13822 | Fictional characters wreck elementary logic, as they have contradictions and no excluded middle [Bostock] |
| 13623 | The syntactic turnstile |- φ means 'there is a proof of φ' or 'φ is a theorem' [Bostock] |
| 13347 | Validity is a conclusion following for premises, even if there is no proof [Bostock] |
| 13348 | It seems more natural to express |= as 'therefore', rather than 'entails' [Bostock] |
| 13349 | Γ|=φ is 'entails'; Γ|= is 'is inconsistent'; |=φ is 'valid' [Bostock] |
| 13614 | MPP: 'If Γ|=φ and Γ|=φ→ψ then Γ|=ψ' (omit Γs for Detachment) [Bostock] |
| 13617 | MPP is a converse of Deduction: If Γ |- φ→ψ then Γ,φ|-ψ [Bostock] |
| 13799 | The sign '=' is a two-place predicate expressing that 'a is the same thing as b' (a=b) [Bostock] |
| 13800 | |= α=α and α=β |= φ(α/ξ ↔ φ(β/ξ) fix identity [Bostock] |
| 13803 | If we are to express that there at least two things, we need identity [Bostock] |
| 13357 | Truth-functors are usually held to be defined by their truth-tables [Bostock] |
| 11212 | The sense of a connective comes from primitively obvious rules of inference [Rumfitt] |
| 11210 | Standardly 'and' and 'but' are held to have the same sense by having the same truth table [Rumfitt] |
| 13812 | A 'zero-place' function just has a single value, so it is a name [Bostock] |
| 13811 | A 'total' function ranges over the whole domain, a 'partial' function over appropriate inputs [Bostock] |
| 13360 | In logic, a name is just any expression which refers to a particular single object [Bostock] |
| 13361 | An expression is only a name if it succeeds in referring to a real object [Bostock] |
| 13814 | Definite desciptions resemble names, but can't actually be names, if they don't always refer [Bostock] |
| 13816 | Because of scope problems, definite descriptions are best treated as quantifiers [Bostock] |
| 13817 | Definite descriptions are usually treated like names, and are just like them if they uniquely refer [Bostock] |
| 13848 | We are only obliged to treat definite descriptions as non-names if only the former have scope [Bostock] |
| 13813 | Definite descriptions don't always pick out one thing, as in denials of existence, or errors [Bostock] |
| 13815 | Names do not have scope problems (e.g. in placing negation), but Russell's account does have that problem [Bostock] |
| 13438 | 'Prenex normal form' is all quantifiers at the beginning, out of the scope of truth-functors [Bostock] |
| 13818 | If we allow empty domains, we must allow empty names [Bostock] |
| 13801 | An 'informal proof' is in no particular system, and uses obvious steps and some ordinary English [Bostock] |
| 13619 | Quantification adds two axiom-schemas and a new rule [Bostock] |
| 13622 | Axiom systems from Frege, Russell, Church, Lukasiewicz, Tarski, Nicod, Kleene, Quine... [Bostock] |
| 13615 | 'Conditonalised' inferences point to the Deduction Theorem: If Γ,φ|-ψ then Γ|-φ→ψ [Bostock] |
| 13616 | The Deduction Theorem greatly simplifies the search for proof [Bostock] |
| 13620 | Proof by Assumptions can always be reduced to Proof by Axioms, using the Deduction Theorem [Bostock] |
| 13621 | The Deduction Theorem and Reductio can 'discharge' assumptions - they aren't needed for the new truth [Bostock] |
| 13753 | Natural deduction takes proof from assumptions (with its rules) as basic, and axioms play no part [Bostock] |
| 13755 | Excluded middle is an introduction rule for negation, and ex falso quodlibet will eliminate it [Bostock] |
| 13758 | In natural deduction we work from the premisses and the conclusion, hoping to meet in the middle [Bostock] |
| 13754 | Natural deduction rules for → are the Deduction Theorem (→I) and Modus Ponens (→E) [Bostock] |
| 13757 | Unlike natural deduction, semantic tableaux have recipes for proving things [Bostock] |
| 13611 | Tableau proofs use reduction - seeking an impossible consequence from an assumption [Bostock] |
| 13613 | A completed open branch gives an interpretation which verifies those formulae [Bostock] |
| 13612 | Non-branching rules add lines, and branching rules need a split; a branch with a contradiction is 'closed' [Bostock] |
| 13761 | In a tableau proof no sequence is established until the final branch is closed; hypotheses are explored [Bostock] |
| 13756 | A tree proof becomes too broad if its only rule is Modus Ponens [Bostock] |
| 13762 | Tableau rules are all elimination rules, gradually shortening formulae [Bostock] |
| 13759 | Each line of a sequent calculus is a conclusion of previous lines, each one explicitly recorded [Bostock] |
| 13760 | A sequent calculus is good for comparing proof systems [Bostock] |
| 13364 | Interpretation by assigning objects to names, or assigning them to variables first [Bostock, by PG] |
| 13821 | Extensionality is built into ordinary logic semantics; names have objects, predicates have sets of objects [Bostock] |
| 13362 | If an object has two names, truth is undisturbed if the names are swapped; this is Extensionality [Bostock] |
| 13541 | For 'negation-consistent', there is never |-(S)φ and |-(S)¬φ [Bostock] |
| 13542 | A proof-system is 'absolutely consistent' iff we don't have |-(S)φ for every formula [Bostock] |
| 13540 | A set of formulae is 'inconsistent' when there is no interpretation which can make them all true [Bostock] |
| 13544 | Inconsistency or entailment just from functors and quantifiers is finitely based, if compact [Bostock] |
| 13618 | Compactness means an infinity of sequents on the left will add nothing new [Bostock] |
| 13358 | Ordinary or mathematical induction assumes for the first, then always for the next, and hence for all [Bostock] |
| 13359 | Complete induction assumes for all numbers less than n, then also for n, and hence for all numbers [Bostock] |
| 5202 | Maths and logic are true universally because they are analytic or tautological [Ayer] |
| 6523 | Positivists regard ontology as either meaningless or stipulated [Ayer, by Robinson,H] |
| 13802 | Relations can be one-many (at most one on the left) or many-one (at most one on the right) [Bostock] |
| 13543 | A relation is not reflexive, just because it is transitive and symmetrical [Bostock] |
| 13847 | If non-existent things are self-identical, they are just one thing - so call it the 'null object' [Bostock] |
| 13820 | The idea that anything which can be proved is necessary has a problem with empty names [Bostock] |
| 5183 | Only tautologies can be certain; other propositions can only be probable [Ayer] |
| 6525 | Logical positivists could never give the sense-data equivalent of 'there is a table next door' [Robinson,H on Ayer] |
| 5170 | Material things are constructions from actual and possible occurrences of sense-contents [Ayer] |
| 5198 | We could verify 'a thing can't be in two places at once' by destroying one of the things [Ierubino on Ayer] |
| 2619 | Whether geometry can be applied to reality is an empirical question outside of geometry [Ayer] |
| 5197 | By changing definitions we could make 'a thing can't be in two places at once' a contradiction [Ayer] |
| 5204 | To say that a proposition is true a priori is to say that it is a tautology [Ayer] |
| 6524 | Positivists prefer sense-data to objects, because the vocabulary covers both illusions and perceptions [Ayer, by Robinson,H] |
| 5193 | Causal and representative theories of perception are wrong as they refer to unobservables [Ayer] |
| 5200 | The main claim of rationalism is that thought is an independent source of knowledge [Ayer] |
| 4729 | Empiricism lacked a decent account of the a priori, until Ayer said it was entirely analytic [O'Grady on Ayer] |
| 5180 | All propositions (especially 'metaphysics') must begin with the senses [Ayer] |
| 5169 | My empiricism logically distinguishes analytic and synthetic propositions, and metaphysical verbiage [Ayer] |
| 5185 | It is further sense-experience which informs us of the mistakes that arise out of sense-experience [Ayer] |
| 5199 | Empiricism, it is said, cannot account for our knowledge of necessary truths [Ayer] |
| 5190 | The induction problem is to prove generalisations about the future based on the past [Ayer] |
| 5191 | We can't use the uniformity of nature to prove induction, as that would be circular [Ayer] |
| 5177 | Other minds are 'metaphysical' objects, because I can never observe their experiences [Ayer] |
| 5178 | A conscious object is by definition one that behaves in a certain way, so behaviour proves consciousness [Ayer] |
| 5172 | If the self is meaningful, it must be constructed from sense-experiences [Ayer] |
| 5173 | Two experiences belong to one self if their contents belong with one body [Ayer] |
| 5176 | Empiricists can define personal identity as bodily identity, which consists of sense-contents [Ayer] |
| 5171 | The supposed 'gulf' between mind and matter is based on the senseless concept of 'substances' [Ayer] |
| 5181 | A sentence is factually significant to someone if they know how to verify its proposition [Ayer] |
| 5184 | Factual propositions imply (in conjunction with a few other premises) possible experiences [Ayer] |
| 5186 | Tautologies and empirical hypotheses form the entire class of significant propositions [Ayer] |
| 13363 | A (modern) predicate is the result of leaving a gap for the name in a sentence [Bostock] |
| 11214 | We learn 'not' along with affirmation, by learning to either affirm or deny a sentence [Rumfitt] |
| 5205 | Moral intuition is worthless if there is no criterion to decide between intuitions [Ayer] |
| 23725 | Ayer defends the emotivist version of expressivism [Ayer, by Smith,M] |
| 5206 | To say an act is wrong makes no further statement about it, but merely expresses disapproval [Ayer] |
| 5208 | A person with non-empirical attributes is unintelligible. [Ayer] |
| 5187 | When we ascribe an attribute to a thing, we covertly assert that it exists [Ayer] |
| 5207 | If theism is non-sensical, then so is atheism. [Ayer] |
| 5209 | The 'truths' expressed by theists are not literally significant [Ayer] |