First-order definability on finite structures
From MaRDI portal
Publication:1263576
DOI10.1016/0168-0072(89)90036-5zbMath0688.03018MaRDI QIDQ1263576
Publication date: 1989
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0168-0072(89)90036-5
Related Items
Unnamed Item, Formulas versus Circuits for Small Distance Connectivity, The complexity of graph connectivity, Positive predicate structures for continuous data, Lower bounds for recognizing small cliques on CRCW PRAM's, Some lower bounds in parameterized \(\mathrm{AC}^{0}\), Typed Monoids – An Eilenberg-Like Theorem for Non Regular Languages
Cites Work