scientific article
From MaRDI portal
Publication:3829550
zbMath0675.03038MaRDI QIDQ3829550
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
extensionalitytransitive closureconservativitypolynomial computabilitycollection principlebounded set theory\(\Delta\)-programmingKripke-Platek set theory without foundation
Logic in computer science (03B70) Complexity of computation (including implicit computational complexity) (03D15) Nonclassical and second-order set theories (03E70) Proof theory and constructive mathematics (03F99)
Related Items (3)
\(\Delta\)-languages for sets and LOGSPACE computable graph transformers ⋮ Linear ordering on graphs, anti-founded sets and polynomial time computability ⋮ Hereditarily-finite sets, data bases and polynomial-time computability
This page was built for publication:
