最简语段推导与语义接口解释

Phase Derivations,Interface Interpretations and Semantic Interface Systems

本文在最简方案MP的强势最简论（SMT）下,系统分析语段理论（PT）的推导运算和接口解释的根本问题（如局部性和辖域重组）,旨在进一步阐明研究语言官能FL须解释计算原子/词项和功能语类的特征并发现FL的计算属性即递归生成程序/优选计算系统CHL亦即BPS理论的无界递归合并、循环有效计算原则、推导的经济和多重拼读以及探索心智表征连接到C-I语义系统和SM音系接口系统的方法（外化内在思维和计算）,突显计算系统与接口解释系统的互动和接口制约（Freidin,Lasnik 2011;Reuland 2011）。分析了语义C-I接口系统与Jackendoff的CS系统的区分。

This paper analyzes and synthesizes the most fundamental issues（ e. g., scope reconstruction） in Phase Theory（PT） deriva- tions, operations and interface interpretations within the framework of the MP combined with biolinguistic enterprise and SMT. Our explorations of language faculty（FL） should be committed to explaining the computational atoms/lexical items（ LIs）, func- tional categories and their features, discovering the computational properties of FL, i. e., the recursive generative procedure/opti- mal CHL （boundlessly recursive Merge in BPS）, principles of cyclic efficient computations, economy of derivations, MSO. And mental representations can be linked to and interact with C-I ＆ SM/A-P interface systems （externalizing thoughts and computa- tions）. The paper further foregrounds the interaction of CHL with interpretive interface systems and interface conditions, and ten- tatively proposes the hypothesis that C-I semantic system can be both compatible with and distinct from Jackendoff＇s CS system.