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 "cut elimination for a logic with induction and co induction"):
  Abstract: Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus involving induction and co-induction. These proof principles are based on a proof theoretic (rather than set-theoretic) notion of definition. Definitions are akin to logic programs, where the left and right rules for defined atoms allow one to view theories as "closed" or defining fixed points. The use of definitions and free equality makes it possible to reason intentionally about syntax. We add in a consistent way rules for pre and post fixed points, thus allowing the user to reason inductively and co-inductively about properties of computational system making full use of higher-order abstract syntax. Consistency is guaranteed via cut-elimination, where we give the first, to our knowledge, cut-elimination procedure in the presence of general inductive and co-inductive definitions.

Includes members:
  Member "a framework for specifying prototyping and reasoning about computational systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "functional programming with λ tree syntax")
  Member "least and greatest fixed points in linear logic":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "back to futures")
  Member "a two level logic approach to reasoning about computations":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "schematic polymorphism in the abella proof assistant")
  Member "reasoning in abella about structural operational semantics specifications":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a case study on logical relations using contextual types")
  Member "combining generic judgments with recursive definitions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "functional programming with λ tree syntax")
  Member "the abella interactive theorem prover system description":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "rapid prototyping formal systems in mmt 5 case studies")
  Member "induction and co induction in sequent calculus":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "combining deduction modulo and logics of fixed point definitions")
  Member "the bedwyr system for model checking over syntactic expressions":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "a characterisation of open bisimulation using an intuitionistic modal 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)