scientific article; zbMATH DE number 4104951

MaRDI QIDQ3829550zbMATH OpenFDO

Authors Vladimir Yu. Sazonov

Publication date 1987

zbMATH Keywords

\(\Delta\)-programmingbounded set theorycollection principleconservativityextensionalityKripke-Platek set theory without foundationpolynomial computabilitytransitive closure

Mathematics Subject Classification ID

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)

Recommendations

• scientific article; zbMATH DE number 4128804
• scientific article; zbMATH DE number 1163985
• scientific article; zbMATH DE number 4057507
• Hereditarily-finite sets, data bases and polynomial-time computability
• Decision procedures for elementary sublanguages of set theory IX. Unsolvability of the decision problem for a restricted subclass of the Δ0-formulas in set theory

Cited in

(6)

• Hereditarily-finite sets, data bases and polynomial-time computability
• -languages for sets and LOGSPACE computable graph transformers
• Light affine set theory: A naive set theory of polynomial time
• Linear ordering on graphs, anti-founded sets and polynomial time computability
• Bounded theories for polyspace computability
• scientific article; zbMATH DE number 4128804 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3829550)