human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "łukasiewicz mu calculus"
  Abstract: htmlabstractThe paper explores properties of Łukasiewicz mu-calculus, a version of the quantitative/probabilistic#R##N#modal m-calculus containing both weak and strong conjunctions and disjunctions from Łukasiewicz#R##N#(fuzzy) logic. We show that this logic encodes the well-known probabilistic temporal logic PCTL.#R##N#And we give a model-checking algorithm for computing the rational denotational value of a formula#R##N#at any state in a ﬁnite rational probabilistic nondeterministic transition system.

Connected through hyperedge HE-1 (induced by source paper "probabilistic logics based on riesz spaces"):
  with members:
    - "probabilistic modal mu calculus with independent product"

Connected through hyperedge HE-2 (induced by source paper "fixpoint games on continuous lattices"):
  with members:
    - "on the equivalence of game and denotational semantics for the probabilistic mu calculus"

Connected through hyperedge HE-3 (induced by source paper "a real valued modal logic"):
  with members:
    - "on modal logics for qualitative possibility in a fuzzy setting"
    - "sequent and hypersequent calculi for abelian and lukasiewicz logics"
    - "reasoning within fuzzy description logics"

Connected through hyperedge HE-4 (induced by source paper "on the problem of computing the probability of regular sets of trees"):
  with members:
    - "probabilistic modal mu calculus with independent product"
    - "model checking stochastic branching processes"

Question: Please tell me which class the center node belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.LO(Logic in Computer Science)