发布求助
文献互助 智能选刊 最新文献

Journal of Logic Language and Information最新文献

筛选
英文 中文
A Dynamic Epistemic Logic with Lying and Theory of Mind Limitations. 动态认知逻辑与谎言与心智限制理论。
IF 1 3区 数学
Journal of Logic Language and Information Pub Date : 2026-01-01 Epub Date: 2026-08-11 DOI: 10.1007/s10849-026-09479-7
Jakob Dirk Top, Rineke Verbrugge, Harmen de Weerd
{"title":"A Dynamic Epistemic Logic with Lying and Theory of Mind Limitations.","authors":"Jakob Dirk Top, Rineke Verbrugge, Harmen de Weerd","doi":"10.1007/s10849-026-09479-7","DOIUrl":"10.1007/s10849-026-09479-7","url":null,"abstract":"<p><p><i>Theory of mind</i> (ToM) is the ability to attribute and reason about unobservable mental states of others, such as knowledge, beliefs, and intentions. ToM is needed in social interactions, negotiations, cooperation, and deception, but there is a limit to the recursive depth of ToM attributions humans can make. Researchers in epistemic logic classically assume that agents have common knowledge of honesty and perfect rationality, whereas humans lie and have ToM limitations. In our present work, we bridge this gap by developing a sound and strongly complete dynamic epistemic logic that models both lying and human ToM limitations. The design of our logic is inspired by findings from prior behavioural research. Our logic makes use of action models to model belief change caused by lying and other types of announcements. Using theoretical examples, we show how a listener deals with lies that she cannot understand due to her ToM limits.</p>","PeriodicalId":48732,"journal":{"name":"Journal of Logic Language and Information","volume":"35 1-2","pages":"5-40"},"PeriodicalIF":1.0,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC13526147/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148867388","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Inquisitive Neighborhood Logic. 好奇邻域逻辑。
IF 0.6 3区 数学
Journal of Logic Language and Information Pub Date : 2025-01-01 Epub Date: 2025-09-10 DOI: 10.1007/s10849-025-09440-0
Ivano Ciardelli
{"title":"Inquisitive Neighborhood Logic.","authors":"Ivano Ciardelli","doi":"10.1007/s10849-025-09440-0","DOIUrl":"10.1007/s10849-025-09440-0","url":null,"abstract":"<p><p>We explore an inquisitive modal logic designed to reason about neighborhood models. This logic is based on an inquisitive strict conditional operator <math><mo>⇛</mo></math> , which quantifies over neighborhoods, and which can be applied to both statements and questions. In terms of this operator we also define two unary modalities <math><mo>⊞</mo></math> and , which act respectively as a universal and existential quantifier over neighborhoods. We prove that the expressive power of this logic matches the natural notion of bisimilarity in neighborhood models. We show that certain fragments of the language are invariant under certain modifications of the set of neighborhoods, and use this to show that <math><mo>⇛</mo></math> is not definable from <math><mo>⊞</mo></math> and , and that questions embedded under <math><mo>⇛</mo></math> are indispensable. We provide a sound and complete axiomatization of our logic, both in general and in restriction to some salient frame classes, establish decidability via the finite model property, and discuss the relations between our logic and other modal logics interpreted over neighborhood models.</p>","PeriodicalId":48732,"journal":{"name":"Journal of Logic Language and Information","volume":"34 5","pages":"419-461"},"PeriodicalIF":0.6,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12634800/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145589954","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Why Sometimes the King of France is Not Bald: Presupposition Denial Without Ambiguity 为什么有时法国国王不是秃头？没有歧义的预设否定
IF 0.8 3区 数学
Journal of Logic Language and Information Pub Date : 2024-09-13 DOI: 10.1007/s10849-024-09419-3
Leonard Jay Clapp
{"title":"Why Sometimes the King of France is Not Bald: Presupposition Denial Without Ambiguity","authors":"Leonard Jay Clapp","doi":"10.1007/s10849-024-09419-3","DOIUrl":"https://doi.org/10.1007/s10849-024-09419-3","url":null,"abstract":"<p>Contrary to what seems to be predicted by a Strawson-inspired view, in presupposition denials the presupposition triggered by, e.g., ‘the king of France’ seems to be cancelled. To explain this puzzling instance of the projection problem, defenders of a Strawson-inspired view have proposed various ad hoc ambiguities. I develop a version of Segmented Discourse Representation Theory that explains the puzzling presupposition-cancelling phenomenon relying only on independently motivated pragmatic processes. Appealing to Kripke’s “test” for the adequacy of ambiguity motivating counterexamples, I argue that my analysis is to be preferred over proposals that posit ad hoc ambiguities. Two key insights of my analysis are, first, that the “cancellation” of presuppositions in presupposition denials depends upon the illocutionary effects of rejection and correction, and, second, that the process of presupposition accommodation often involves the speaker performing an ancillary sort of speech act, viz. the speech act of presupposing.</p>","PeriodicalId":48732,"journal":{"name":"Journal of Logic Language and Information","volume":"2016 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142179871","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Logical Models of Mathematical Texts: The Case of Conventions for Division by Zero 数学文本的逻辑模型：零除法的约定案例
IF 0.8 3区 数学
Journal of Logic Language and Information Pub Date : 2024-07-13 DOI: 10.1007/s10849-024-09420-w
Jan A. Bergstra, John V. Tucker
{"title":"Logical Models of Mathematical Texts: The Case of Conventions for Division by Zero","authors":"Jan A. Bergstra, John V. Tucker","doi":"10.1007/s10849-024-09420-w","DOIUrl":"https://doi.org/10.1007/s10849-024-09420-w","url":null,"abstract":"<p>Arithmetical texts involving division are governed by conventions that avoid the risk of problems to do with division by zero (DbZ). A model for elementary arithmetic texts is given, and with the help of many examples and counter examples a partial description of what may be called <i>traditional conventions</i> on DbZ is explored. We introduce the informal notions of legal and illegal texts to analyse these conventions. First, we show that the legality of a text is algorithmically undecidable. As a consequence, we know that there is no simple sound and complete set of guidelines to determine unambiguously how DbZ is to be avoided. We argue that these observations call for further explorations of mathematical conventions. We propose a method using logics to progress the analysis of legality versus illegality: arithmetical texts in a model can be transformed into logical formulae over special total algebras that are able to approximate partiality but in a total world. The algebras we use are called <i>common meadows</i>. Our dive into informal mathematical practice using formal methods opens up questions about DbZ which we address in conclusion.</p>","PeriodicalId":48732,"journal":{"name":"Journal of Logic Language and Information","volume":"45 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2024-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141608769","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Propositional Logic for Infinitive Sentences 无定语从句的命题逻辑
IF 0.8 3区 数学
Journal of Logic Language and Information Pub Date : 2024-07-03 DOI: 10.1007/s10849-024-09418-4
Nicola Spinelli
{"title":"Propositional Logic for Infinitive Sentences","authors":"Nicola Spinelli","doi":"10.1007/s10849-024-09418-4","DOIUrl":"https://doi.org/10.1007/s10849-024-09418-4","url":null,"abstract":"<p>This paper is about sentences of form <i>To be human is to be an animal</i>, <i>To live is to fight</i>, etc. I call them ‘infinitive sentences’. I define an augmented propositional language able to express them and give a matrix-based semantics for it. I also give a tableau proof system, called <b>IL</b> for Infinitive Logic. I prove soundness, completeness and a few basic theorems.</p>","PeriodicalId":48732,"journal":{"name":"Journal of Logic Language and Information","volume":"24 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2024-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141522413","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Syllogistic Relevance and Term Logic 逻辑相关性和术语逻辑
IF 0.8 3区 数学
Journal of Logic Language and Information Pub Date : 2024-06-28 DOI: 10.1007/s10849-024-09417-5
J.-Martín Castro-Manzano
{"title":"Syllogistic Relevance and Term Logic","authors":"J.-Martín Castro-Manzano","doi":"10.1007/s10849-024-09417-5","DOIUrl":"https://doi.org/10.1007/s10849-024-09417-5","url":null,"abstract":"<p>Term Functor Logic is a term logic that recovers some important features of the traditional, Aristotelian logic; however, it turns out that it does not preserve all of the Aristotelian properties a valid inference should have insofar as the class of theorems of Term Functor Logic includes some inferences that may be considered irrelevant (e.g. <i>ex falso</i>, <i>verum ad</i>, and <i>petitio principii</i>). By following an Aristotelian or syllogistic notion of relevance, in this contribution we adapt a tableaux method for Term Functor Logic in order to avoid irrelevance and we offer some sort of intuitive semantics in terms of traditional inferential situations (e.g. <i>propter quid</i>, <i>quia</i>, <i>non causa ut causa</i>, and <i>non sequitur</i>).</p>","PeriodicalId":48732,"journal":{"name":"Journal of Logic Language and Information","volume":"130 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2024-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141509486","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Algebraic Completeness of Connexive and Bi-Intuitionistic Multilattice Logics 连立逻辑和双推理多网格逻辑的代数完备性
IF 0.8 3区 数学
Journal of Logic Language and Information Pub Date : 2024-05-03 DOI: 10.1007/s10849-024-09415-7
Yaroslav Petrukhin
{"title":"Algebraic Completeness of Connexive and Bi-Intuitionistic Multilattice Logics","authors":"Yaroslav Petrukhin","doi":"10.1007/s10849-024-09415-7","DOIUrl":"https://doi.org/10.1007/s10849-024-09415-7","url":null,"abstract":"<p>In this paper, we introduce the notions of connexive and bi-intuitionistic multilattices and develop on their base the algebraic semantics for Kamide, Shramko, and Wansing’s connexive and bi-intuitionistic multilattice logics which were previously known in the form of sequent calculi and Kripke semantics. We prove that these logics are sound and complete with respect to the presented algebraic structures.</p>","PeriodicalId":48732,"journal":{"name":"Journal of Logic Language and Information","volume":"4 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2024-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140886995","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Rules of Explosion and Excluded Middle: Constructing a Unified Single-Succedent Gentzen-Style Framework for Classical, Paradefinite, Paraconsistent, and Paracomplete Logics 爆炸和排除中间规则：为经典逻辑、范式逻辑、准一致逻辑和准完全逻辑构建统一的单先决条件根岑式框架
IF 0.8 3区 数学
Journal of Logic Language and Information Pub Date : 2024-04-29 DOI: 10.1007/s10849-024-09416-6
Norihiro Kamide
{"title":"Rules of Explosion and Excluded Middle: Constructing a Unified Single-Succedent Gentzen-Style Framework for Classical, Paradefinite, Paraconsistent, and Paracomplete Logics","authors":"Norihiro Kamide","doi":"10.1007/s10849-024-09416-6","DOIUrl":"https://doi.org/10.1007/s10849-024-09416-6","url":null,"abstract":"<p>A unified and modular falsification-aware single-succedent Gentzen-style framework is introduced for classical, paradefinite, paraconsistent, and paracomplete logics. This framework is composed of two special inference rules, referred to as the rules of explosion and excluded middle, which correspond to the principle of explosion and the law of excluded middle, respectively. Similar to the cut rule in Gentzen’s LK for classical logic, these rules are admissible in cut-free LK. A falsification-aware single-succedent Gentzen-style sequent calculus fsCL for classical logic is formalized based on the proposed framework. The calculus fsCL is obtained from the existing falsification-aware single-succedent Gentzen-style sequent calculus GN4 for Nelson’s paradefinite (or paraconsistent) four-valued logic N4 by adding the rules of explosion and excluded middle. A falsification-aware single-succedent Gentzen-style sequent calculus GN3 for Nelson’s paracomplete three-valued logic N3 is also obtained from GN4 by adding the rule of explosion. The cut-elimination theorems for fsCL, GN3, and some of their neighbors as well as the Glivenko theorem for fsCL are proved.</p>","PeriodicalId":48732,"journal":{"name":"Journal of Logic Language and Information","volume":"15 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2024-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140832122","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A basic system of paraconsistent Nelsonian logic of conditionals. 一个基本的副一致尼尔森条件逻辑系统。
IF 0.7 3区 数学
Journal of Logic Language and Information Pub Date : 2024-01-01 Epub Date: 2024-12-03 DOI: 10.1007/s10849-024-09421-9
Grigory K Olkhovikov
{"title":"A basic system of paraconsistent Nelsonian logic of conditionals.","authors":"Grigory K Olkhovikov","doi":"10.1007/s10849-024-09421-9","DOIUrl":"https://doi.org/10.1007/s10849-024-09421-9","url":null,"abstract":"<p><p>We define a Kripke semantics for a conditional logic based on the propositional logic <math><mrow><mi>N</mi> <mn>4</mn></mrow> </math> , the paraconsistent variant of Nelson's logic of strong negation; we axiomatize the minimal system induced by this semantics. The resulting logic, which we call <math><mrow><mi>N</mi> <mn>4</mn> <mi>CK</mi></mrow> </math> , shows strong connections both with the basic intuitionistic logic of conditionals <math><mi>IntCK</mi></math> introduced earlier in (Olkhovikov, 2023) and with the <math><mrow><mi>N</mi> <mn>4</mn></mrow> </math> -based modal logic <math><msup><mi>FSK</mi> <mi>d</mi></msup> </math> introduced in (Odintsov and Wansing, 2004) as one of the possible counterparts to the classical modal system <math><mi>K</mi></math> . We map these connections by looking into the embeddings which obtain between the aforementioned systems.</p>","PeriodicalId":48732,"journal":{"name":"Journal of Logic Language and Information","volume":"33 4-5","pages":"299-337"},"PeriodicalIF":0.7,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11625081/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142802901","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Monotonic Inference with Unscoped Episodic Logical Forms: From Principles to System 无限定情景逻辑形式的单调推理:从原则到系统
IF 0.8 3区 数学
Journal of Logic Language and Information Pub Date : 2023-11-30 DOI: 10.1007/s10849-023-09412-2
Gene Louis Kim, Mandar Juvekar, Junis Ekmekciu, Viet Duong, Lenhart Schubert
{"title":"Monotonic Inference with Unscoped Episodic Logical Forms: From Principles to System","authors":"Gene Louis Kim, Mandar Juvekar, Junis Ekmekciu, Viet Duong, Lenhart Schubert","doi":"10.1007/s10849-023-09412-2","DOIUrl":"https://doi.org/10.1007/s10849-023-09412-2","url":null,"abstract":"<p>We describe the foundations and the systematization of natural logic-like monotonic inference using unscoped episodic logical forms (ULFs) that as reported by Kim et al. (Proceedings of the 1st and 2nd Workshops on Natural Logic Meets Machine Learning (NALOMA), Groningen, 2021a, b) introduced and first evaluated. In addition to providing a more detailed explanation of the theory and system, we present results from extending the inference manager to address a few of the limitations that as reported by Kim et al. (Proceedings of the 1st and 2nd Workshops on Natural Logic Meets Machine Learning (NALOMA), Groningen, 2021b) naive system has. Namely, we add mechanisms to incorporate lexical information from the hypothesis (or goal) sentence, enable the inference manager to consider multiple possible scopings for a single sentence, and match against the goal using English rather than the ULF.</p>","PeriodicalId":48732,"journal":{"name":"Journal of Logic Language and Information","volume":"13 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2023-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138517874","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信
小红书