scientific article; zbMATH DE number 3632418
zbMath0407.03001MaRDI QIDQ4193429
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
ComputabilityTuring MachinesTransfinite InductionRecursively Enumerable SetsModel TheoryRecursive FunctionsAxiom Of ChoiceParadoxesComputable FunctionsOrdinal NumbersCardinal NumbersDefinability in ArithmeticGoedel's First Incompletness TheoremNon-Standard ModelsSemantics of First-Order Languages
Model theory (03C99) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Computability and recursion theory (03D99) Turing machines and related notions (03D10) Set theory (03E99) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
Related Items (3)
This page was built for publication: