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 "simply typed lambda calculus modulo type isomorphisms"):
  Abstract: We define a simply typed, non-deterministic lambda-calculus where isomorphic types are equated. To this end, an equivalence relation is settled at the term level. We then provide a proof of strong normalisation modulo equivalence. Such a proof is a non-trivial adaptation of the reducibility method.

Includes members:
  Member "call by value non determinism in a linear logic type discipline":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "types by need extended version")
  Member "non determinism through type isomorphism":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "proof normalisation in a logic identifying isomorphic propositions")
  Member "the probability of non confluent systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "functional pearl the distributive lambda calculus")
  Member "a system f accounting for scalars":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "extensional proofs in a propositional logic modulo isomorphisms")
  Member "linearity in the non deterministic call by value setting":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "extensional proofs in a propositional logic modulo isomorphisms")
  Member "pure type systems without explicit contexts":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "extensional proofs in a propositional logic modulo isomorphisms")
  Member "a type system for the vectorial aspect of the linear algebraic lambda calculus":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the vectorial λ calculus")
  Member "models and theories of lambda calculus":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "proof normalisation in a logic identifying isomorphic propositions")

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)