81 ideas
| 16295 | Tarski proved that truth cannot be defined from within a given theory [Tarski, by Halbach] |
| 15342 | Tarski proved that any reasonably expressive language suffers from the liar paradox [Tarski, by Horsten] |
| 19069 | 'True sentence' has no use consistent with logic and ordinary language, so definition seems hopeless [Tarski] |
| 16296 | Tarski's Theorem renders any precise version of correspondence impossible [Tarski, by Halbach] |
| 10672 | Tarskian semantics says that a sentence is true iff it is satisfied by every sequence [Tarski, by Hossack] |
| 15339 | Tarski gave up on the essence of truth, and asked how truth is used, or how it functions [Tarski, by Horsten] |
| 16302 | Tarski did not just aim at a definition; he also offered an adequacy criterion for any truth definition [Tarski, by Halbach] |
| 19135 | Tarski enumerates cases of truth, so it can't be applied to new words or languages [Davidson on Tarski] |
| 19138 | Tarski define truths by giving the extension of the predicate, rather than the meaning [Davidson on Tarski] |
| 4699 | Tarski made truth relative, by only defining truth within some given artificial language [Tarski, by O'Grady] |
| 19324 | Tarski has to avoid stating how truths relate to states of affairs [Kirkham on Tarski] |
| 15410 | Truth only applies to closed formulas, but we need satisfaction of open formulas to define it [Burgess on Tarski] |
| 18811 | Tarski uses sentential functions; truly assigning the objects to variables is what satisfies them [Tarski, by Rumfitt] |
| 15365 | We can define the truth predicate using 'true of' (satisfaction) for variables and some objects [Tarski, by Horsten] |
| 19314 | For physicalism, reduce truth to satisfaction, then define satisfaction as physical-plus-logic [Tarski, by Kirkham] |
| 19316 | Insight: don't use truth, use a property which can be compositional in complex quantified sentence [Tarski, by Kirkham] |
| 19175 | Tarski gave axioms for satisfaction, then derived its explicit definition, which led to defining truth [Tarski, by Davidson] |
| 16303 | Tarski made truth respectable, by proving that it could be defined [Tarski, by Halbach] |
| 19134 | Tarski defined truth for particular languages, but didn't define it across languages [Davidson on Tarski] |
| 16304 | Tarski didn't capture the notion of an adequate truth definition, as Convention T won't prove non-contradiction [Halbach on Tarski] |
| 2571 | Tarski says that his semantic theory of truth is completely neutral about all metaphysics [Tarski, by Haack] |
| 10821 | Physicalists should explain reference nonsemantically, rather than getting rid of it [Tarski, by Field,H] |
| 10822 | A physicalist account must add primitive reference to Tarski's theory [Field,H on Tarski] |
| 10969 | Tarski had a theory of truth, and a theory of theories of truth [Tarski, by Read] |
| 17746 | Tarski's 'truth' is a precise relation between the language and its semantics [Tarski, by Walicki] |
| 10904 | Tarskian truth neglects the atomic sentences [Mulligan/Simons/Smith on Tarski] |
| 15322 | Tarski's had the first axiomatic theory of truth that was minimally adequate [Tarski, by Horsten] |
| 16306 | Tarski defined truth, but an axiomatisation can be extracted from his inductive clauses [Tarski, by Halbach] |
| 10073 | There cannot be a set theory which is complete [Smith,P] |
| 10616 | Second-order arithmetic can prove new sentences of first-order [Smith,P] |
| 18759 | Identity is invariant under arbitrary permutations, so it seems to be a logical term [Tarski, by McGee] |
| 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] |
| 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] |
| 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] |
| 10823 | A name denotes an object if the object satisfies a particular sentential function [Tarski] |
| 10602 | A 'natural deduction system' has no axioms but many rules [Smith,P] |
| 18756 | Tarski built a compositional semantics for predicate logic, from dependent satisfactions [Tarski, by McGee] |
| 19313 | Tarksi invented the first semantics for predicate logic, using this conception of truth [Tarski, by Kirkham] |
| 10613 | No nice theory can define truth for its own language [Smith,P] |
| 16323 | The object language/ metalanguage distinction is the basis of model theory [Tarski, by Halbach] |
| 10077 | A 'surjective' ('onto') function creates every element of the output set [Smith,P] |
| 10078 | An 'injective' ('one-to-one') function creates a distinct output element from each original [Smith,P] |
| 10079 | A 'bijective' function has one-to-one correspondence in both directions [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] |
| 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] |
| 8940 | Tarski avoids the Liar Paradox, because truth cannot be asserted within the object language [Tarski, by Fisher] |
| 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] |
| 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] |
| 10154 | Tarski's theory of truth shifted the approach away from syntax, to set theory and semantics [Feferman/Feferman on Tarski] |
| 10617 | The 'ancestral' of a relation is a new relation which creates a long chain of the original relation [Smith,P] |
| 20407 | Taste is the capacity to judge an object or representation which is thought to be beautiful [Tarski, by Schellekens] |
| 18639 | If we assess what people would buy in an imaginary insurance market, our taxes could copy it [Dworkin, by Kymlicka] |