155 ideas
16325 | Analysis rests on natural language, but its ideal is a framework which revises language [Halbach] |
224 | When questions are doubtful we should concentrate not on objects but on ideas of the intellect [Plato] |
232 | Opposites are as unlike as possible [Plato] |
8937 | Plato's 'Parmenides' is the greatest artistic achievement of the ancient dialectic [Hegel on Plato] |
16292 | An explicit definition enables the elimination of what is defined [Halbach] |
16307 | Don't trust analogies; they are no more than a guideline [Halbach] |
16330 | Truth-value 'gluts' allow two truth values together; 'gaps' give a partial conception of truth [Halbach] |
16339 | Truth axioms prove objects exist, so truth doesn't seem to be a logical notion [Halbach] |
16324 | Any definition of truth requires a metalanguage [Halbach] |
16293 | Traditional definitions of truth often make it more obscure, rather than less [Halbach] |
16301 | If people have big doubts about truth, a definition might give it more credibility [Halbach] |
16297 | Semantic theories avoid Tarski's Theorem by sticking to a sublanguage [Halbach] |
16337 | Disquotational truth theories are short of deductive power [Halbach] |
16322 | CT proves PA consistent, which PA can't do on its own, so CT is not conservative over PA [Halbach] |
16294 | Axiomatic truth doesn't presuppose a truth-definition, though it could admit it at a later stage [Halbach] |
16326 | The main semantic theories of truth are Kripke's theory, and revisions semantics [Halbach] |
16311 | To axiomatise Tarski's truth definition, we need a binary predicate for his 'satisfaction' [Halbach] |
16318 | Compositional Truth CT has the truth of a sentence depending of the semantic values of its constituents [Halbach] |
16299 | Gödel numbering means a theory of truth can use Peano Arithmetic as its base theory [Halbach] |
16340 | Truth axioms need a base theory, because that is where truth issues arise [Halbach] |
16305 | We know a complete axiomatisation of truth is not feasible [Halbach] |
16313 | A theory is 'conservative' if it adds no new theorems to its base theory [Halbach, by PG] |
16315 | The Tarski Biconditional theory TB is Peano Arithmetic, plus truth, plus all Tarski bi-conditionals [Halbach] |
16314 | Theories of truth are 'typed' (truth can't apply to sentences containing 'true'), or 'type-free' [Halbach] |
16327 | Friedman-Sheard is type-free Compositional Truth, with two inference rules for truth [Halbach] |
16329 | Kripke-Feferman theory KF axiomatises Kripke fixed-points, with Strong Kleene logic with gluts [Halbach] |
16331 | The KF is much stronger deductively than FS, which relies on classical truth [Halbach] |
16332 | The KF theory is useful, but it is not a theory containing its own truth predicate [Halbach] |
16320 | Some say deflationism is axioms which are conservative over the base theory [Halbach] |
16338 | Deflationism says truth is a disquotation device to express generalisations, adding no new knowledge [Halbach] |
16317 | The main problem for deflationists is they can express generalisations, but not prove them [Halbach] |
16316 | Deflationists say truth is just for expressing infinite conjunctions or generalisations [Halbach] |
16319 | Compositional Truth CT proves generalisations, so is preferred in discussions of deflationism [Halbach] |
13439 | Venn Diagrams map three predicates into eight compartments, then look for the conclusion [Bostock] |
13422 | 'Conjunctive Normal Form' is ensuring that no disjunction has a conjunction within its scope [Bostock] |
13421 | 'Disjunctive Normal Form' is ensuring that no conjunction has a disjunction 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] |
16335 | In Strong Kleene logic a disjunction just needs one disjunct to be true [Halbach] |
16334 | In Weak Kleene logic there are 'gaps', neither true nor false if one component lacks a truth value [Halbach] |
13846 | A 'free' logic can have empty names, and a 'universally free' logic can have empty domains [Bostock] |
16309 | Every attempt at formal rigour uses some set theory [Halbach] |
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] |
16333 | The underestimated costs of giving up classical logic are found in mathematical reasoning [Halbach] |
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] |
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] |
16310 | A theory is some formulae and all of their consequences [Halbach] |
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] |
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] |
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] |
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] |
16342 | You cannot just say all of Peano arithmetic is true, as 'true' isn't part of the system [Halbach] |
16341 | Normally we only endorse a theory if we believe it to be sound [Halbach] |
16344 | Soundness must involve truth; the soundness of PA certainly needs it [Halbach] |
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] |
16347 | Many new paradoxes may await us when we study interactions between frameworks [Halbach] |
13986 | Plato found antinomies in ideas, Kant in space and time, and Bradley in relations [Plato, by Ryle] |
14150 | Plato's 'Parmenides' is perhaps the best collection of antinomies ever made [Russell on Plato] |
16336 | The liar paradox applies truth to a negated truth (but the conditional will serve equally) [Halbach] |
16321 | The compactness theorem can prove nonstandard models of PA [Halbach] |
16343 | The global reflection principle seems to express the soundness of Peano Arithmetic [Halbach] |
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] |
16312 | To reduce PA to ZF, we represent the non-negative integers with von Neumann ordinals [Halbach] |
16150 | One is, so numbers exist, so endless numbers exist, and each one must partake of being [Plato] |
16308 | Set theory was liberated early from types, and recent truth-theories are exploring type-free [Halbach] |
229 | The one was and is and will be and was becoming and is becoming and will become [Plato] |
21821 | Plato's Parmenides has a three-part theory, of Primal One, a One-Many, and a One-and-Many [Plato, by Plotinus] |
16345 | That Peano arithmetic is interpretable in ZF set theory is taken by philosophers as a reduction [Halbach] |
221 | Absolute ideas, such as the Good and the Beautiful, cannot be known by us [Plato] |
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] |
227 | You must always mean the same thing when you utter the same name [Plato] |
223 | If you deny that each thing always stays the same, you destroy the possibility of discussion [Plato] |
210 | It would be absurd to think there were abstract Forms for vile things like hair, mud and dirt [Plato] |
220 | The concept of a master includes the concept of a slave [Plato] |
211 | If admirable things have Forms, maybe everything else does as well [Plato] |
219 | If absolute ideas existed in us, they would cease to be absolute [Plato] |
228 | Greatness and smallness must exist, to be opposed to one another, and come into being in things [Plato] |
16151 | Plato moves from Forms to a theory of genera and principles in his later work [Plato, by Frede,M] |
218 | Participation is not by means of similarity, so we are looking for some other method of participation [Plato] |
215 | If things partake of ideas, this implies either that everything thinks, or that everything actually is thought [Plato] |
213 | Each idea is in all its participants at once, just as daytime is a unity but in many separate places at once [Plato] |
216 | If things are made alike by participating in something, that thing will be the absolute idea [Plato] |
212 | The whole idea of each Form must be found in each thing which participates in it [Plato] |
217 | Nothing can be like an absolute idea, because a third idea intervenes to make them alike (leading to a regress) [Plato] |
214 | If absolute greatness and great things are seen as the same, another thing appears which makes them seem great [Plato] |
15851 | Parts must belong to a created thing with a distinct form [Plato] |
15846 | In Parmenides, if composition is identity, a whole is nothing more than its parts [Plato, by Harte,V] |
15849 | Plato says only a one has parts, and a many does not [Plato, by Harte,V] |
15850 | Anything which has parts must be one thing, and parts are of a one, not of a many [Plato] |
13259 | It seems that the One must be composed of parts, which contradicts its being one [Plato] |
13847 | If non-existent things are self-identical, they are just one thing - so call it the 'null object' [Bostock] |
15847 | Two things relate either as same or different, or part of a whole, or the whole of the part [Plato] |
16346 | Maybe necessity is a predicate, not the usual operator, to make it more like truth [Halbach] |
13820 | The idea that anything which can be proved is necessary has a problem with empty names [Bostock] |
13363 | A (modern) predicate is the result of leaving a gap for the name in a sentence [Bostock] |
16298 | We need propositions to ascribe the same beliefs to people with different languages [Halbach] |
222 | Only a great person can understand the essence of things, and an even greater person can teach it [Plato] |
225 | The unlimited has no shape and is endless [Plato] |
233 | Some things do not partake of the One [Plato] |
2062 | The only movement possible for the One is in space or in alteration [Plato] |
231 | Everything partakes of the One in some way [Plato] |
234 | We couldn't discuss the non-existence of the One without knowledge of it [Plato] |