scientific article; zbMATH DE number 1163985
From MaRDI portal
Publication:4395612
zbMath0903.03031MaRDI QIDQ4395612
Publication date: 14 December 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
conservativityexplicit definabilityAnti-Foundation AxiomBounded Set TheoriesFinite Model TheoryLogic of Inductive Definitionsprovably recursive operations
Complexity of computation (including implicit computational complexity) (03D15) Nonclassical and second-order set theories (03E70) Inductive definability (03D70) Proof theory and constructive mathematics (03F99)
Related Items (5)
Cobham recursive set functions ⋮ Admissible closures of polynomial time computable arithmetic ⋮ The strength of extensionality. II: Weak weak set theories without infinity ⋮ Linear ordering on graphs, anti-founded sets and polynomial time computability ⋮ Constructibility and decidability versus domain independence and absoluteness
This page was built for publication:
