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 "bootstrapping inductive and coinductive types in hascasl"):
  Abstract: We discuss the treatment of initial datatypes and final process types in the#N#wide-spectrum language HasCASL. In particular, we present specifications that#N#illustrate how datatypes and process types arise as bootstrapped concepts using#N#HasCASL's type class mechanism, and we describe constructions of types of#N#finite and infinite trees that establish the conservativity of datatype and#N#process type declarations adhering to certain reasonable formats. The latter#N#amounts to modifying known constructions from HOL to avoid unique choice; in#N#categorical terminology, this means that we establish that quasitoposes with an#N#internal natural numbers object support initial algebras and final coalgebras#N#for a range of polynomial functors, thereby partially generalising#N#corresponding results from topos theory. Moreover, we present similar#N#constructions in categories of internal complete partial orders in#N#quasitoposes.

Includes members:
  Member "set theory for verification ii induction and recursion":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "mutual coinduction")
  Member "mechanizing coinduction and corecursion in higher order logic":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "formalising mathematics in simple type theory")

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)