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

J. Log. Comput.最新文献

筛选
英文 中文
Effective aspects of Bernoulli randomness 伯努利随机性的有效方面
J. Log. Comput. Pub Date : 2019-03-22 DOI: 10.1093/logcom/exz021
Christopher P. Porter
{"title":"Effective aspects of Bernoulli randomness","authors":"Christopher P. Porter","doi":"10.1093/logcom/exz021","DOIUrl":"https://doi.org/10.1093/logcom/exz021","url":null,"abstract":"\u0000 In this paper, we study Bernoulli random sequences, i.e. sequences that are Martin-Löf random with respect to a Bernoulli measure $mu _p$ for some $pin [0,1]$, where we allow for the possibility that $p$ is noncomputable. We focus in particular on the case in which the underlying Bernoulli parameter $p$ is proper (i.e. Martin-Löf random with respect to some computable measure). We show for every Bernoulli parameter $p$, if there is a sequence that is both proper and Martin-Löf random with respect to $mu _p$, then $p$ itself must be proper, and explore further consequences of this result. We also study the Turing degrees of Bernoulli random sequences, showing, for instance, that the Turing degrees containing a Bernoulli random sequence do not coincide with the Turing degrees containing a Martin-Löf random sequence. Lastly, we consider several possible approaches to characterizing blind Bernoulli randomness, where the corresponding Martin-Löf tests do not have access to the Bernoulli parameter $p$, and show that these fail to characterize blind Bernoulli randomness.","PeriodicalId":398763,"journal":{"name":"J. Log. Comput.","volume":"158 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132388644","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Structured argumentation with prioritized conditional obligations and permissions 具有优先级条件义务和权限的结构化论证
J. Log. Comput. Pub Date : 2019-03-06 DOI: 10.1093/logcom/exy005
Mathieu Beirlaen, J. Heyninck, Christian Straßer
{"title":"Structured argumentation with prioritized conditional obligations and permissions","authors":"Mathieu Beirlaen, J. Heyninck, Christian Straßer","doi":"10.1093/logcom/exy005","DOIUrl":"https://doi.org/10.1093/logcom/exy005","url":null,"abstract":"We present a formal argumentation system for dealing with the detachment of prioritized conditional obligations and permissions. In the presence of facts and constraints, we answer the question whether an unconditional obligation or permission is detachable by considering arguments for and against its detachment. For the evaluation of arguments in favour of detachment, we use a Dung-style argumentation-theoretical semantics. We illustrate how violations and contrary-to-duty scenarios are dealt with in our framework and pay special attention to conflict-resolution via priorities.","PeriodicalId":398763,"journal":{"name":"J. Log. Comput.","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130620271","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
Enriching deontic logic 丰富道义逻辑
J. Log. Comput. Pub Date : 2019-03-06 DOI: 10.1093/logcom/exy007
Ilaria Canavotto, A. Giordani
{"title":"Enriching deontic logic","authors":"Ilaria Canavotto, A. Giordani","doi":"10.1093/logcom/exy007","DOIUrl":"https://doi.org/10.1093/logcom/exy007","url":null,"abstract":"It is well-known that systems of action deontic logic emerging from a standard analysis of permission in terms of possibility of doing an action without incurring in a violation of the law are subject to paradoxes. In general, paradoxes are acknowledged as such if we have intuitions telling us that things should be different. The aim of this paper is to introduce a paradox-free deontic action system by (i) identifying the basic intuitions leading to the emergence of the paradoxes and (ii) exploiting these intuitions in order to develop a consistent deontic framework, where it can be shown why some phenomena seem to be paradoxical and why they are not so if interpreted in a correct way.","PeriodicalId":398763,"journal":{"name":"J. Log. Comput.","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123465474","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
A temporal dynamic deontic logic 时间动态道义逻辑
J. Log. Comput. Pub Date : 2019-03-06 DOI: 10.1093/logcom/exy008
F. Ju, J. Eijck
{"title":"A temporal dynamic deontic logic","authors":"F. Ju, J. Eijck","doi":"10.1093/logcom/exy008","DOIUrl":"https://doi.org/10.1093/logcom/exy008","url":null,"abstract":"textabstractThis paper presents a formalization of refraining from actions and a deontic logic based on a process logic. The notion of refraining is needed to handle obligated actions. To refrain to do an action is to do something else. The process logic used is a mix of dynamic logic and temporal logic: actions in it are interpreted as sets of paths and temporal formulas describe the process of performing actions. The deontic logic has a temporal propositional constant saying that a bad thing will be done in the next moment. Normative properties of actions can be defined according to what happens in the process of performing actions.","PeriodicalId":398763,"journal":{"name":"J. Log. Comput.","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114501474","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Coarse deontic logic 粗糙道义逻辑
J. Log. Comput. Pub Date : 2019-03-06 DOI: 10.1093/logcom/exy010
F. Putte
{"title":"Coarse deontic logic","authors":"F. Putte","doi":"10.1093/logcom/exy010","DOIUrl":"https://doi.org/10.1093/logcom/exy010","url":null,"abstract":"Cariani [7] has proposed a semantics for ought that combines two features: (i) it invalidates Inheritance in a principled manner; (ii) it allows for coarseness, which means that ought(φ) can be true even if there are specific ways of making φ true that are (intuitively speaking) impermissible. We present a family of multi-modal logics based on Cariani’s proposal and a more recent critique by Bronfmann&Dowell [4]. We study their formal properties in detail and show how they can be translated into normal multi-modal logics. Using well-known techniques, we establish a sound and (strongly) complete axiomatization for each of these and show them to satisfy the finite model property. In addition, we compare them to existing approaches in the deontic logic literature — most notably Anglberger et al.’s logic of obligation as weakest permission and Horty’s deontic stit logic.","PeriodicalId":398763,"journal":{"name":"J. Log. Comput.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125691900","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
|MTL|-algebras as rotations of basic hoops 基本环的旋转代数
J. Log. Comput. Pub Date : 2019-03-05 DOI: 10.1093/LOGCOM/EXZ005
P. Aglianó, S. Ugolini
{"title":"|MTL|-algebras as rotations of basic hoops","authors":"P. Aglianó, S. Ugolini","doi":"10.1093/LOGCOM/EXZ005","DOIUrl":"https://doi.org/10.1093/LOGCOM/EXZ005","url":null,"abstract":"\u0000 In this paper, we use the generalize d rotation construction to lift results from the lattice of subvarieties of basic hoops to some parts of the lattice of subvarieties of monoidal t-norm based logic-algebras. In particular, we study splitting algebras for (the lattice of subvarieties of) varieties generated by generalized rotations of basic hoops and relevant subvarieties such as Wajsberg hoops, cancellative hoops and Gödel hoops. Finally, we show that the generalized rotation construction preserves the amalgamation property.","PeriodicalId":398763,"journal":{"name":"J. Log. Comput.","volume":"172 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116309482","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
Editorial Reasons, argumentation and justification: DEON 2016 special issue 编辑理由、论证与辩护:DEON 2016年特刊
J. Log. Comput. Pub Date : 2019-03-01 DOI: 10.1093/logcom/exy006
O. Roy, A. Tamminga, Malte Willer
{"title":"Editorial Reasons, argumentation and justification: DEON 2016 special issue","authors":"O. Roy, A. Tamminga, Malte Willer","doi":"10.1093/logcom/exy006","DOIUrl":"https://doi.org/10.1093/logcom/exy006","url":null,"abstract":"Special issue of the *Journal of Logic and Computation*, edited by Olivier Roy, Allard Tamminga and Malte Willer","PeriodicalId":398763,"journal":{"name":"J. Log. Comput.","volume":"129 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124653877","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Pseudo-BCI algebras with derivations 带导数的伪bci代数
J. Log. Comput. Pub Date : 2019-02-26 DOI: 10.1093/logcom/exz027
L. Ciungu
{"title":"Pseudo-BCI algebras with derivations","authors":"L. Ciungu","doi":"10.1093/logcom/exz027","DOIUrl":"https://doi.org/10.1093/logcom/exz027","url":null,"abstract":"In this paper we define two types of implicative derivations on pseudo-BCI algebras, we investigate their properties and we give a characterization of regular implicative derivations of type II. We also define the notion of a $d$-invariant deductive system of a pseudo-BCI algebra $A$ proving that $d$ is a regular derivation of type II if and only if every deductive system on $A$ is $d$-invariant. It is proved that a pseudo-BCI algebra is $p$-semisimple if and only if the only regular derivation of type II is the identity map. Another main result consists of proving that the set of all implicative derivations of a $p$-semisimple pseudo-BCI algebra forms a commutative monoid with respect to function composition. Two types of symmetric derivations on pseudo-BCI algebras are also introduced and it is proved that in the case of $p$-semisimple pseudo-BCI algebras the sets of type II implicative derivations and type II symmetric derivations are equal.","PeriodicalId":398763,"journal":{"name":"J. Log. Comput.","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124699430","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Order polarities 极性顺序
J. Log. Comput. Pub Date : 2019-01-15 DOI: 10.1093/logcom/exaa024
R. Egrot
{"title":"Order polarities","authors":"R. Egrot","doi":"10.1093/logcom/exaa024","DOIUrl":"https://doi.org/10.1093/logcom/exaa024","url":null,"abstract":"\u0000 We define an order polarity to be a polarity $(X,Y,{operatorname{R}})$ where $X$ and $Y$ are partially ordered, and we define an extension polarity to be a triple $(e_X,e_Y,{operatorname{R}})$ such that $e_X:Pto X$ and $e_Y:Pto Y$ are poset extensions and $(X,Y,{operatorname{R}})$ is an order polarity. We define a hierarchy of increasingly strong coherence conditions for extension polarities, each equivalent to the existence of a preorder structure on $Xcup Y$ such that the natural embeddings, $iota _X$ and $iota _Y$, of $X$ and $Y$, respectively, into $Xcup Y$ preserve the order structures of $X$ and $Y$ in increasingly strict ways. We define a Galois polarity to be an extension polarity satisfying the strongest of these coherence conditions and where $e_X$ and $e_Y$ are meet- and join-extensions, respectively. We show that for such polarities the corresponding preorder on $Xcup Y$ is unique. We define morphisms for polarities, providing the class of Galois polarities with the structure of a category, and we define an adjunction between this category and the category of $varDelta _1$-completions and appropriate homomorphisms.","PeriodicalId":398763,"journal":{"name":"J. Log. Comput.","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130284329","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Commands changing obligations 1 命令变更义务1
J. Log. Comput. Pub Date : 2018-12-01 DOI: 10.1093/logcom/exv025
F. Ju, Li Liang
{"title":"Commands changing obligations 1","authors":"F. Ju, Li Liang","doi":"10.1093/logcom/exv025","DOIUrl":"https://doi.org/10.1093/logcom/exv025","url":null,"abstract":"","PeriodicalId":398763,"journal":{"name":"J. Log. Comput.","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127518669","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"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学术官方微信
小红书