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 logic of interactive turing reduction"):
  Abstract: The paper gives a soundness and completeness proof for the implicative fragment of intuitionistic calculus with respect to the semantics of computability logic, which understands intuitionistic implication as interactive algorithmic reduction. This concept — more precisely, the associated concept of reducibility — is a generalization of Turing reducibility from the traditional, input/output sorts of problems to computational tasks of arbitrary degrees of interactivity. MSC: primary: 03B47; secondary: 03F50; 03B70; 68Q10; 68T27; 68T30; 91A05

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 "propositional computability logic ii":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fundamentals of computability logic")
  Member "from truth to computability ii":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fundamentals of computability logic")
  Member "computability logic a formal theory of interaction":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fundamentals of computability logic")
  Member "intuitionistic computability logic":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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)