On the Complexity of the First-order Random Theory

DOI10.1093/LOGCOM/13.2.261zbMath1047.03031OpenAlexW1973929087MaRDI QIDQ4461932

Wafik Boulos Lotfallah

Publication date: 18 May 2004

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/13.2.261

zbMATH Keywords

PSPACE-completeness0-1 lawcomplexity of logical theorieslogical theory

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Model theory of finite structures (03C13)

This page was built for publication: On the Complexity of the First-order Random Theory