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: "axioms for definability and full completeness"
  Abstract: Axioms are presented which encapsulate the properties satisfied by categories of games which form the basis of results on full abstraction for PCF and other programming languages, and on full completeness for various logics and type theories. #R##N#Axioms are presented on models of PCF from which full abstraction can be proved. These axioms have been distilled from recent results on definability and full abstraction of game semantics for a number of programming languages. Full completeness for pure simply-typed $\lambda$-calculus is also axiomatized.

Connected through hyperedge HE-1 (induced by source paper "games for dependent types"):
  with members:
    - "a categorical semantics for linear logical frameworks"
    - "game semantics for access control"
    - "a game semantics for generic polymorphism"
    - "games and full completeness for multiplicative linear logic"

Connected through hyperedge HE-2 (induced by source paper "intensionality definability and computation"):
  with members:
    - "information processes and games"
    - "what are the fundamental structures of concurrency we still don t know"
    - "games and full completeness for multiplicative linear logic"
    - "full abstraction for nominal general references"

Connected through hyperedge HE-3 (induced by source paper "full abstraction for nominal general references"):
  with members:
    - "games and full completeness for multiplicative linear logic"

Connected through hyperedge HE-4 (induced by source paper "sequentiality vs concurrency in games and logic"):
  with members:
    - "semantics of interaction"
    - "games and full completeness for multiplicative linear logic"

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)