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: mu-calculus | Statement: [Dexter Kozen, knownFor, mu-calculus]

Target entity: mu-calculus
Context triple: [Dexter Kozen, knownFor, mu-calculus]

• A. branching-time temporal logic CTL*
  Branching-time temporal logic CTL* is a highly expressive formalism in computer science used to specify and reason about the behavior of concurrent and reactive systems over branching time structures.
• B. linear temporal logic
  Linear temporal logic is a modal temporal logic used in computer science and formal methods to specify and reason about the behavior of systems over linear sequences of time, using operators that describe how properties evolve in the future.
• C. Kleene algebra
  Kleene algebra is an algebraic structure used to model and reason about regular expressions, program control flow, and formal languages through operations like choice, sequencing, and iteration.
• D. π-calculus
  The π-calculus is a formal mathematical model for describing and analyzing concurrent, communicating systems, particularly those with dynamic network structures.
• E. Hoare logic
  Hoare logic is a formal system in computer science used to reason rigorously about the correctness of computer programs using logical assertions about program states.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"

Entity: mu-calculus
Triple: [Dexter Kozen, knownFor, mu-calculus]

The mu-calculus is a powerful modal logic with fixed-point operators used to express and verify properties of recursive and infinite-state systems in computer science.

Target entity: mu-calculus
Target entity description: The mu-calculus is a powerful modal logic with fixed-point operators used to express and verify properties of recursive and infinite-state systems in computer science.

• A. branching-time temporal logic CTL*
  Branching-time temporal logic CTL* is a highly expressive formalism in computer science used to specify and reason about the behavior of concurrent and reactive systems over branching time structures.
• B. linear temporal logic
  Linear temporal logic is a modal temporal logic used in computer science and formal methods to specify and reason about the behavior of systems over linear sequences of time, using operators that describe how properties evolve in the future.
• C. Kleene algebra
  Kleene algebra is an algebraic structure used to model and reason about regular expressions, program control flow, and formal languages through operations like choice, sequencing, and iteration.
• D. π-calculus
  The π-calculus is a formal mathematical model for describing and analyzing concurrent, communicating systems, particularly those with dynamic network structures.
• E. Hoare logic
  Hoare logic is a formal system in computer science used to reason rigorously about the correctness of computer programs using logical assertions about program states.
• F. None of above. chosen