Publication:3829550
From MaRDI portal
zbMath0675.03038MaRDI QIDQ3829550
Publication date: 1987
extensionality; transitive closure; conservativity; polynomial computability; collection principle; bounded set theory; \(\Delta\)-programming; Kripke-Platek set theory without foundation
03B70: Logic in computer science
03D15: Complexity of computation (including implicit computational complexity)
03E70: Nonclassical and second-order set theories
03F99: Proof theory and constructive mathematics
Related Items
Hereditarily-finite sets, data bases and polynomial-time computability, \(\Delta\)-languages for sets and LOGSPACE computable graph transformers, Linear ordering on graphs, anti-founded sets and polynomial time computability