human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "intensionality definability and computation"
  Abstract: We look at intensionality from the perspective of computation. In particular, we review how game semantics has been used to characterize the sequential functional processes, leading to powerful and flexible methods for constructing fully abstract models of programming languages, with applications in program analysis and verification. In a broader context, we can regard game semantics as a first step towards developing a positive theory of intensional structures with a robust mathematical structure, and finding the right notions of invariance for these structures.

Connected through hyperedge HE-1 (induced by source paper "local local reasoning a bi hyperdoctrine for full ground store"):
  with members:
    - "a monad for full ground reference cells"

Connected through hyperedge HE-2 (induced by source paper "an adequate while language for hybrid computation"):
  with members:
    - "a semantics for hybrid iteration"
    - "a metalanguage for guarded iteration"
    - "compositional semantics for new paradigms probabilistic hybrid and beyond"
    - "continuity as a computational effect"
    - "general recursion via coinductive types"

Connected through hyperedge HE-3 (induced by source paper "a metalanguage for guarded iteration"):
  with members:
    - "guarded traced categories"
    - "a semantics for hybrid iteration"
    - "guard your daggers and traces properties of guarded co recursion"
    - "the guarded lambda calculus programming and reasoning with guarded recursion for coinductive types"
    - "complete elgot monads and coalgebraic resumptions"
    - "a decidable weakening of compass logic based on cone shaped cardinal directions"
    - "a hoare logic for the coinductive trace based big step semantics of while"
    - "first steps in synthetic guarded domain theory step indexing in the topos of trees"

Connected through hyperedge HE-4 (induced by source paper "a game semantic model of computation"):
  with members:
    - "dynamic games and strategies"
    - "games for dependent types"
    - "games and full completeness for multiplicative linear logic"

Connected through hyperedge HE-5 (induced by source paper "on the semantics of intensionality"):
  with members:
    - "kleene s two kinds of recursion"

Connected through hyperedge HE-6 (induced by source paper "on the semantics of intensional recursion"):
  with members:
    - "kleene s two kinds of recursion"

Question: Please tell me which class the center node 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)