Set constraints in some equational theories

DOI10.1006/inco.1997.2692zbMath1034.68505OpenAlexW2098303102MaRDI QIDQ1271568

Witold Charatonik

Publication date: 24 November 2002

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/558d01e4850c2f9236be05d8951b08257d9f34d2

Mathematics Subject Classification ID

Theory of programming languages (68N15) General topics in the theory of software (68N01)

Related Items

Language equations with complementation: decision problems, Computational completeness of equations over sets of natural numbers, Decision problems for language equations, Set constraints with intersection, ON EQUATIONS OVER SETS OF NUMBERS AND THEIR LIMITATIONS, On Equations over Sets of Numbers and Their Limitations

Cites Work

• Complexity results for classes of quantificational formulas
• Syntacticness, cycle-syntacticness and shallow theories
• Solvable cases of the decision problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item