  Such accounts analyze truthbearers, e.g., sentences, into their subsentential constituents and dissolve the relation of correspondence into appropriate semantic subrelations: names refer to, or denote, objects; predicates (open sentences) apply to, or are satisfied by objects. Satisfaction of complex predicates can be handled recursively in terms of logical structure and satisfaction of simpler constituent predicates: an object o satisfies ‘x is not F’ iff o does not satisfy ‘x is F’; o satisfies ‘x is F or x is G’ iff o satisfies ‘x is F’ or o satisfies ‘x is G’; and so on. These recursions are anchored in a base-clause addressing the satisfaction of primitive predicates: an object o satisfies ‘x is F’ iff o instantiates the property expressed by ‘F’. Some would prefer a more nominalistic base-clause for satisfaction, hoping to get by without seriously invoking properties. Truth for singular sentences, consisting of a name and an arbitrarily complex predicate, is defined thus: A singular sentence is true iff the object denoted by the name satisfies the predicate. Logical machinery provided by Tarski (1935) can be used to turn this simplified sketch into a more general definition of truth—a definition that handles sentences containing relational predicates and quantifiers and covers molecular sentences as well. Whether Tarski’s own definition of truth can be regarded as a correspondence definition, even in this modified sense, is under debate (cf. Popper 1972; Field 1972, 1986; Kirkham 1992, chaps. 5-6; Soames 1999; Künne 2003, chap. 4; Patterson 2008.)