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 "formalising mathematics in simple type theory"):
  Abstract: Despite the considerable interest in new dependent type theories, simple type theory (which dates from 1940) is sufficient to formalise serious topics in mathematics. This point is seen by examining formal proofs of a theorem about stereographic projections. A formalisation using the HOL Light proof assistant is contrasted with one using Isabelle/HOL. Harrison’s technique for formalising Euclidean spaces is contrasted with an approach using Isabelle/HOL’s axiomatic type classes. However, every formal system can be outgrown, and mathematics should be formalised with a view that it will eventually migrate to a new formalism.

Includes members:
  Member "computational logic its origins and applications":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "from lcf to isabelle hol")
  Member "formalization of the fundamental group in untyped set theory using auto2":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "computational logic its origins and applications")
  Member "natural deduction as higher order resolution":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "generating correctness proofs with neural networks")
  Member "constructing recursion operators in intuitionistic type theory":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "termination of rewrite relations on λ terms based on girard s notion of reducibility")
  Member "mechanizing coinduction and corecursion in higher order logic":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "formal languages formally and coinductively")

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)