scientific article; zbMATH DE number 1748574
This paper presents a formal analysis of what it is for a sentence \(P\) to be about an object \(c\). The approach is semantical. The basic idea is that a sentence is about an object just in case there are models in which it is true and models in which it is false that differ only with respect to their assignments to atomic sentences that explicitly mention the object. Given a first-order language, \(L_c\), with the individual constant \(c\), and the restricted quantifier \(\exists x\neq c\), but lacking the full-fledged identity predicate `=', sentences \(F\) of \(L_c\) are given the usual model-theoretic interpretation. Then a sentence, \(F\), ``is not about the object named by \(c\) just in case for every interpretation \(M\), \(M\models F\) iff \(M'\models F\), for every \(M'\in M^c\), where \(M^c\) is the set of \(c\)-variants of \(M\). That notion is precisely defined. The sentence \(F\) ``is about the object named by \(c\) just in case it is not ``not about that object. Several properties of this sense of `about' are demonstrated. The notion is also extended to describe when a theory (a set of sentences in \(L_c\) closed under logical consequence) is about the object named by \(c\). This extension is not automatic since the notion of aboutness as defined is not stable with respect to conjunction, or even logical consequence. For the entire collection see [Zbl 0982.00058].
- Relatively about: Loose composites and loose ends
- Reasoning about trust and aboutness in the context of communication
- scientific article; zbMATH DE number 1421195 (Why is no real title available?)
- The concept \textit{horse} is a concept
- How to produce information about a given entity using automated deduction methods
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4530459)