Quantifier hierarchies over the first-Order definable tree languages

• 作 者: 沈云付
• 机 构: DepartmentofMathematics,BeijingNormalUniversity,Beijing100875,China
• 出 处: 中国科学：技术科学英文版
• 发表日期: 1996年3期
• 关键词: FIRST-ORDER LOGIC DEFINABILITY tree hierarchy. first-order logic definability tr
• 基金项目: Project supported by the National Natural Science Foundation of China.

Using Boolean operations and concatenation product w.r.t special trees,quantifier hierarchies are given by way of alternate existential and universal quantifiers for the first-order definable tree languages.