| A class of mechanically decidable problems beyond Tarski's model |
| |
| 引用本文： | Lu YANG~(1,2) Yong FENG~(1 ) Yong YAO~1 1 Laboratory for Automated Reasoning and Programming,Chengdu Institute of Computer Applications,Chinese Academy of Sciences,Chengdu 610041,China, 2 Institute of Theoretical Computing,East China Normal University,Shanghai 200062,China. A class of mechanically decidable problems beyond Tarski's model[J]. 中国科学A辑(英文版), 2007, 50(11): 1611-1620. DOI: 10.1007/s11425-007-0090-8 |
| |
| 作者姓名： | Lu YANG~(1 2) Yong FENG~(1 ) Yong YAO~1 1 Laboratory for Automated Reasoning and Programming Chengdu Institute of Computer Applications Chinese Academy of Sciences Chengdu 610041 China 2 Institute of Theoretical Computing East China Normal University Shanghai 200062 China |
| |
| 作者单位： | Lu YANG~(1，2) Yong FENG~(1 ) Yong YAO~1 1 Laboratory for Automated Reasoning and Programming，Chengdu Institute of Computer Applications，Chinese Academy of Sciences，Chengdu 610041，China; 2 Institute of Theoretical Computing，East China Normal University，Shanghai 200062，China |
| |
| 基金项目： | 国家重点基础研究发展计划(973计划);中国科学院知识创新工程项目 |
| |
| 摘 要： | By means of dimension-decreasing method and cell-decomposition,a practical algorithm is proposed to decide the positivity of a certain class of symmetric polynomials,the numbers of whose elements are variable.This is a class of mechanically decidable problems beyond Tarski model.To im- plement the algorithm,a program nprove written in maple is developed which can decide the positivity of these polynomials rapidly.
|
A class of mechanically decidable problems beyond Tarski’s model |
| |
| Lu Yang,Yong Feng,Yong Yao. A class of mechanically decidable problems beyond Tarski’s model[J]. Science in China(Mathematics), 2007, 50(11): 1611-1620. DOI: 10.1007/s11425-007-0090-8 |
| |
| Authors: | Lu Yang Yong Feng Yong Yao |
| |
| Affiliation: | 1. Laboratory for Automated Reasoning and Programming,Chengdu Institute of Computer Applications,Chinese Academy of Sciences,Chengdu 610041,China;Institute of Theoretical Computing,East China Normal University,Shanghai 200062,China
2. Laboratory for Automated Reasoning and Programming,Chengdu Institute of Computer Applications,Chinese Academy of Sciences,Chengdu 610041,China |
| |
| Abstract: | By means of dimension-decreasing method and cell-decomposition,a practical algorithm is proposed to decide the positivity of a certain class of symmetric polynomials,the numbers of whose elements are variable.This is a class of mechanically decidable problems beyond Tarski model.To im- plement the algorithm,a program nprove written in maple is developed which can decide the positivity of these polynomials rapidly. |
| |
| Keywords: | symmetric polynomial inequality cell-decomposition Tarski's sentence Tarski's sentence Tarski's model mechanically decidable problem |
| 本文献已被 CNKI 万方数据 SpringerLink 等数据库收录！ |
