scientific article; zbMATH DE number 873158
From MaRDI portal
Publication:4876410
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Classical first-order logic (03B10) Mechanization of proofs and logical operations (03B35) Computability and recursion theory (03Dxx) Consistency and independence results (03E35) Continuum hypothesis and Martin's axiom (03E50) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cited in
(8)- Decidable subsets of open logic and an algorithm for R-calculus
- Computational classification of cellular automata
- Computability and human symbolic output
- Zermelo: definiteness and the universe of definable sets
- Conservativity of ultrafilters over subsystems of second order arithmetic
- ZFC proves that the class of ordinals is not weakly compact for definable classes
- Reduction games, provability and compactness
- INCOMPLETENESS VIA PARADOX AND COMPLETENESS
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 Q4876410)
