Is ZF a hack? Comparing the complexity of some (formalist interpretations of) foundational systems for mathematics (Q865658)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 5128353
Language Label Description Also known as
default for all languages
No label defined
    English
    Is ZF a hack? Comparing the complexity of some (formalist interpretations of) foundational systems for mathematics
    scientific article; zbMATH DE number 5128353

      Statements

      Is ZF a hack? Comparing the complexity of some (formalist interpretations of) foundational systems for mathematics (English)
      0 references
      0 references
      20 February 2007
      0 references
      logical frameworks
      0 references
      foundation of mathematics
      0 references
      Automath
      0 references
      set theory
      0 references
      higher-order logic
      0 references
      type theory
      0 references
      category theory
      0 references
      Zermelo-Fraenkel
      0 references
      ZF
      0 references
      ZFC
      0 references
      New Foundations
      0 references
      NF
      0 references
      HOL
      0 references
      Isabelle
      0 references
      calculus of constructions
      0 references
      Martin-Löf type theory
      0 references
      formalization of mathematics
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers