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 "axiomatizations of team logics"):
  Abstract: In a modular approach, we lift Hilbert-style proof systems for propositional, modal and first-order logic to generalized systems for their respective team-based extensions. We obtain sound and complete axiomatizations for the dependence-free fragment FO(~) of V\"a\"an\"anen's first-order team logic TL, for propositional team logic PTL, quantified propositional team logic QPTL, modal team logic MTL, and for the corresponding logics of dependence, independence, inclusion and exclusion. #R##N#As a crucial step in the completeness proof, we show that the above logics admit, in a particular sense, a semantics-preserving elimination of modalities and quantifiers from formulas.

Includes members:
  Member "validity and entailment in modal and propositional dependence logics":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "model checking and validity in propositional and modal inclusion logics")
  Member "on quantified propositional logics and the exponential time hierarchy":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the succinctness of atoms of dependency")
  Member "the expressive power of modal logic with inclusion atoms":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the succinctness of atoms of dependency")
  Member "complexity of propositional independence and inclusion logic":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "canonical models and the complexity of modal team logic")
  Member "modal inclusion logic being lax is simpler than being strict":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "canonical models and the complexity of modal team logic")
  Member "a van benthem theorem for modal team semantics":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the succinctness of atoms of dependency")
  Member "axiomatizing propositional dependence logics":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "model checking and validity in propositional and modal inclusion logics")
  Member "modal independence logic":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on the succinctness of atoms of dependency")

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)