Off-campus access
Using PhilPapers from home?
Click here to configure this browser for off-campus access.
- Bipin Indurkhya (1986). Constrained Semantic Transference: A Formal Theory of Metaphors. Synthese 68 (3):515 - 551.In this paper we propose a formal theory of metaphors called Constrained Semantic Transference [CST]. We start from the assumptions that metaphors are characterized by the description of one domain, called the target domain, in terms of another domain, called the source domain; and that a metaphor works by transferring a set of structural relationships from the source domain to the target domain coherently.Starting from these assumptions, we formally define the concept of T-MAPs which are partial coherent mappings from the source domain to the target domain. We also define two operators, called Augmentation and Positing Structure that extend a given T-MAP by adding new structure to the target domain.
Similar books and articles
Assuming the indefinite extensibility of any domain of quantification leads to reasoning with extensible domain semantics. It is showed that some theorems (e.g. Thomson's) in conventional semantics logic are not theorems in a logic provided with this new semantics.
In (1b), for the most part induces a so-called Quantificational Variability Effect (QVE) on the NP the linguists from the East Coast, yielding roughly the interpretation ‘most of the linguists from the East Coast came to NELS’. We claim that the two constructions above differ in the domain where they apply, producing similar but not identical quantificational interpretations over the NP. In particular, we argue that most of the NPs applies to the nominal domain, while for the most part applies to the verbal domain. Our claim is based on two sets of novel semantic data. First, we show that the distribution of most of the NPs is parallel to that of all the NPs in terms of its selective compatibility with collective predicates. To account for this data, we extend Brisson’s (1998, 2003) analysis of all the NPs to most of the NPs, concluding that most is an ∃-quantifier introducing a group of a certain proportion. Second, we show that, when for the most part gives rise to a QVE on a definite NP, the collective interpretation is not available. We develop a semantic analysis of for the most part as a verbal modifier that explains the lack of collective readings and that extends to interpretations other than QVE. The structure of the paper is as follows: in section 2, we introduce some general background on events and distributivity that are relevant to the current paper. In section 3, we propose the analysis of most of the NPs, followed by the analysis of for the most part in section 4. Section 5 concludes the paper and discusses further issues.
No categories
Prior theory – that is theorising on the basis of thought and intuition , as opposed to attempting to explain observed data – inevitably distorts what comes after. It biases us in the selection of our data (the data model) and certainly biases any theorising that follows. It does this because we (as humans) can not help but see the world through our theorising – we are blind without the theoretical “spectacles” described by Kuhn (1962). If a theory has shown to be essentially correct in some domain (i.e. by thorough validation against the target problem or domain) using it as a framework can be helpful, however, if the theory is not mature or even speculative then it can effectively prevent progress . I argue that, although we can not ever completely avoid this sort of bias, we can minimise its effect. Two sources of prior theorising coming from opposite directions are sociology and formal systems – neither of these is inherently biased towards prior theorising, but just happens to be a source for such theorising at the present time. Computer scientists who project the results of interesting models onto society are also guilty of constructing first and fitting later.
No categories
Laboratory-based studies of problem solving suggest that transfer of solution principles from an analogue to a target arises only minimally without the presence of directive hints. Recently, however, real-world studies indicate that experts frequently and spontaneously use analogies in domain-based problem solving. There is also some evidence that in certain circumstances domain novices can draw analogies designed to illustrate arguments. It is less clear, however, whether domain novices can invoke analogies in the sophisticated manner of experts to enable them to progress problem solving. In the current study groups of novices and experts tackled large-scale management problems. Spontaneous analogising was observed in both conditions, with no marked differences between expertise levels in the frequency, structure, or function of analogising. On average four analogies were generated by groups per hour, with significantly more relational mappings between analogue and target being produced than superficial object-and-attribute mappings. Analogising served two different purposes: problem solving (dominated by relational mappings), and illustration (which for novices was dominated by object-and-attribute mappings). Overall, our novices showed a sophistication in domain-based analogical reasoning that is usually only observed with experts, in addition to a sensitivity to the pragmatics of analogy use.
No categories
The structuralist theory of truth approximation essen-tially deals with truth approximation by theory revision for a fixed domain. However, variable domains can also be taken into account, where the main changes concern domain extensions and restrictions. In this paper I will present a coherent set of definitions of “more truth-likeness”, “empirical progress” and “truth approximation” due to a revision of the domain of intended applications. This set of definitions seems to be the natural counterpart of the basic definitions of similar notions as far as theory revision is concerned. The formal aspects of theory revision strongly suggest an analogy between truth approximation and design research, for example, drug research. Whereas a new drug may be better for a certain disease than an old one, a certain drug may be better for another disease than for the original target disease, a phenomenon which was nicely captured by the title of a study by Rein Vos [1991]: Drugs Looking for Diseases. Similarly, truth approximation may not only take the shape of theory revision but also of domain revision, naturally suggesting the phenomenon of “Theories looking for domains”. However, whereas Vos documented his title with a number of examples, so far, apart from plausible cases of “truth accumulation by domain extension”, I did not find clear-cut empirical instantiations of the analogy, only, as such, very interesting, non-empirical examples.
No categories
Suppose there is a domain of discourse of English, then everything of which any predicate is true is a member of that domain. If English has a domain of discourse, then, since ‘is a domain of discourse of English’ is itself a predicate of English and true of that domain, that domain is a member of itself. But nothing is a member of itself. Thus English has no domain of discourse. We defend this argument and go on to argue to the same conclusion without relying on the supposition that English is a language which contains the predicate ‘is a domain of discourse of English’.
At the end of the 19th century, 'logic' moved from the discipline of philosophy to that of mathematics. One hundred years later, we have a plethora of formal logics. Looking at the situation form informatics, the mathematical discipline proved only a temporary shelter for `logic'. For there is Domain Theory, a constructive mathematical theory which extends the notion of computability into the continuum and spans the field of all possible deductive systems. Domain Theory describes the space of data-types which computers can ideally compute -- and computation in terms of these types. Domain Theory is constructive but only potentially operational. Here one particular operational model is derived from Domain Theory which consists of `universals', that is, model independent operands and operators. With these universals, Domains (logical models) can be approximated and continuously determined. The universal data-types and rules derived from Domain Theory relate strongly to the first formal logic conceived on philosophical grounds, Aristotelian (categorical) logic. This is no accident. For Aristotle, deduction was type-dependent and he too thought in term of type independent universal `essences'. This paper initiates the next `logical' step `beyond' Domain Theory by reconnecting `formal logic' with its origin.
James Franklin has argued that the formal, mathematical sciences of complexity — network theory, information theory, game theory, control theory, etc. — have a methodology that is different from the methodology of the natural sciences, and which can result in a knowledge of physical systems that has the epistemic character of deductive mathematical knowledge. I evaluate Franklin’s arguments in light of realistic examples of mathematical modelling and conclude that, in general, the formal sciences are no more able to guarantee certainty than the natural sciences. Yet the formal sciences are characterized by a ‘domain-independence’ that is philosophically interesting, and I argue that it is this property that Franklin actually employs to distinguish the formal from the natural sciences. I use Einstein’s ‘principle’/‘constructive’ theory distinction to contrast the domain-independence of physical theories with the domain-independence of formal mathematical theories, and show how both kinds of domain-independence function to generate the domain-independence that is observed in the complex systems sciences. © 1999 Elsevier Science Ltd. All rights reserved.
No categories
I will explore some of my conclusions concerning conceptual metaphors collected during a series of interviews, in particular with two Christian street preachers. The data includes speech, gesture, and commented drawings of God, themselves and paradise. Some of the metaphors analyzed are: metaphors for God (FATHER, SHEPHERD, LOVER, etc); GOOD/GOD IS UP; BAD IS DOWN; STRICT FATHER vs. NURTURING PARENT; MORAL ACCOUNTABILITY. This data demonstrates that the more entrenched a frame of mind is, the less plastic it is, because the primary source domain of our habitual conceptual metaphor will always motivate any other “laminated domain mappings”, or blends, especially for such meaningful concepts like personhood or belief systems. My investigation will try to shed new light on the phenomenology of religious experiences and personhood, using cognitive linguistics as a prime tool of analysis.
No categories
J. M. Kennedy and J. Vervaeke argue that my view of the bodily and imaginative basis of meaning commits me to a mistaken reductionism and to the erroneous view that metaphors actually impose structure on the target domain. I explain the sense in which image schemas are central to the bodily grounding of meaning, although in a way that is not reductionistic. I then show how conceptual metaphors can involve pre-existing image-schematic structure and yet can also be partially constitutive of the conceptual structure of the target domain. In this way human conceptual systems can be both rooted in patterns of our bodily interactions and at the same time can be subject to various kinds of imaginative development and extension.
Discussion of Bipin Indurkhya, Constrained semantic transference: A formal theory of metaphors
|
|
There are no threads in this forum |
Nothing in this forum yet.

