124 ideas
19199 | Some say metaphysics is a highly generalised empirical study of objects [Tarski] |
19193 | Disputes that fail to use precise scientific terminology are all meaningless [Tarski] |
19179 | For a definition we need the words or concepts used, the rules, and the structure of the language [Tarski] |
10153 | In everyday language, truth seems indefinable, inconsistent, and illogical [Tarski] |
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] |
19178 | Definitions of truth should not introduce a new version of the concept, but capture the old one [Tarski] |
19177 | A definition of truth should be materially adequate and formally correct [Tarski] |
19186 | A rigorous definition of truth is only possible in an exactly specified language [Tarski] |
19194 | We may eventually need to split the word 'true' into several less ambiguous terms [Tarski] |
16296 | Tarski's Theorem renders any precise version of correspondence impossible [Tarski, by Halbach] |
19196 | Scheme (T) is not a definition of truth [Tarski] |
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] |
10672 | Tarskian semantics says that a sentence is true iff it is satisfied by every sequence [Tarski, by Hossack] |
13338 | '"It is snowing" is true if and only if it is snowing' is a partial definition of the concept of truth [Tarski] |
19180 | It is convenient to attach 'true' to sentences, and hence the language must be specified [Tarski] |
19181 | In the classical concept of truth, 'snow is white' is true if snow is white [Tarski] |
19182 | Use 'true' so that all T-sentences can be asserted, and the definition will then be 'adequate' [Tarski] |
19183 | Each interpreted T-sentence is a partial definition of truth; the whole definition is their conjunction [Tarski] |
19198 | We don't give conditions for asserting 'snow is white'; just that assertion implies 'snow is white' is true [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] |
19184 | The best truth definition involves other semantic notions, like satisfaction (relating terms and objects) [Tarski] |
19191 | Specify satisfaction for simple sentences, then compounds; true sentences are satisfied by all objects [Tarski] |
19188 | We can't use a semantically closed language, or ditch our logic, so a meta-language is needed [Tarski] |
19189 | The metalanguage must contain the object language, logic, and defined semantics [Tarski] |
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] |
10824 | If listing equivalences is a reduction of truth, witchcraft is just a list of witch-victim pairs [Field,H on Tarski] |
16303 | Tarski made truth respectable, by proving that it could be defined [Tarski, by Halbach] |
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] |
16306 | Tarski defined truth, but an axiomatisation can be extracted from his inductive clauses [Tarski, by Halbach] |
15322 | Tarski's had the first axiomatic theory of truth that was minimally adequate [Tarski, by Horsten] |
19141 | Tarski thought axiomatic truth was too contingent, and in danger of inconsistencies [Tarski, by Davidson] |
19190 | We need an undefined term 'true' in the meta-language, specified by axioms [Tarski] |
19197 | Truth can't be eliminated from universal claims, or from particular unspecified claims [Tarski] |
19185 | Semantics is a very modest discipline which solves no real problems [Tarski] |
9738 | Each line of a truth table is a model [Fitting/Mendelsohn] |
19195 | Truth tables give prior conditions for logic, but are outside the system, and not definitions [Tarski] |
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] |
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] |
13727 | A 'constant' domain is the same for all worlds; 'varying' domains can be entirely separate [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] |
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] |
13138 | Disj: 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] |
13142 | Existential: a) if σ ◊X then σ.n X b) if σ ¬□X then σ.n ¬X [n is new] [Fitting/Mendelsohn] |
13141 | Negation: if σ ¬¬X then σ X [Fitting/Mendelsohn] |
13139 | Implic: a) if σ ¬(X→Y) then σ X and σ ¬Y b) if σ X→Y then σ ¬X or σ Y [Fitting/Mendelsohn] |
13144 | T reflexive: a) if σ □X then σ X b) if σ ¬◊X then σ ¬X [Fitting/Mendelsohn] |
13148 | 4r rev-trans: 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] |
13146 | B symmetric: a) if σ.n □X then σ X b) if σ.n ¬◊X then σ ¬X [n occurs] [Fitting/Mendelsohn] |
13145 | D serial: a) if σ □X then σ ◊X b) if σ ¬◊X then σ ¬□X [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] |
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] |
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] |
13111 | Read epistemic box as 'a knows/believes P' and diamond as 'for all a knows/believes, P' [Fitting/Mendelsohn] |
13112 | In epistemic logic knowers are logically omniscient, so they know that they know [Fitting/Mendelsohn] |
13113 | F: will sometime, P: was sometime, G: will always, H: was always [Fitting/Mendelsohn] |
13729 | The Barcan corresponds to anti-monotonicity, and the Converse to monotonicity [Fitting/Mendelsohn] |
13728 | The Barcan says nothing comes into existence; the Converse says nothing ceases; the pair imply stability [Fitting/Mendelsohn] |
10152 | Set theory and logic are fairy tales, but still worth studying [Tarski] |
10048 | There is no clear boundary between the logical and the non-logical [Tarski] |
13337 | A language: primitive terms, then definition rules, then sentences, then axioms, and finally inference rules [Tarski] |
18812 | Split out the logical vocabulary, make an assignment to the rest. It's logical if premises and conclusion match [Tarski, by Rumfitt] |
10694 | Logical consequence is when in any model in which the premises are true, the conclusion is true [Tarski, by Beall/Restall] |
10479 | Logical consequence: true premises give true conclusions under all interpretations [Tarski, by Hodges,W] |
13344 | X follows from sentences K iff every model of K also models X [Tarski] |
19192 | The truth definition proves semantic contradiction and excluded middle laws (not the logic laws) [Tarski] |
18759 | Identity is invariant under arbitrary permutations, so it seems to be a logical term [Tarski, by McGee] |
10823 | A name denotes an object if the object satisfies a particular sentential function [Tarski] |
9725 | 'Predicate abstraction' abstracts predicates from formulae, giving scope for constants and functions [Fitting/Mendelsohn] |
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] |
13335 | Semantics is the concepts of connections of language to reality, such as denotation, definition and truth [Tarski] |
13336 | A language containing its own semantics is inconsistent - but we can use a second language [Tarski] |
13339 | A sentence is satisfied when we can assert the sentence when the variables are assigned [Tarski] |
13340 | Satisfaction is the easiest semantical concept to define, and the others will reduce to it [Tarski] |
13343 | A 'model' is a sequence of objects which satisfies a complete set of sentential functions [Tarski] |
16323 | The object language/ metalanguage distinction is the basis of model theory [Tarski, by Halbach] |
13341 | Using the definition of truth, we can prove theories consistent within sound logics [Tarski] |
8940 | Tarski avoids the Liar Paradox, because truth cannot be asserted within the object language [Tarski, by Fisher] |
19187 | The Liar makes us assert a false sentence, so it must be taken seriously [Tarski] |
10157 | Tarski improved Hilbert's geometry axioms, and without set-theory [Tarski, by Feferman/Feferman] |
10154 | Tarski's theory of truth shifted the approach away from syntax, to set theory and semantics [Feferman/Feferman on Tarski] |
10151 | I am a deeply convinced nominalist [Tarski] |
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] |
4921 | Quantum states in microtubules could bind brain activity to produce consciousness [Penrose] |
13345 | Sentences are 'analytical' if every sequence of objects models them [Tarski] |
20407 | Taste is the capacity to judge an object or representation which is thought to be beautiful [Tarski, by Schellekens] |