Abstract
AbstractWe analyze the theory of rational trees with finitely many constructors, infinitely many atoms and an atomicity predicate. We design a new decision procedure, proving in addition that this theory is model-complete. We also show that the enrichment of the language with selectors and simultaneous parametric fixpoints enjoys quantifier elimination.
Publisher
Springer Nature Switzerland
Reference22 articles.
1. Bockmayr, A., Weispfenning, V.: Solving numerical constraints. In: Handbook of Automated Reasoning, vol. II, pp. 751–844. Elsevier and MIT Press (2001)
2. Chang, C.-C., Keisler, J.H.: Model Theory, 3rd edn. North-Holland Publishing Co., Amsterdam-London (1990)
3. Colmerauer, A.: Equations and inequations on finite and infinite trees. In: Fifth Generation Computer Systems (1984)
4. Djelloul, K., Dao, T., Frühwirth, T.W.: Theory of finite or infinite trees revisited. Theory Pract. Logic Program. 8(4), 431–489 (2008)
5. Lecture Notes in Computer Science;A Dovier,2001