scientific article
From MaRDI portal
Publication:3367317
zbMath1092.03015MaRDI QIDQ3367317
Publication date: 24 January 2006
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
set theorycomputabilitycomprehension schemasafe formulasdecidable relationsfinite and computable answersafety signature
Database theory (68P15) Logic in computer science (03B70) Classical first-order logic (03B10) Axiomatics of classical set theory and its fragments (03E30) Applications of computability and recursion theory (03D80)
Related Items
Constructibility and decidability versus domain independence and absoluteness ⋮ A Framework for Formalizing Set Theories Based on the Use of Static Set Terms ⋮ WEYL REEXAMINED: “DAS KONTINUUM” 100 YEARS LATER ⋮ Safety, domain independence and translation of complex value database queries