The quantifier complexity of NF
From MaRDI portal
Publication:1815271
zbMATH Open0856.03043MaRDI QIDQ1815271FDOQ1815271
Authors: Richard Kaye 
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
Consistency and independence results (03E35) Nonclassical and second-order set theories (03E70) Complexity of computation (including implicit computational complexity) (03D15)
Cited In (8)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the quantifier complexity of \(\Delta_{n+1}(T)\)-induction
- Title not available (Why is that?)
- On the combinatorial and algebraic complexity of quantifier elimination
- Easy solutions for a hard problem? The computational complexity of reciprocals with quantificational antecedents
- Title not available (Why is that?)
- The Complexity of Counting Quantifiers on Equality Languages
This page was built for publication: The quantifier complexity of NF
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1815271)
