Bulletin of Symbolic Logic最新文献

Proof-Theoretical System for Predicate Logic: ∏πφ= 谓词逻辑的证明理论系统:∏πφ=

IF 0.6 3区数学

Bulletin of Symbolic Logic Pub Date : 2022-01-01 DOI: 10.1007/978-3-030-67396-3_8

Odysseus Makridis

引用次数: 0

Formal Predicate Logic (also called First-Order Logic) ∏ 形式谓词逻辑(也称为一阶逻辑)∏

IF 0.6 3区数学

Bulletin of Symbolic Logic Pub Date : 2022-01-01 DOI: 10.1007/978-3-030-67396-3_5

Odysseus Makridis

引用次数: 0

Sentential Logic Languages ∑ 句子逻辑语言∑

IF 0.6 3区数学

Bulletin of Symbolic Logic Pub Date : 2022-01-01 DOI: 10.1007/978-3-030-67396-3_4

Odysseus Makridis

引用次数: 0

Semantic Models for ∏: ∏⧉ ∏的语义模型:∏<e:1>

IF 0.6 3区数学

Bulletin of Symbolic Logic Pub Date : 2022-01-01 DOI: 10.1007/978-3-030-67396-3_7

Odysseus Makridis

引用次数: 0

Formal Logic of Sentences, Sentential Logic (also called Sentential Logic and Statement Logic) 句子的形式逻辑、句子逻辑(也叫句子逻辑和语句逻辑)

IF 0.6 3区数学

Bulletin of Symbolic Logic Pub Date : 2022-01-01 DOI: 10.1007/978-3-030-67396-3_3

Odysseus Makridis

引用次数: 0

Concepts of Deductive Reasoning 演绎推理的概念

IF 0.6 3区数学

Bulletin of Symbolic Logic Pub Date : 2022-01-01 DOI: 10.1007/978-3-030-67396-3_2

Odysseus Makridis

引用次数: 0

Translations from English into ∏πφ= (also called Symbolizations, Formalizations) πφ=(又称Symbolizations, Formalizations)

IF 0.6 3区数学

Bulletin of Symbolic Logic Pub Date : 2022-01-01 DOI: 10.1007/978-3-030-67396-3_6

Odysseus Makridis

引用次数: 0

Basics of Set Theory 集合论基础

IF 0.6 3区数学

Bulletin of Symbolic Logic Pub Date : 2022-01-01 DOI: 10.1007/978-3-030-67396-3_10

Odysseus Makridis

引用次数: 0

Filling cages. Reverse mathematics and combinatorial principles 填充的笼子里。逆向数学和组合原理

IF 0.6 3区数学

Bulletin of Symbolic Logic Pub Date : 2020-01-01 DOI: 10.1017/bsl.2020.39

Marta Fiori-Carones

引用次数: 0

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":null,"pages":null},"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