The quantifier complexity of NF
From MaRDI portal
Publication:1815271
zbMath0856.03043MaRDI QIDQ1815271
Publication date: 7 November 1996
Published in: Bulletin of the Belgian Mathematical Society - Simon Stevin (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/119029
Complexity of computation (including implicit computational complexity) (03D15) Consistency and independence results (03E35) Nonclassical and second-order set theories (03E70)
This page was built for publication: The quantifier complexity of NF