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 "the intuitionistic fragment of computability logic at the propositional level"):
  Abstract: Abstract   This paper presents a soundness and completeness proof for propositional intuitionistic calculus with respect to the semantics of computability logic. The latter interprets formulas as interactive computational problems, formalized as games between a machine and its environment. Intuitionistic implication is understood as algorithmic reduction in the weakest possible — and hence most natural — sense, disjunction and conjunction as deterministic-choice combinations of problems (disjunction = machine’s choice, conjunction = environment’s choice), and “absurd” as a computational problem of universal strength.

Includes members:
  Member "in the beginning was game semantics":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fundamentals of computability logic")
  Member "the logic of interactive turing reduction":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fundamentals of computability logic")
  Member "propositional computability logic ii":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fundamentals of computability logic")
  Member "from truth to computability ii":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fundamentals of computability logic")
  Member "computability logic a formal theory of interaction":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "fundamentals of computability logic")
  Member "intuitionistic computability logic":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "fundamentals of computability 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)