91 ideas
| 15357 | Philosophy is the most general intellectual discipline [Horsten] |
| 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] |
| 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] |
| 15329 | Nonclassical may accept T/F but deny applicability, or it may deny just T or F as well [Horsten] |
| 10073 | There cannot be a set theory which is complete [Smith,P] |
| 15326 | Doubt is thrown on classical logic by the way it so easily produces the liar paradox [Horsten] |
| 10616 | Second-order arithmetic can prove new sentences of first-order [Smith,P] |
| 15341 | Deduction Theorem: ψ only derivable from φ iff φ→ψ are axioms [Horsten] |
| 10075 | A 'partial function' maps only some elements to another set [Smith,P] |
| 10074 | A 'total function' maps every element to one element in another set [Smith,P] |
| 10612 | An argument is a 'fixed point' for a function if it is mapped back to itself [Smith,P] |
| 10076 | The 'range' of a function is the set of elements in the output set created by the function [Smith,P] |
| 10605 | Two functions are the same if they have the same extension [Smith,P] |
| 10615 | The Comprehension Schema says there is a property only had by things satisfying a condition [Smith,P] |
| 10595 | A 'theorem' of a theory is a sentence derived from the axioms using the proof system [Smith,P] |
| 15328 | A theory is 'non-conservative' if it facilitates new mathematical proofs [Horsten] |
| 10602 | A 'natural deduction system' has no axioms but many rules [Smith,P] |
| 15349 | It is easier to imagine truth-value gaps (for the Liar, say) than for truth-value gluts (both T and F) [Horsten] |
| 10613 | No nice theory can define truth for its own language [Smith,P] |
| 15366 | Satisfaction is a primitive notion, and very liable to semantical paradoxes [Horsten] |
| 10077 | A 'surjective' ('onto') function creates every element of the output set [Smith,P] |
| 10079 | A 'bijective' function has one-to-one correspondence in both directions [Smith,P] |
| 10078 | An 'injective' ('one-to-one') function creates a distinct output element from each original [Smith,P] |
| 10070 | If everything that a theory proves is true, then it is 'sound' [Smith,P] |
| 10086 | Soundness is true axioms and a truth-preserving proof system [Smith,P] |
| 10596 | A theory is 'sound' iff every theorem is true (usually from true axioms and truth-preservation) [Smith,P] |
| 10598 | A theory is 'negation complete' if it proves all sentences or their negation [Smith,P] |
| 10597 | 'Complete' applies both to whole logics, and to theories within them [Smith,P] |
| 10069 | A theory is 'negation complete' if one of its sentences or its negation can always be proved [Smith,P] |
| 10609 | Two routes to Incompleteness: semantics of sound/expressible, or syntax of consistency/proof [Smith,P] |
| 15353 | The first incompleteness theorem means that consistency does not entail soundness [Horsten] |
| 10080 | 'Effective' means simple, unintuitive, independent, controlled, dumb, and terminating [Smith,P] |
| 10087 | A theory is 'decidable' if all of its sentences could be mechanically proved [Smith,P] |
| 10088 | Any consistent, axiomatized, negation-complete formal theory is decidable [Smith,P] |
| 10081 | A set is 'enumerable' is all of its elements can result from a natural number function [Smith,P] |
| 10083 | A set is 'effectively enumerable' if a computer could eventually list every member [Smith,P] |
| 10084 | A finite set of finitely specifiable objects is always effectively enumerable (e.g. primes) [Smith,P] |
| 10085 | The set of ordered pairs of natural numbers <i,j> is effectively enumerable [Smith,P] |
| 10601 | The thorems of a nice arithmetic can be enumerated, but not the truths (so they're diffferent) [Smith,P] |
| 10600 | Being 'expressible' depends on language; being 'capture/represented' depends on axioms and proof system [Smith,P] |
| 15355 | Strengthened Liar: 'this sentence is not true in any context' - in no context can this be evaluated [Horsten] |
| 10599 | For primes we write (x not= 1 ∧ ∀u∀v(u x v = x → (u = 1 ∨ v = 1))) [Smith,P] |
| 10610 | The reals contain the naturals, but the theory of reals doesn't contain the theory of naturals [Smith,P] |
| 15364 | English expressions are denumerably infinite, but reals are nondenumerable, so many are unnameable [Horsten] |
| 10619 | The truths of arithmetic are just true equations and their universally quantified versions [Smith,P] |
| 10608 | The number of Fs is the 'successor' of the Gs if there is a single F that isn't G [Smith,P] |
| 10618 | All numbers are related to zero by the ancestral of the successor relation [Smith,P] |
| 10849 | Baby arithmetic covers addition and multiplication, but no general facts about numbers [Smith,P] |
| 10850 | Baby Arithmetic is complete, but not very expressive [Smith,P] |
| 10851 | Robinson Arithmetic 'Q' has basic axioms, quantifiers and first-order logic [Smith,P] |
| 10852 | Robinson Arithmetic (Q) is not negation complete [Smith,P] |
| 10068 | Natural numbers have zero, unique successors, unending, no circling back, and no strays [Smith,P] |
| 10603 | The logic of arithmetic must quantify over properties of numbers to handle induction [Smith,P] |
| 10848 | Multiplication only generates incompleteness if combined with addition and successor [Smith,P] |
| 10604 | Incompleteness results in arithmetic from combining addition and successor with multiplication [Smith,P] |
| 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] |
| 10617 | The 'ancestral' of a relation is a new relation which creates a long chain of the original relation [Smith,P] |
| 15372 | Some claim that indicative conditionals are believed by people, even though they are not actually held true [Horsten] |
| 3102 | Why don't we experience or remember going to sleep at night? [Magee] |
| 15347 | A theory of syntax can be based on Peano arithmetic, thanks to the translation by Gödel coding [Horsten] |