Structure with fast elimination of quantifiers

DOI10.2178/jsl/1140641177zbMath1100.03018OpenAlexW2088848525MaRDI QIDQ5477638

Mihai Prunescu

Publication date: 5 July 2006

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2178/jsl/1140641177

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Quantifier elimination, model completeness, and related topics (03C10)

Related Items (1)

On Relativizations of the P =? NP Question for Several Structures

Cites Work

• \(\mathbf P =\mathbf{NP}\) for some structures over the binary words
• Non-effective Quantifier Elimination
• Outline of a Theory of Truth

This page was built for publication: Structure with fast elimination of quantifiers