| This thesis presents a theory that explains binding and control with common mechanisms. Although a unified account of the two phenomena was frequently attempted in the 1980's and early 90's, such an approach seems to have been unpopular due to certain problems since the late 90's. In this study it is shown that these problems are merely superficial and can be overcome with careful examination.;With respect to anaphors that are not in argument positions of syntactic predicates, I entertain the hypothesis by the above authors that they are what are often called logophors, which are governed by a set of discourse conditions. I identify some of these conditions and explore some possibilities as to how such discourse conditions can be organized into a formalized theory.;In chapter 3, it is maintained that PRO in obligatory control (OC) contexts is licensed by the Chain Condition. Discussed also are some of the objections raised by a number of researchers to the idea that the same mechanism underlies OC PRO and anaphors (in argument positions of syntactic predicates). Furthermore, it is illustrated that PRO in non-obligatory control (NOC) environments is logophoric and is licensed by discourse conditions. Lastly, it is argued that there exist control constructions that look very much like OC but are, in fact, properly classified as NOC, which I term pseudo-obligatory control (POC).;In chapter 4, I deal with some of the residual issues in control theory. Here, three problems are taken up: the choice of controller with OC double complement verbs, partial control and the difference between predicates that exhibit raising and those that exhibit arbitrary control.;In chapter 2, I start with Reinhart & Reuland's (1993) assumption that the application of Condition A of binding theory is restricted to anaphors in argument positions of syntactic predicates. I then adopt Fox's (1993) modification to Reinhart & Reuland's (1993) theory, whereby Condition A is reduced to the Chain Condition. As the discussion proceeds, further revisions are suggested. In particular, the domain for A-chain formation is defined over syntactic predicates, which is called the A-Chain Projection Domain (ACPD). |
