半代数集一阶查询的二维与三维连通性测试
Two- versus three-dimensional connectivity testing of first-order queries to semi-algebraic sets
摘要：
本文讨论的问题是否可以确定一个半代数集的连通性在三维测试的连接有限数量的二维“样本”的集合，这些样本定义的一阶查询。对于两类一阶查询，这个问题的答案是否定的：无笛卡尔积查询和正一遍查询。
英文摘要：
This paper addresses the question whether one can determine the connectivity of a semi-algebraic set in three dimensions by testing the connectivity of a finite number of two-dimensional ``samples'' of the set, where these samples are defined by first-order queries. The question is answered negatively for two classes of first-order queries: cartesian-product-free, and positive one-pass.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
