Bulletin of Symbolic Logic最新文献

筛选
英文 中文
BSL volume 14 issue 1 Cover and Back matter BSL第14卷第1期封面和封底
IF 0.6 3区 数学
Bulletin of Symbolic Logic Pub Date : 2008-03-01 DOI: 10.1017/s107989860000963x
{"title":"BSL volume 14 issue 1 Cover and Back matter","authors":"","doi":"10.1017/s107989860000963x","DOIUrl":"https://doi.org/10.1017/s107989860000963x","url":null,"abstract":"","PeriodicalId":55307,"journal":{"name":"Bulletin of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2008-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1017/s107989860000963x","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"57315785","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
On the Computational Complexity of the Numerically Definite Syllogistic and Related Logics 论数值确定三段论及相关逻辑的计算复杂度
IF 0.6 3区 数学
Bulletin of Symbolic Logic Pub Date : 2008-03-01 DOI: 10.2178/bsl/1208358842
Ian Pratt-Hartmann
{"title":"On the Computational Complexity of the Numerically Definite Syllogistic and Related Logics","authors":"Ian Pratt-Hartmann","doi":"10.2178/bsl/1208358842","DOIUrl":"https://doi.org/10.2178/bsl/1208358842","url":null,"abstract":"Abstract The numerically definite syllogistic is the fragment of English obtained by extending the language of the classical syllogism with numerical quantifiers. The numerically definite relational syllogistic is the fragment of English obtained by extending the numerically definite syllogistic with predicates involving transitive verbs. This paper investigates the computational complexity of the satisfiability problem for these fragments. We show that the satisfiability problem (= finite satisfiability problem) for the numerically definite syllogistic is strongly NP-complete, and that the satisfiability problem (= finite satisfiability problem) for the numerically definite relational syllogistic is NEXPTIME-complete, but perhaps not strongly so. We discuss the related problem of probabilistic (propositional) satisfiability, and thereby demonstrate the incompleteness of some proof-systems that have been proposed for the numerically definite syllogistic.","PeriodicalId":55307,"journal":{"name":"Bulletin of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2008-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.2178/bsl/1208358842","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"68345248","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}
引用次数: 38
Logicality and Invariance 逻辑性和不变性
IF 0.6 3区 数学
Bulletin of Symbolic Logic Pub Date : 2008-03-01 DOI: 10.2178/bsl/1208358843
D. Bonnay
{"title":"Logicality and Invariance","authors":"D. Bonnay","doi":"10.2178/bsl/1208358843","DOIUrl":"https://doi.org/10.2178/bsl/1208358843","url":null,"abstract":"Abstract This paper deals with the problem of giving a principled characterization of the class of logical constants. According to the so-called Tarski–Sher thesis, an operation is logical iff it is invariant under permutation. In the model-theoretic tradition, this criterion has been widely accepted as giving a necessary condition for an operation to be logical. But it has been also widely criticized on the account that it counts too many operations as logical, failing thus to provide a sufficient condition. Our aim is to solve this problem of overgeneration by modifying the invariance criterion. We introduce a general notion of invariance under a similarity relation and present the connection between similarity relations and classes of invariant operations. The next task is to isolate a similarity relation well-suited for a definition of logicality. We argue that the standard arguments in favor of invariance under permutation, which rely on the generality and the formality of logic, should be modified. The revised arguments are shown to support an alternative to Tarski's criterion, according to which an operation is logical iff it is invariant under potential isomorphism.","PeriodicalId":55307,"journal":{"name":"Bulletin of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2008-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.2178/bsl/1208358843","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"68345295","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}
引用次数: 90
The Complexity of Orbits of Computably Enumerable Sets 可计算可枚举集轨道的复杂性
IF 0.6 3区 数学
Bulletin of Symbolic Logic Pub Date : 2008-03-01 DOI: 10.2178/bsl/1208358844
Peter A. Cholak, R. Downey, L. Harrington
{"title":"The Complexity of Orbits of Computably Enumerable Sets","authors":"Peter A. Cholak, R. Downey, L. Harrington","doi":"10.2178/bsl/1208358844","DOIUrl":"https://doi.org/10.2178/bsl/1208358844","url":null,"abstract":"Abstract The goal of this paper is to announce there is a single orbit of the c.e. sets with inclusion, ε, such that the question of membership in this orbit is complete. This result and proof have a number of nice corollaries: the Scott rank of ε is + 1; not all orbits are elementarily definable; there is no arithmetic description of all orbits of ε; for all finite α ≥ 9, there is a properly orbit (from the proof).","PeriodicalId":55307,"journal":{"name":"Bulletin of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2008-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"68345346","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}
引用次数: 3
Forcing Axioms, Supercompact Cardinals, Singular Cardinal Combinatorics 强迫公理,超紧基数,奇异基数组合
IF 0.6 3区 数学
Bulletin of Symbolic Logic Pub Date : 2008-03-01 DOI: 10.2178/bsl/1208358846
M. Viale
{"title":"Forcing Axioms, Supercompact Cardinals, Singular Cardinal Combinatorics","authors":"M. Viale","doi":"10.2178/bsl/1208358846","DOIUrl":"https://doi.org/10.2178/bsl/1208358846","url":null,"abstract":"The purpose of this communication is to present some recent advances on the consequences that forcing axioms and large cardinals have on the combinatorics of singular cardinals. I will introduce a few examples of problems in singular cardinal combinatorics which can be fruitfully attacked using ideas and techniques coming from the theory of forcing axioms and then translate the results so obtained in suitable large cardinals properties. The first example I will treat is the proof that the proper forcing axiom PFA implies the singular cardinal hypothesis SCH, this will easily lead to a new proof of Solovay's theorem that SCH holds above a strongly compact cardinal. I will also outline how some of the ideas involved in these proofs can be used as means to evaluate the “saturation” properties of models of strong forcing axioms like MM or PFA. The second example aims to show that the transfer principle (ℵω+1, ℵω) ↠ (ℵ2, ℵ1) fails assuming Martin's Maximum MM. Also in this case the result can be translated in a large cardinal property, however this requires a familiarity with a rather large fragment of Shelah's pcf-theory. Only sketchy arguments will be given, the reader is referred to the forthcoming [25] and [38] for a thorough analysis of these problems and for detailed proofs.","PeriodicalId":55307,"journal":{"name":"Bulletin of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2008-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.2178/bsl/1208358846","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"68346013","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}
引用次数: 1
Truth and games: Essays in honour of Gabriel Sandu. edited by Tuomo Aho and Ahti-Veikko Pietarinen, Acta Philosophica Fennica, vol. 78. Societas Philosophica Fennica, Helsinki, 2006, vi + 322 pp. 真理与游戏:纪念加布里埃尔·桑杜的散文。托莫·阿霍和阿提·维克科·皮特里宁主编,《芬尼察哲学学报》,第78卷。芬兰哲学学会,赫尔辛基,2006年,第六卷,第322页。
IF 0.6 3区 数学
Bulletin of Symbolic Logic Pub Date : 2008-03-01 DOI: 10.1017/S1079898600001888
A. Urquhart
{"title":"Truth and games: Essays in honour of Gabriel Sandu. edited by Tuomo Aho and Ahti-Veikko Pietarinen, Acta Philosophica Fennica, vol. 78. Societas Philosophica Fennica, Helsinki, 2006, vi + 322 pp.","authors":"A. Urquhart","doi":"10.1017/S1079898600001888","DOIUrl":"https://doi.org/10.1017/S1079898600001888","url":null,"abstract":"but they are always thought provoking. In the reviewer’s opinion, the most glaring omission in the choice of topics in the text is the absence of any material on computability theory and incompleteness theorems. Of course there is only so much one can accomplish during a mere semester, and there is always the option of reaching for supplementary materials and texts, but I hope that the author would consider enriching the future editions of this text with a treatment of these two important topics. I wish to conclude this review with a brief discussion of Farsi logic textbooks in order to provide a background for thework reviewedhere. The firstmodern logic textbook inFarsiwas published in Iran more than half a century ago in 1955. It was authored by G. H. Mosaheb, a gifted and admirably tireless mathematician, educator, and man of letters. Thanks to the industry of Alonzo Church, the book was reviewed two years later inThe Journal of Symbolic Logic by none other than L. A. Zadeh, the founder of fuzzy logic; see JSL, vol. 22, no. 4 (Dec. 1957), pp. 354–355. The next series of notable mathematical logic texts to arrive on the Iranian scene were the Farsi translations of Enderton’s A Mathematical Introduction to Logic, and Hamilton’s Logic for Mathematicians, which appeared three decades later in the mid-1980’s and helped to introduce the subject to a new generation of students. In the early 1990’s Zia Movahed (an expert in philosophical logic, who is also well-known in Iran as a literary scholar and poet) authored a respectable introductory textbook on modern logic, and more recently (2002) he published a substantial textbook on modal logic, both of which will hopefully be reviewed by BSL in the near future. Ali Enayat Department of Mathematics and Statistics, 4400 Mass. Ave. NW, American University, Washington, DC 20016-8050, USA. enayat@american.edu.","PeriodicalId":55307,"journal":{"name":"Bulletin of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2008-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1017/S1079898600001888","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"57303564","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}
引用次数: 7
14th Workshop on Logic, Language, Information and Computation (WoLLIC 2007) 第十四届逻辑、语言、信息与计算研讨会(WoLLIC 2007)
IF 0.6 3区 数学
Bulletin of Symbolic Logic Pub Date : 2008-03-01 DOI: 10.2178/BSL/1208358850
D. Leivant, Ruy J. G. B. de Queroz
{"title":"14th Workshop on Logic, Language, Information and Computation (WoLLIC 2007)","authors":"D. Leivant, Ruy J. G. B. de Queroz","doi":"10.2178/BSL/1208358850","DOIUrl":"https://doi.org/10.2178/BSL/1208358850","url":null,"abstract":"","PeriodicalId":55307,"journal":{"name":"Bulletin of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2008-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.2178/BSL/1208358850","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"68346454","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
The Complexity of Propositional Proofs 命题证明的复杂性
IF 0.6 3区 数学
Bulletin of Symbolic Logic Pub Date : 2007-12-01 DOI: 10.2178/bsl/1203350879
Nathan Segerlind
{"title":"The Complexity of Propositional Proofs","authors":"Nathan Segerlind","doi":"10.2178/bsl/1203350879","DOIUrl":"https://doi.org/10.2178/bsl/1203350879","url":null,"abstract":"Propositional proof complexity is the study of the sizes of propositional proofs, and more generally, the resources necessary to certify propositional tautologies. Questions about proof sizes have connections with computational complexity, theories of arithmetic, and satisfiability algorithms. This is article includes a broad survey of the field, and a technical exposition of some recently developed techniques for proving lower bounds on proof sizes.","PeriodicalId":55307,"journal":{"name":"Bulletin of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85010143","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}
引用次数: 79
Descriptive Set Theory of Families of Small Sets 小集合族的描述集合论
IF 0.6 3区 数学
Bulletin of Symbolic Logic Pub Date : 2007-12-01 DOI: 10.2178/bsl/1203350880
É. Matheron, M. Zelený
{"title":"Descriptive Set Theory of Families of Small Sets","authors":"É. Matheron, M. Zelený","doi":"10.2178/bsl/1203350880","DOIUrl":"https://doi.org/10.2178/bsl/1203350880","url":null,"abstract":"This is a survey paper on the descriptive set theory of hereditary families of closed sets in Polish spaces. Most of the paper is devoted to ideals and σ-ideals of closed or compact sets.","PeriodicalId":55307,"journal":{"name":"Bulletin of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77150004","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}
引用次数: 20
S. Awodey. Category theory. Oxford Logic Guides, vol. 49. Oxford Sciences Publications, Oxford, 2006, xi + 256 pp. 美国Awodey。范畴理论。《牛津逻辑指南》第49卷。牛津科学出版社,2006,11 + 256页。
IF 0.6 3区 数学
Bulletin of Symbolic Logic Pub Date : 2007-09-01 DOI: 10.1017/S1079898600002134
J. Rosický
{"title":"S. Awodey. Category theory. Oxford Logic Guides, vol. 49. Oxford Sciences Publications, Oxford, 2006, xi + 256 pp.","authors":"J. Rosický","doi":"10.1017/S1079898600002134","DOIUrl":"https://doi.org/10.1017/S1079898600002134","url":null,"abstract":"At the end of the book an extensive bibliography (50 pages!) is included. Its scope is broad: it includes items on topics like the history of logic, its various branches, its controversies and its relationships to other areas. First of all items that are readable and understandable for beginners have been chosen. Nonetheless one finds there also some highly technical but classical items. Except for a couple of important works that have not yet been translated only works available in English were included. The material was organized in seven sections: general material, history of logic, textbooks, beyond text (logic videos, software, interactive websites), interdisciplinary, individual figures and topics, others. Being aware that such an extensive bibliography may be not fully useful for many beginners, the author suggests also a list of eight fundamental works for them. The book was published in a very nice and careful way. In particular all Polish names are printed in a right way using all diacritical signs—what happens not so often. The rich variety of parts of logic covered in the book makes it useful both for specialists (especially logicians, not only philosophers but also mathematicians and computer scientists) looking for information in areas outside their subspecialties as well as for a non-professional reader, in particular students and generally laypersons. Roman Murawski Adam Mickiewicz University, Faculty of Mathematics and Computer Science, ul. Umultowska 87, 61–614 Poznań, Poland. rmur@amu.edu.pl.","PeriodicalId":55307,"journal":{"name":"Bulletin of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2007-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1017/S1079898600002134","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"57303803","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学术文献互助群
群 号:481959085
Book学术官方微信