J. Log. Comput.最新文献_第8页

The probabilistic logic of communication and change 交流和变化的概率逻辑

J. Log. Comput. Pub Date : 2019-12-20 DOI: 10.1093/LOGCOM/EXV084

Andreea Achimescu, A. Baltag, J. Sack

引用次数: 2

The power of modal separation logics 模态分离逻辑的威力

J. Log. Comput. Pub Date : 2019-12-10 DOI: 10.1093/logcom/exz019

Stephane Demri, Raul Fervari

引用次数: 9

A comparative analysis and improvement of MaxSAT encodings for coalition structure generation under MC-nets MC-nets下联盟结构生成MaxSAT编码的比较分析与改进

J. Log. Comput. Pub Date : 2019-12-02 DOI: 10.1093/LOGCOM/EXZ017

Xiaojuan Liao, M. Koshimura

引用次数: 0

A logic of hypothetical conjunction 假设连接的逻辑

J. Log. Comput. Pub Date : 2019-12-02 DOI: 10.1093/LOGCOM/EXZ018

M. Collinson

引用次数: 0

A logic of efficient and optimal designs 高效和最佳设计的逻辑

J. Log. Comput. Pub Date : 2019-12-02 DOI: 10.1093/logcom/exz014

G. Primiero

引用次数: 3

The Influence of the Test Operator on the Expressive Powers of PDL-Like Logics 测试算子对类pdl逻辑表达能力的影响

J. Log. Comput. Pub Date : 2019-12-01 DOI: 10.1093/logcom/exz020

Linh Anh Nguyen

引用次数: 0

Formula size games for modal logic and μ-calculus 模态逻辑和μ微积分的公式大小博弈

J. Log. Comput. Pub Date : 2019-12-01 DOI: 10.1093/logcom/exz025

L. Hella, Miikka Vilander

引用次数: 9

Open sets in computability theory and reverse mathematics 可计算理论和逆向数学中的开集

J. Log. Comput. Pub Date : 2019-10-06 DOI: 10.1093/logcom/exaa049

D. Normann, Sam Sanders

引用次数: 7

Self-full ceers and the uniform join operator 自满函数和统一连接算子

J. Log. Comput. Pub Date : 2019-09-20 DOI: 10.1093/logcom/exaa023

U. Andrews, N. Schweber, A. Sorbi

{"title":"Self-full ceers and the uniform join operator","authors":"U. Andrews, N. Schweber, A. Sorbi","doi":"10.1093/logcom/exaa023","DOIUrl":"https://doi.org/10.1093/logcom/exaa023","url":null,"abstract":"\u0000 A computably enumerable equivalence relation (ceer) $X$ is called self-full if whenever $f$ is a reduction of $X$ to $X$, then the range of $f$ intersects all $X$-equivalence classes. It is known that the infinite self-full ceers properly contain the dark ceers, i.e. the infinite ceers which do not admit an infinite computably enumerable transversal. Unlike the collection of dark ceers, which are closed under the operation of uniform join, we answer a question from [ 4] by showing that there are self-full ceers $X$ and $Y$ so that their uniform join $Xoplus Y$ is non-self-full. We then define and examine the hereditarily self-full ceers, which are the self-full ceers $X$ so that for any self-full $Y$, $Xoplus Y$ is also self-full: we show that they are closed under uniform join and that every non-universal degree in ${operatorname{textbf{Ceers}}}_{operatorname{{mathcal{I}}}}$ have infinitely many incomparable hereditarily self-full strong minimal covers. In particular, every non-universal ceer is bounded by a hereditarily self-full ceer. Thus, the hereditarily self-full ceers form a properly intermediate class in between the dark ceers and the infinite self-full ceers, which is closed under $oplus $.","PeriodicalId":398763,"journal":{"name":"J. Log. Comput.","volume":"506 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133817359","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

A Substructural Epistemic Resource Logic: Theory and Modelling Applications 子结构认知资源逻辑:理论与建模应用

J. Log. Comput. Pub Date : 2019-09-16 DOI: 10.1093/logcom/exz024

D. Galmiche, P. Kimmel, D. Pym

引用次数: 2