Triple

Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).

Phrase: von Neumann–Bernays–Gödel class theory | Statement: [Morse–Kelley set theory by class–set distinction, isRelatedTo, von Neumann–Bernays–Gödel class theory]

Target entity: von Neumann–Bernays–Gödel class theory
Context triple: [Morse–Kelley set theory by class–set distinction, isRelatedTo, von Neumann–Bernays–Gödel class theory]

• A. von Neumann–Bernays–Gödel set theory chosen
  Von Neumann–Bernays–Gödel set theory is an axiomatic set theory extending Zermelo–Fraenkel set theory by formally distinguishing between sets and classes, widely used in foundational studies of mathematics.
• B. Zermelo–Fraenkel set theory
  Zermelo–Fraenkel set theory is the standard axiomatic framework for modern set theory, designed to avoid paradoxes and provide a rigorous foundation for much of mathematics.
• C. Morse–Kelley set theory by class–set distinction
  Morse–Kelley set theory by class–set distinction is a foundational system that avoids certain set-theoretic paradoxes by rigorously distinguishing between sets and proper classes within a powerful axiomatic framework.
• D. Zermelo set theory
  Zermelo set theory is an early axiomatic system for set theory, introduced by Ernst Zermelo to rigorously formalize the concept of sets and avoid known paradoxes.
• E. Kripke–Platek set theory
  Kripke–Platek set theory is a weaker, predicative subsystem of Zermelo–Fraenkel set theory focused on sets that are explicitly constructible and often used in the study of admissible sets and recursion theory.
• F. None of above.
• G. Unsure - the case is ambiguous/there is not enough information to decide.