CAJ
发表于 2025-3-25 07:42:39
http://reply.papertrans.cn/59/5881/588066/588066_22.png
身体萌芽
发表于 2025-3-25 14:33:49
978-3-642-00664-7Springer-Verlag Berlin Heidelberg 2009
逗它小傻瓜
发表于 2025-3-25 17:20:51
Logic, Language, and Computation978-3-642-00665-4Series ISSN 0302-9743 Series E-ISSN 1611-3349
callous
发表于 2025-3-25 20:22:02
Inquisitive Semantics: Two Possibilities for Disjunction, Indicative conditionals and conditional questions are treated on a par both syntactically and semantically. The semantics comes with a new logical-pragmatical notion which judges and compares the compliance of responses to an initiative in inquisitive dialogue.
发牢骚
发表于 2025-3-26 01:31:30
http://reply.papertrans.cn/59/5881/588066/588066_26.png
增长
发表于 2025-3-26 06:06:49
Satisfaction and Friendliness Relations within Classical Logic: Proof-Theoretic Approach, this theorem, we characterize the notion of satisfiability with respect to the classical two-valued semantics, in a proof-theoretic manner as system ., so that the latter becomes part of the definition of system .. Also, we obtain the strong compactness property for friendliness as a corollary of our completeness theorem.
Interim
发表于 2025-3-26 10:35:37
,The Modal Formula (†) , Is Not First-Order Definable,ions are given for why the question of the first-order definability of (†) matters, one from theoretical considerations relating to modal logic, the other from applications of modal logic to philosophy, namely logic of ability. Finally a comparison with a cognate notion in the literature is given.
不能和解
发表于 2025-3-26 13:36:38
https://doi.org/10.1007/978-3-642-00665-4complexity; computational linguistics; game theory; learning; learning theory; linguistics; logic; semantic
大酒杯
发表于 2025-3-26 17:53:56
The Computational Complexity of Quantified Reciprocals,We study the computational complexity of reciprocal sentences with quantified antecedents. We observe a computational dichotomy between different interpretations of reciprocity, and shed some light on the status of the so-called Strong Meaning Hypothesis.
NAVEN
发表于 2025-3-27 00:31:11
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/l/image/588066.jpg