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 "a logical basis for constructive systems"):
  Abstract: The work is devoted to Computability logic (CoL)—the philosophical/mathematical platform and long-term project for redeveloping classical logic after replacing truth by computability in its underlying semantics. This article elaborates some basic complexity theory for the CoL framework. Then it proves soundness and completeness for the deductive system CL12 with respect to the semantics of CoL, including the version of the latter based on polynomial time computability instead of computability-in-principle. CL12 is a sequent calculus system, where the meaning of a sequent intuitively can be characterized as ‘the succedent is algorithmically reducible to the antecedent’, and where formulas are built from predicate letters, function letters, variables, constants, identity, negation, parallel and choice connectives and blind and choice quantifiers. A case is made that CL12 is an adequate logical basis for constructive applied theories, including complexity-oriented ones. MSC: primary: 03F50; secondary: 03D75; 03D15; 03D20; 68Q10; 68T27; 68T30.

Includes members:
  Member "games and full completeness for multiplicative linear logic":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "interaction laws of monads and comonads")
  Member "toggling operators in computability logic":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fundamentals of computability logic")
  Member "towards applied theories based on computability logic":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fundamentals of computability logic")
  Member "many concepts and two logics of algorithmic reduction":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "introduction to clarithmetic ii")
  Member "in the beginning was game semantics":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "fundamentals of computability logic")
  Member "sequential operators in computability logic":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "fundamentals of computability logic")
  Member "cirquent calculus deepened":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fundamentals of computability logic")
  Member "the logic of interactive turing reduction":
    also connected through other hyperedges:
      - Hyperedge HE-8 (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)