92 ideas
15357 | Philosophy is the most general intellectual discipline [Horsten] |
6294 | In the beginning was the Word, and the Word was with God, and the word was God [John] |
15352 | A definition should allow the defined term to be eliminated [Horsten] |
15324 | Semantic theories of truth seek models; axiomatic (syntactic) theories seek logical principles [Horsten] |
15323 | Truth is a property, because the truth predicate has an extension [Horsten] |
8821 | Jesus said he bore witness to the truth. Pilate asked, What is truth? [John] |
15374 | Truth has no 'nature', but we should try to describe its behaviour in inferences [Horsten] |
15348 | Propositions have sentence-like structures, so it matters little which bears the truth [Horsten] |
15333 | Modern correspondence is said to be with the facts, not with true propositions [Horsten] |
15337 | The correspondence 'theory' is too vague - about both 'correspondence' and 'facts' [Horsten] |
15334 | The coherence theory allows multiple coherent wholes, which could contradict one another [Horsten] |
15336 | The pragmatic theory of truth is relative; useful for group A can be useless for group B [Horsten] |
15354 | Tarski's hierarchy lacks uniform truth, and depends on contingent factors [Horsten] |
15340 | Tarski Bi-conditional: if you'll assert φ you'll assert φ-is-true - and also vice versa [Horsten] |
15345 | Semantic theories have a regress problem in describing truth in the languages for the models [Horsten] |
15373 | Axiomatic approaches avoid limiting definitions to avoid the truth predicate, and limited sizes of models [Horsten] |
15346 | Axiomatic approaches to truth avoid the regress problem of semantic theories [Horsten] |
15371 | An axiomatic theory needs to be of maximal strength, while being natural and sound [Horsten] |
15332 | 'Reflexive' truth theories allow iterations (it is T that it is T that p) [Horsten] |
15361 | A good theory of truth must be compositional (as well as deriving biconditionals) [Horsten] |
15350 | The Naïve Theory takes the bi-conditionals as axioms, but it is inconsistent, and allows the Liar [Horsten] |
15351 | Axiomatic theories take truth as primitive, and propose some laws of truth as axioms [Horsten] |
15367 | By adding truth to Peano Arithmetic we increase its power, so truth has mathematical content! [Horsten] |
15330 | Friedman-Sheard theory keeps classical logic and aims for maximum strength [Horsten] |
15331 | Kripke-Feferman has truth gaps, instead of classical logic, and aims for maximum strength [Horsten] |
15325 | Inferential deflationism says truth has no essence because no unrestricted logic governs the concept [Horsten] |
15344 | Deflationism skips definitions and models, and offers just accounts of basic laws of truth [Horsten] |
15356 | Deflationism concerns the nature and role of truth, but not its laws [Horsten] |
15368 | This deflationary account says truth has a role in generality, and in inference [Horsten] |
15358 | Deflationism says truth isn't a topic on its own - it just concerns what is true [Horsten] |
15359 | Deflation: instead of asserting a sentence, we can treat it as an object with the truth-property [Horsten] |
9738 | Each line of a truth table is a model [Fitting/Mendelsohn] |
9727 | Modal logic adds □ (necessarily) and ◊ (possibly) to classical logic [Fitting/Mendelsohn] |
9726 | We let 'R' be the accessibility relation: xRy is read 'y is accessible from x' [Fitting/Mendelsohn] |
9737 | The symbol ||- is the 'forcing' relation; 'Γ ||- P' means that P is true in world Γ [Fitting/Mendelsohn] |
13136 | The prefix σ names a possible world, and σ.n names a world accessible from that one [Fitting/Mendelsohn] |
13727 | A 'constant' domain is the same for all worlds; 'varying' domains can be entirely separate [Fitting/Mendelsohn] |
9734 | Modern modal logic introduces 'accessibility', saying xRy means 'y is accessible from x' [Fitting/Mendelsohn] |
9736 | A 'model' is a frame plus specification of propositions true at worlds, written < G,R,||- > [Fitting/Mendelsohn] |
9735 | A 'frame' is a set G of possible worlds, with an accessibility relation R, written < G,R > [Fitting/Mendelsohn] |
9741 | Accessibility relations can be 'reflexive' (self-referring), 'transitive' (carries over), or 'symmetric' (mutual) [Fitting/Mendelsohn] |
13141 | Negation: if σ ¬¬X then σ X [Fitting/Mendelsohn] |
13138 | Disj: a) if σ ¬(X∨Y) then σ ¬X and σ ¬Y b) if σ X∨Y then σ X or σ Y [Fitting/Mendelsohn] |
13142 | Existential: a) if σ ◊X then σ.n X b) if σ ¬□X then σ.n ¬X [n is new] [Fitting/Mendelsohn] |
13144 | T reflexive: a) if σ □X then σ X b) if σ ¬◊X then σ ¬X [Fitting/Mendelsohn] |
13145 | D serial: a) if σ □X then σ ◊X b) if σ ¬◊X then σ ¬□X [Fitting/Mendelsohn] |
13146 | B symmetric: a) if σ.n □X then σ X b) if σ.n ¬◊X then σ ¬X [n occurs] [Fitting/Mendelsohn] |
13147 | 4 transitive: a) if σ □X then σ.n □X b) if σ ¬◊X then σ.n ¬◊X [n occurs] [Fitting/Mendelsohn] |
13148 | 4r rev-trans: a) if σ.n □X then σ □X b) if σ.n ¬◊X then σ ¬◊X [n occurs] [Fitting/Mendelsohn] |
9740 | If a proposition is possibly true in a world, it is true in some world accessible from that world [Fitting/Mendelsohn] |
9739 | If a proposition is necessarily true in a world, it is true in all worlds accessible from that world [Fitting/Mendelsohn] |
13137 | Conj: a) if σ X∧Y then σ X and σ Y b) if σ ¬(X∧Y) then σ ¬X or σ ¬Y [Fitting/Mendelsohn] |
13140 | Bicon: a)if σ(X↔Y) then σ(X→Y) and σ(Y→X) b) [not biconditional, one or other fails] [Fitting/Mendelsohn] |
13139 | Implic: a) if σ ¬(X→Y) then σ X and σ ¬Y b) if σ X→Y then σ ¬X or σ Y [Fitting/Mendelsohn] |
13143 | Universal: a) if σ ¬◊X then σ.m ¬X b) if σ □X then σ.m X [m exists] [Fitting/Mendelsohn] |
13149 | S5: a) if n ◊X then kX b) if n ¬□X then k ¬X c) if n □X then k X d) if n ¬◊X then k ¬X [Fitting/Mendelsohn] |
9742 | The system K has no accessibility conditions [Fitting/Mendelsohn] |
13114 | □P → P is not valid in D (Deontic Logic), since an obligatory action may be not performed [Fitting/Mendelsohn] |
9743 | The system D has the 'serial' conditon imposed on its accessibility relation [Fitting/Mendelsohn] |
9744 | The system T has the 'reflexive' conditon imposed on its accessibility relation [Fitting/Mendelsohn] |
9746 | The system K4 has the 'transitive' condition on its accessibility relation [Fitting/Mendelsohn] |
9745 | The system B has the 'reflexive' and 'symmetric' conditions on its accessibility relation [Fitting/Mendelsohn] |
9747 | The system S4 has the 'reflexive' and 'transitive' conditions on its accessibility relation [Fitting/Mendelsohn] |
9748 | System S5 has the 'reflexive', 'symmetric' and 'transitive' conditions on its accessibility relation [Fitting/Mendelsohn] |
9404 | Modality affects content, because P→◊P is valid, but ◊P→P isn't [Fitting/Mendelsohn] |
13112 | In epistemic logic knowers are logically omniscient, so they know that they know [Fitting/Mendelsohn] |
13111 | Read epistemic box as 'a knows/believes P' and diamond as 'for all a knows/believes, P' [Fitting/Mendelsohn] |
13113 | F: will sometime, P: was sometime, G: will always, H: was always [Fitting/Mendelsohn] |
13728 | The Barcan says nothing comes into existence; the Converse says nothing ceases; the pair imply stability [Fitting/Mendelsohn] |
13729 | The Barcan corresponds to anti-monotonicity, and the Converse to monotonicity [Fitting/Mendelsohn] |
15329 | Nonclassical may accept T/F but deny applicability, or it may deny just T or F as well [Horsten] |
15326 | Doubt is thrown on classical logic by the way it so easily produces the liar paradox [Horsten] |
15341 | Deduction Theorem: ψ only derivable from φ iff φ→ψ are axioms [Horsten] |
15328 | A theory is 'non-conservative' if it facilitates new mathematical proofs [Horsten] |
9725 | 'Predicate abstraction' abstracts predicates from formulae, giving scope for constants and functions [Fitting/Mendelsohn] |
15349 | It is easier to imagine truth-value gaps (for the Liar, say) than for truth-value gluts (both T and F) [Horsten] |
15366 | Satisfaction is a primitive notion, and very liable to semantical paradoxes [Horsten] |
15353 | The first incompleteness theorem means that consistency does not entail soundness [Horsten] |
15355 | Strengthened Liar: 'this sentence is not true in any context' - in no context can this be evaluated [Horsten] |
15364 | English expressions are denumerably infinite, but reals are nondenumerable, so many are unnameable [Horsten] |
15360 | ZFC showed that the concept of set is mathematical, not logical, because of its existence claims [Horsten] |
15369 | Set theory is substantial over first-order arithmetic, because it enables new proofs [Horsten] |
15370 | Predicativism says mathematical definitions must not include the thing being defined [Horsten] |
15338 | We may believe in atomic facts, but surely not complex disjunctive ones? [Horsten] |
15363 | In the supervaluationist account, disjunctions are not determined by their disjuncts [Horsten] |
15362 | If 'Italy is large' lacks truth, so must 'Italy is not large'; but classical logic says it's large or it isn't [Horsten] |
13730 | The Indiscernibility of Identicals has been a big problem for modal logic [Fitting/Mendelsohn] |
13725 | □ must be sensitive as to whether it picks out an object by essential or by contingent properties [Fitting/Mendelsohn] |
13731 | Objects retain their possible properties across worlds, so a bundle theory of them seems best [Fitting/Mendelsohn] |
13726 | Counterpart relations are neither symmetric nor transitive, so there is no logic of equality for them [Fitting/Mendelsohn] |
15372 | Some claim that indicative conditionals are believed by people, even though they are not actually held true [Horsten] |
15347 | A theory of syntax can be based on Peano arithmetic, thanks to the translation by Gödel coding [Horsten] |