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

Logic, Computation, Hierarchies最新文献

筛选
英文 中文
On the Equivalence of Paraconsistent and Explsive Versions of Nelson Logic 论纳尔逊逻辑的副相容版本与爆炸版本的等价性
Logic, Computation, Hierarchies Pub Date : 2014-07-28 DOI: 10.1515/9781614518044.259
S. Odintsov
{"title":"On the Equivalence of Paraconsistent and Explsive Versions of Nelson Logic","authors":"S. Odintsov","doi":"10.1515/9781614518044.259","DOIUrl":"https://doi.org/10.1515/9781614518044.259","url":null,"abstract":"","PeriodicalId":359337,"journal":{"name":"Logic, Computation, Hierarchies","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132678962","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
Logic, Computation, Hierarchies 逻辑，计算，层次结构
Logic, Computation, Hierarchies Pub Date : 2014-01-28 DOI: 10.1515/9781614518044
V. Brattka, H. Diener, D. Spreen
{"title":"Logic, Computation, Hierarchies","authors":"V. Brattka, H. Diener, D. Spreen","doi":"10.1515/9781614518044","DOIUrl":"https://doi.org/10.1515/9781614518044","url":null,"abstract":"Published in honor of Victor L. Selivanov, the 17 articles collected in this volume inform on the latest developments in computability theory and its applications in computable analysis; descriptive set theory and topology; and the theory of omega-languages; as well as non-classical logics, such as temporal logic and paraconsistent logic. This volume will be of interest to mathematicians and logicians, as well as theoretical computer scientists.","PeriodicalId":359337,"journal":{"name":"Logic, Computation, Hierarchies","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121434680","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
Levels of discontinuity, limit-computability, and jump operators 不连续级别、极限可计算性和跳转操作符
Logic, Computation, Hierarchies Pub Date : 2013-12-01 DOI: 10.1515/9781614518044.79
Matthew de Brecht
{"title":"Levels of discontinuity, limit-computability, and jump operators","authors":"Matthew de Brecht","doi":"10.1515/9781614518044.79","DOIUrl":"https://doi.org/10.1515/9781614518044.79","url":null,"abstract":"We develop a general theory of jump operators, which is intended to provide an abstraction of the notion of \"limit-computability\" on represented spaces. Jump operators also provide a framework with a strong categorical flavor for investigating degrees of discontinuity of functions and hierarchies of sets on represented spaces. We will provide a thorough investigation within this framework of a hierarchy of $Delta^0_2$-measurable functions between arbitrary countably based $T_0$-spaces, which captures the notion of computing with ordinal mind-change bounds. Our abstract approach not only raises new questions but also sheds new light on previous results. For example, we introduce a notion of \"higher order\" descriptive set theoretical objects, we generalize a recent characterization of the computability theoretic notion of \"lowness\" in terms of adjoint functors, and we show that our framework encompasses ordinal quantifications of the non-constructiveness of Hilbert's finite basis theorem.","PeriodicalId":359337,"journal":{"name":"Logic, Computation, Hierarchies","volume":"175 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115321951","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}
引用次数: 30
Computing Clebsch-Gordan Matrices with Applications in Elasticity Theory 计算Clebsch-Gordan矩阵及其在弹性理论中的应用
Logic, Computation, Hierarchies Pub Date : 2013-05-11 DOI: 10.1515/9781614518044.273
S. Selivanova
{"title":"Computing Clebsch-Gordan Matrices with Applications in Elasticity Theory","authors":"S. Selivanova","doi":"10.1515/9781614518044.273","DOIUrl":"https://doi.org/10.1515/9781614518044.273","url":null,"abstract":"We provide an algorithm of computing Clebsch-Gordan coefficients for irreducible representations, with integer weights, of the rotation group SO(3) and demonstrate the convenience of this algorithm for constructing new (to our knowledge) models in anisotropic elasticity theory.","PeriodicalId":359337,"journal":{"name":"Logic, Computation, Hierarchies","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122704390","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}
引用次数: 6
Lipschitz and uniformly continuous Reducibilities on Ultrametric polish spaces 超度量抛光空间上的Lipschitz和一致连续约约性
Logic, Computation, Hierarchies Pub Date : 2013-02-06 DOI: 10.1515/9781614518044.213
L. Ros, Philipp Schlicht
{"title":"Lipschitz and uniformly continuous Reducibilities on Ultrametric polish spaces","authors":"L. Ros, Philipp Schlicht","doi":"10.1515/9781614518044.213","DOIUrl":"https://doi.org/10.1515/9781614518044.213","url":null,"abstract":"We analyze the reducibilities induced by, respectively, uniformly continuous, Lipschitz, and nonexpansive functions on arbitrary ultrametric Polish spaces, and determine whether under suitable set-theoretical assumptions the induced degree-structures are well-behaved.","PeriodicalId":359337,"journal":{"name":"Logic, Computation, Hierarchies","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116990334","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}
引用次数: 6
The wadge hierarchy of Petri Nets ω-languages Petri网ω-语言的工资等级
Logic, Computation, Hierarchies Pub Date : 2013-01-06 DOI: 10.1515/9781614518044.109
J. Duparc, O. Finkel, J. Ressayre
{"title":"The wadge hierarchy of Petri Nets ω-languages","authors":"J. Duparc, O. Finkel, J. Ressayre","doi":"10.1515/9781614518044.109","DOIUrl":"https://doi.org/10.1515/9781614518044.109","url":null,"abstract":"We describe the Wadge hierarchy of the ω-languages recognized by deterministic Petri nets. This is an extension of the celebrated Wagner hierarchy which turned out to be the Wadge hierarchy of the ω-regular languages. Petri nets are an improvement of automata. They may be defined as partially blind multi-counter automata. We show that the whole hierarchy has height (omega^{omega^2}), and give a description of the restrictions of this hierarchy to every fixed number of partially blind counters.","PeriodicalId":359337,"journal":{"name":"Logic, Computation, Hierarchies","volume":"797 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116180518","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}
引用次数: 13
Complexity issues for Preorders on finite labeled forests 有限标记森林预购的复杂性问题
Logic, Computation, Hierarchies Pub Date : 2011-06-27 DOI: 10.1515/9781614518044.165
P. Hertling, V. Selivanov
{"title":"Complexity issues for Preorders on finite labeled forests","authors":"P. Hertling, V. Selivanov","doi":"10.1515/9781614518044.165","DOIUrl":"https://doi.org/10.1515/9781614518044.165","url":null,"abstract":"We prove that three preorders on the finite k-labeled forests are polynomial time computable. Together with an earlier result of the first author, this implies polynomial-time computability for an important initial segment of the corresponding degrees of discontinuity of k- partitions on the Baire space. Furthermore, we show that on ω-labeled forests the first of these three preorders is polynomial time computable as well while the other two preorders are NP-complete.","PeriodicalId":359337,"journal":{"name":"Logic, Computation, Hierarchies","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120957023","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
The completeness of isomorphism 同构的完备性
Logic, Computation, Hierarchies Pub Date : 1900-01-01 DOI: 10.1515/9781614518044.157
S. Friedman
{"title":"The completeness of isomorphism","authors":"S. Friedman","doi":"10.1515/9781614518044.157","DOIUrl":"https://doi.org/10.1515/9781614518044.157","url":null,"abstract":"In classical descriptive set theory, analytic equivalence relations (i.e., Σ1 equivalence relations with parameters) are compared under the relation of Borel reducibility (for example, see [5]). An important subclass of the Σ1 equivalence relations are the isomorphism relations, i.e., the restrictions of the isomorphism relation on countable structures (viewed as an equivalence relation on reals coding such structures) to the models of a sentence of the infinitary logic Lω1ω. Scott’s Theorem implies that the equivalence classes of any isomorphism relation are Borel, and therefore no isomorphism relation can be complete (under Borel reducibility) within the class of Σ1 equivalence relations as a whole, some of which contain non-Borel equivalence classes. (This is clarified below.)","PeriodicalId":359337,"journal":{"name":"Logic, Computation, Hierarchies","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124507686","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
Boolean algebras of regular quasi-aperiodic languages 正则拟非周期语言的布尔代数
Logic, Computation, Hierarchies Pub Date : 1900-01-01 DOI: 10.1515/9781614518044.191
A. Konovalov
{"title":"Boolean algebras of regular quasi-aperiodic languages","authors":"A. Konovalov","doi":"10.1515/9781614518044.191","DOIUrl":"https://doi.org/10.1515/9781614518044.191","url":null,"abstract":"We characterize up to isomorphism the Boolean algebras of regular quasi-aperiodic languages and of regular d-quasi-aperiodic languages, and show decidability of classes of languages related to these characterizations.","PeriodicalId":359337,"journal":{"name":"Logic, Computation, Hierarchies","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130148921","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 simple indeterminate infinite game 一个简单的不确定无限游戏
Logic, Computation, Hierarchies Pub Date : 1900-01-01 DOI: 10.1515/9781614518044.205
Eryk Kopczynski, D. Niwinski
{"title":"A simple indeterminate infinite game","authors":"Eryk Kopczynski, D. Niwinski","doi":"10.1515/9781614518044.205","DOIUrl":"https://doi.org/10.1515/9781614518044.205","url":null,"abstract":"","PeriodicalId":359337,"journal":{"name":"Logic, Computation, Hierarchies","volume":"158 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124545575","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}
引用次数: 4
下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信