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: Logic for Computable Functions theorem prover | Statement: [LCF theorem prover, fullName, Logic for Computable Functions theorem prover]

Target entity: Logic for Computable Functions theorem prover
Context triple: [LCF theorem prover, fullName, Logic for Computable Functions theorem prover]

• A. LCF theorem prover chosen
  The LCF theorem prover is an early interactive proof system that pioneered the use of higher-order logic and the LCF-style architecture, forming the conceptual basis for later provers like HOL and Isabelle.
• B. Boyer–Moore theorem prover
  The Boyer–Moore theorem prover is an influential automated reasoning system for first-order logic and recursive function theory, notable for pioneering techniques in mechanical proof and program verification.
• C. Isabelle proof assistant
  Isabelle proof assistant is a widely used interactive theorem prover and generic proof assistant designed for formal verification and mathematical logic, particularly known for its support of higher-order logic.
• D. The Calculus of Computation
  The Calculus of Computation is a textbook that introduces the mathematical foundations of verification, focusing on logic-based methods for specifying and proving properties of computational systems.
• E. Curry–Howard correspondence
  The Curry–Howard correspondence is a foundational principle in logic and computer science that establishes a deep analogy between proofs and programs, and between logical propositions and types in programming languages.
• F. None of above.
• G. Unsure - the case is ambiguous/there is not enough information to decide.