scientific article; zbMATH DE number 3632418

MaRDI QIDQ4193429zbMATH OpenFDO

Authors J. Malitz

Publication date 1979

zbMATH Keywords

Axiom Of ChoiceCardinal NumbersComputabilityComputable FunctionsDefinability in ArithmeticGoedel's First Incompletness TheoremModel TheoryNon-Standard ModelsOrdinal NumbersParadoxesRecursive FunctionsRecursively Enumerable SetsSemantics of First-Order LanguagesTransfinite InductionTuring Machines

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Model theory (03C99) Turing machines and related notions (03D10) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Computability and recursion theory (03D99) Set theory (03E99)

Cited in

(3)

• Abstract minimality and circumscription
• Towards categorical models for fairness: Fully abstract presheaf semantics of SCCS with finite delay
• On meaningfulness and truth

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 Q4193429)