Inference is a process by which appropriate belief states get connected. Belief states are biological states in the sense that they are reentrant loops (or loops which connect different stimulus); their intrinsic feature is recognition. In inference or reasoning the transition process between belief states is regulated by the rule of concept usage, involved in the belief state, in natural language. Like belief states experiential states are also biological states whose extrinsic feature is recognition, such that, one can have an, say, X-type experience without recognizing it as an experience of X. One can, however, also have an experience of an X; in the latter case, one not only has an X-type experience but also recognizes an X as an X. In some cases the transition from X-type experience to believing an X to be there instantiates a quasi-inferential pattern. In all such cases the transition process is regulated by the rule of X usage. In such quasi-inferential transition additional belief states are involved. Such states assert that there are no countervailing factors and there are additional factors conducive to the conclusion. Such belief states are expressed non-propositionally in the language of thought. Propositions are a necessary part of such quasi-inference for they give content to thoughts to which one can assign 'falsity' and defeasible reasoning requires us to assign 'falsity' to our thoughts. Propositions implicated in the quasi-inferences from experience types to belief states are the evidential reasons for the conclusion and they can only be accepted as provisionally true and have to be revised in the light of further information.
| Identifer | oai:union.ndltd.org:UMASS/oai:scholarworks.umass.edu:dissertations-7553 |
| Date | 01 January 1996 |
| Creators | Mazumdar, Rinita |
| Publisher | ScholarWorks@UMass Amherst |
| Source Sets | University of Massachusetts, Amherst |
| Language | English |
| Detected Language | English |
| Type | text |
| Source | Doctoral Dissertations Available from Proquest |
Page generated in 0.0018 seconds