Bulletin of Symbolic Logic最新文献_第10页

Corrigendum to “Incompleteness in a General Setting” “一般设置中的不完整性”的勘误表

IF 0.6 3区数学

Bulletin of Symbolic Logic Pub Date : 2008-03-01 DOI: 10.2178/BSL/1208358848

J. Bell

引用次数: 0

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

引用次数: 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

引用次数: 38

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":"14 1","pages":"119 - 121"},"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

Logicality and Invariance 逻辑性和不变性

IF 0.6 3区数学

Bulletin of Symbolic Logic Pub Date : 2008-03-01 DOI: 10.2178/bsl/1208358843

D. Bonnay

引用次数: 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

引用次数: 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":"14 1","pages":"99 - 113"},"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

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

引用次数: 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

引用次数: 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ý

引用次数: 20