scientific article; zbMATH DE number 1159885
From MaRDI portal
Publication:4392256
zbMath0896.03013MaRDI QIDQ4392256
Publication date: 7 June 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexitydecidabilityEhrenfeucht game\(n\)-elementary equivalentmodules over finitely principal ideal rings
Analysis of algorithms and problem complexity (68Q25) Model-theoretic algebra (03C60) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15)
This page was built for publication:
