Mathematical foundations for computer science. Sets, logic, recursion
DOI10.1007/978-3-658-03079-7zbMATH Open1291.68003OpenAlexW2502785135MaRDI QIDQ366330FDOQ366330
Authors: Kurt-Ulrich Witt
Publication date: 13 September 2013
Published in: Springer-Lehrbuch (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-658-03079-7
Recommendations
Boolean algebraFibonacci numbersundecidabilityclassical propositional logiccomputability theoryRice's theoremalgebraic structuresAckermann functionChurch's thesisclassical predicate calculuscomputably enumerable setsgeneralised recursion schemehalting problemHorn logiclogical calculimathematical foundations of computer sciencenaive set theorynumber systemsnumerationsprograms in pseudo-codeproof methodsrecursion theoremrecursive functionsresolution calculus
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Classical propositional logic (03B05) Mathematics for nonmathematicians (engineering, social sciences, etc.) (00A06) Logic in computer science (03B70) Recursive functions and relations, subrecursive hierarchies (03D20) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) General topics in the theory of computing (68Q01)
Cited In (6)
This page was built for publication: Mathematical foundations for computer science. Sets, logic, recursion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q366330)