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: "denotational semantics for normal modal logics with propositional quantifiers and identity"
  Abstract: We present a denotational semantics for modal propositional logics with propositional quantifiers and connectives for propositional identity and reference. A proposition is here not given as a set of possible worlds but as the denotation of a formula under a valuation function. In fact, the semantics is independent from the possible worlds framework and derives from principles of non-Fregean Logic. Modal laws such as Necessitation are not a priori given. Our aim is to restore modal principles and to axiomatize normal modal logics as first-order theories with identity. We start with a basic system containing axiom \textbf{K} as the only modal principle and establish completeness results. Following an earlier approach (S. Lewitzka, Studia Logica 97(2), 233 -- 264, 2011), we regard a modality as an appropriate subset of the propositional universe of a model. We show that the Necessitation Rule as well as further modal principles can be restored by imposing specific semantic constraints. As a main result, we present model constructions proving that normal modal systems, such as K, T, S4, S5, K45, KD45, can be captured precisely by our denotational semantics. This paper can be seen as a proposal to study modal logics as first-order theories of propositions.

Connected through hyperedge HE-1 (induced by source paper "algebraic semantics for a modal logic close to s1"):
  with members:
    - "denotational semantics for modal systems s3 s5 extended by axioms for propositional quantifiers and identity"

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)