human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "complexity and expressivity of branching and alternating time temporal logics with finitely many variables"):
  Abstract: We show that Branching-time temporal logics CTL and \(\mathbf{CTL}^*\), as well as Alternating-time temporal logics ATL and \(\mathbf{ATL}^*\), are as semantically expressive in the language with a single propositional variable as they are in the full language, i.e., with an unlimited supply of propositional variables. It follows that satisfiability for CTL, as well as for ATL, with a single variable is EXPTIME-complete, while satisfiability for \(\mathbf{CTL}^*\), as well as for \(\mathbf{ATL}^\mathbf{*}\), with a single variable is 2EXPTIME-complete,—i.e., for these logics, the satisfiability for formulas with only one variable is as hard as satisfiability for arbitrary formulas.

Includes members:
  Member "undecidability of first order modal and intuitionistic logics with two variables and one monadic predicate letter":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "bundled fragments of first order modal logic un decidability")
  Member "complexity and expressivity of propositional dynamic logics with finitely many variables":
    also connected through other hyperedges:
      (none)
  Member "tableau based decision procedure for full coalitional multiagent temporal epistemic logic of linear tim":
    also connected through other hyperedges:
      (none)
  Member "tableau based procedure for deciding satisfiability in the full coalitional multiagent epistemic logic":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "tableau based decision procedures for logics of strategic ability in multi agent systems")
  Member "tableau based decision procedure for the multi agent epistemic logic with operators of common and distributed knowledge":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "tableau based decision procedure for the multi agent epistemic logic with all coalitional operators for common and distributed knowledge")
  Member "the complexity of poor man s logic":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "enumeration complexity of poor man s propositional dependence logic")

Question: Please tell me which class the source paper 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)