scientific article; zbMATH DE number 408792

zbMath0783.03020MaRDI QIDQ4202936

Jörg Flum

Publication date: 6 September 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational complexity of a querydefinability in \(k\)-bounded theoriesexpressibility in first-order logic with a fixed number of bound variables

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items (1)

The \(k\)-variable property is stronger than H-dimension \(k\)

This page was built for publication: