Bulletin of Symbolic Logic最新文献

筛选
英文 中文
Preservation of Structural Properties in intuitionistic Extensions of an Inference Relation 推理关系直觉扩展中结构性质的保存
IF 0.6 3区 数学
Bulletin of Symbolic Logic Pub Date : 2018-09-01 DOI: 10.1017/BSL.2017.26
Tor Sandqvist
{"title":"Preservation of Structural Properties in intuitionistic Extensions of an Inference Relation","authors":"Tor Sandqvist","doi":"10.1017/BSL.2017.26","DOIUrl":"https://doi.org/10.1017/BSL.2017.26","url":null,"abstract":"The article approaches cut elimination from a new angle. On the basis of an arbitrary inference relation among logically atomic formulae, an inference relation on a language possessing logical operators is defined by means of inductive clauses similar to the operator-introducing rules of a cut-free intuitionistic sequent calculus. The logical terminology of the richer language is not uniquely specified, but assumed to satisfy certain conditions of a general nature, allowing for, but not requiring, the existence of infinite conjunctions and disjunctions. We investigate to what extent structural properties of the given atomic relation are preserved through the extension to the full language. While closure under the Cut rule narrowly construed is not in general thus preserved, two properties jointly amounting to closure under the ordinary structural rules, including Cut, are.Attention is then narrowed down to the special case of a standard first-order language, where a similar result is obtained also for closure under substitution of terms for individual parameters. Taken together, the three preservation results imply the familiar cut-elimination theorem for pure first-order intuitionistic sequent calculus.In the interest of conceptual economy, all deducibility relations are specified purely inductively, rather than in terms of the existence of formal proofs of any kind.","PeriodicalId":55307,"journal":{"name":"Bulletin of Symbolic Logic","volume":"15 1","pages":"291-305"},"PeriodicalIF":0.6,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88313875","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}
引用次数: 2
Kurt Gödel's First Steps in Logic: Formal Proofs in Arithmetic and Set Theory through a System of Natural Deduction 库尔特Gödel逻辑的第一步:通过自然演绎系统的算术和集合论的形式证明
IF 0.6 3区 数学
Bulletin of Symbolic Logic Pub Date : 2018-09-01 DOI: 10.1017/BSL.2017.42
J. Plato
{"title":"Kurt Gödel's First Steps in Logic: Formal Proofs in Arithmetic and Set Theory through a System of Natural Deduction","authors":"J. Plato","doi":"10.1017/BSL.2017.42","DOIUrl":"https://doi.org/10.1017/BSL.2017.42","url":null,"abstract":"What seem to be Kurt Gödel’s first notes on logic, an exercise notebook of 84 pages, contains formal proofs in higher-order arithmetic and set theory. The choice of these topics is clearly suggested by their inclusion in Hilbert and Ackermann’s logic book of 1928, the Grundzüge der theoretischen Logik. Such proofs are notoriously hard to construct within axiomatic logic. Gödel takes without further ado into use a linear system of natural deduction for the full language of higher-order logic, with formal derivations closer to one hundred steps in length and up to four nested temporary assumptions with their scope indicated by vertical intermittent lines.","PeriodicalId":55307,"journal":{"name":"Bulletin of Symbolic Logic","volume":"55 1","pages":"319-335"},"PeriodicalIF":0.6,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80434226","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}
引用次数: 2
The Ramified analytical Hierarchy using Extended Logics 应用扩展逻辑的分支分析层次结构
IF 0.6 3区 数学
Bulletin of Symbolic Logic Pub Date : 2018-08-11 DOI: 10.1017/BSL.2018.69
P. Welch
{"title":"The Ramified analytical Hierarchy using Extended Logics","authors":"P. Welch","doi":"10.1017/BSL.2018.69","DOIUrl":"https://doi.org/10.1017/BSL.2018.69","url":null,"abstract":"The use of Extended Logics to replace ordinary second order definability in Kleene’s Ramified Analytical Hierarchy is investigated. This mirrors a similar investigation of Kennedy, Magidor and Väänänen [11] where Gödel’s universe L of constructible sets is subjected to similar variance. Enhancing second order definability allows models to be defined which may or may not coincide with the original Kleene hierarchy in domain. Extending the logic with game quantifiers, and assuming strong axioms of infinity, we obtain minimal correct models of analysis. A wide spectrum of models can be so generated from abstract definability notions: one may take an abstract Spector Class and extract an extended logic for it. The resultant structure is then a minimal model of the given kind of definability.","PeriodicalId":55307,"journal":{"name":"Bulletin of Symbolic Logic","volume":"23 1","pages":"306-318"},"PeriodicalIF":0.6,"publicationDate":"2018-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83884846","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
A Hierarchy of computably Enumerable Degrees 可计算可枚举度的层次结构
IF 0.6 3区 数学
Bulletin of Symbolic Logic Pub Date : 2018-03-01 DOI: 10.1017/BSL.2017.41
R. Downey, Noam Greenberg
{"title":"A Hierarchy of computably Enumerable Degrees","authors":"R. Downey, Noam Greenberg","doi":"10.1017/BSL.2017.41","DOIUrl":"https://doi.org/10.1017/BSL.2017.41","url":null,"abstract":"We introduce a new hierarchy of computably enumerable degrees. This hierarchy is based on computable ordinal notations measuring complexity of approximation of ∆2 functions. The hierarchy unifies and classifies the combinatorics of a number of diverse constructions in computability theory. It does so along the lines of the high degrees (Martin) and the array noncomputable degrees (Downey, Jocksuch and Stob). The hierarchy also gives a number of natural definability results in the c.e. degrees, including a definable","PeriodicalId":55307,"journal":{"name":"Bulletin of Symbolic Logic","volume":"41 1","pages":"53-89"},"PeriodicalIF":0.6,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80048800","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}
引用次数: 4
Alexander Razborov, Flag algebras. Journal of Symbolic Logic, vol. 72 (2007), no. 4, pp. 1239-1282 Alexander Razborov,旗代数。符号逻辑学报,vol. 72 (2007), no。4,第1239-1282页
IF 0.6 3区 数学
Bulletin of Symbolic Logic Pub Date : 2018-01-01 DOI: 10.1017/bsl.2018.11
J. Cummings
{"title":"Alexander Razborov, Flag algebras. Journal of Symbolic Logic, vol. 72 (2007), no. 4, pp. 1239-1282","authors":"J. Cummings","doi":"10.1017/bsl.2018.11","DOIUrl":"https://doi.org/10.1017/bsl.2018.11","url":null,"abstract":"","PeriodicalId":55307,"journal":{"name":"Bulletin of Symbolic Logic","volume":"74 1","pages":"107-108"},"PeriodicalIF":0.6,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78102250","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
Polymorphism and the obstinate circularity of second order logic: a victims' tale 多态性和二阶逻辑的顽固循环:一个受害者的故事
IF 0.6 3区 数学
Bulletin of Symbolic Logic Pub Date : 2017-10-27 DOI: 10.1017/bsl.2017.43
Paolo Pistone
{"title":"Polymorphism and the obstinate circularity of second order logic: a victims' tale","authors":"Paolo Pistone","doi":"10.1017/bsl.2017.43","DOIUrl":"https://doi.org/10.1017/bsl.2017.43","url":null,"abstract":"The investigations on higher-order type theories and on the related notion of parametric polymorphism constitute the technical counterpart of the old foundational problem of the circularity (or impredicativity) of second and higher order logic. However, the epistemological significance of such investigations, and of their often non trivial results, has not received much attention in the contemporary foundational debate. The results recalled in this paper suggest that the question of the circularity of second order logic cannot be reduced to the simple assessment of a vicious circle. Through a comparison between the faulty consistency arguments given by Frege and Martin-L\"of, respectively for the logical system of the Grundgesetze (shown inconsistent by Russell's paradox) and for the intuitionistic type theory with a type of all types (shown inconsistent by Girard's paradox), and the normalization argument for second order type theory (or System F), we indicate a bunch of subtle mathematical problems and logical concepts hidden behind the hazardous idea of impredicative quantification, constituting a vast (and largely unexplored) domain for foundational research.","PeriodicalId":55307,"journal":{"name":"Bulletin of Symbolic Logic","volume":"65 1","pages":"1-52"},"PeriodicalIF":0.6,"publicationDate":"2017-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86060425","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}
引用次数: 5
A Constructive Examination of a Russell-Style Ramified Type Theory 罗素式分支类型理论的建构性检验
IF 0.6 3区 数学
Bulletin of Symbolic Logic Pub Date : 2017-04-22 DOI: 10.1017/bsl.2018.4
Erik Palmgren
{"title":"A Constructive Examination of a Russell-Style Ramified Type Theory","authors":"Erik Palmgren","doi":"10.1017/bsl.2018.4","DOIUrl":"https://doi.org/10.1017/bsl.2018.4","url":null,"abstract":"In this paper we examine the natural interpretation of a ramified type hierarchy into Martin-L\"of type theory with an infinite sequence of universes. It is shown that under this predicative interpretation some useful special cases of Russell's reducibility axiom are valid, namely functional reducibility. This is sufficient to make the type hierarchy usable for development of constructive mathematics. We present a ramified type theory suitable for this purpose. One may regard the results of this paper as an alternative solution to the problems of Russell's theory, which avoids impredicativity, but instead imposes constructive logic. The intuitionistic ramified type theory introduced here, also suggests that there is a natural associated notion of predicative elementary topos.","PeriodicalId":55307,"journal":{"name":"Bulletin of Symbolic Logic","volume":"70 1","pages":"90-106"},"PeriodicalIF":0.6,"publicationDate":"2017-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86320932","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}
引用次数: 5
In Search of ultimate-l the 19th Midrasha Mathematicae Lectures 追寻终极——第19届米德拉夏数学讲座
IF 0.6 3区 数学
Bulletin of Symbolic Logic Pub Date : 2017-03-01 DOI: 10.1017/BSL.2016.34
W. Woodin
{"title":"In Search of ultimate-l the 19th Midrasha Mathematicae Lectures","authors":"W. Woodin","doi":"10.1017/BSL.2016.34","DOIUrl":"https://doi.org/10.1017/BSL.2016.34","url":null,"abstract":"We give a fairly complete account which first shows that the solution to the inner model problem for one supercompact cardinal will yield an ultimate version of L and then shows that the various current approaches to inner model theory must be fundamentally altered to provide that solution.","PeriodicalId":55307,"journal":{"name":"Bulletin of Symbolic Logic","volume":"107 1","pages":"1-109"},"PeriodicalIF":0.6,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81181982","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}
引用次数: 58
G.O. Jones and A.J. Wilkie, editors, O-Minimality and Diophantine Geometry. London Mathematical Society Lecture Note Series, vol. 421, Cambridge University Press, 2015. xii + 221 pp
IF 0.6 3区 数学
Bulletin of Symbolic Logic Pub Date : 2017-03-01 DOI: 10.1017/BSL.2017.3
Antoine Chambert-Loir
{"title":"G.O. Jones and A.J. Wilkie, editors, O-Minimality and Diophantine Geometry. London Mathematical Society Lecture Note Series, vol. 421, Cambridge University Press, 2015. xii + 221 pp","authors":"Antoine Chambert-Loir","doi":"10.1017/BSL.2017.3","DOIUrl":"https://doi.org/10.1017/BSL.2017.3","url":null,"abstract":"","PeriodicalId":55307,"journal":{"name":"Bulletin of Symbolic Logic","volume":"44 1","pages":"115-117"},"PeriodicalIF":0.6,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75661741","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
In Memoriam: Walter (Wouter) van Stigt (1927-2015)
IF 0.6 3区 数学
Bulletin of Symbolic Logic Pub Date : 2017-03-01 DOI: 10.1017/BSL.2016.39
W. Veldman
{"title":"In Memoriam: Walter (Wouter) van Stigt (1927-2015)","authors":"W. Veldman","doi":"10.1017/BSL.2016.39","DOIUrl":"https://doi.org/10.1017/BSL.2016.39","url":null,"abstract":"","PeriodicalId":55307,"journal":{"name":"Bulletin of Symbolic Logic","volume":"47 21","pages":"122-123"},"PeriodicalIF":0.6,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1017/BSL.2016.39","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72374617","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学术官方微信