首页 > 最新文献

arXiv - MATH - Logic最新文献

英文 中文
Tree-like graphings of countable Borel equivalence relations 可数伯尔等价关系的树状图谱
Pub Date : 2024-09-15 DOI: arxiv-2409.09843
Zhaoshen Zhai
We present a streamlined exposition of a construction by R. Chen, A. Poulin,R. Tao, and A. Tserunyan, which proves the treeability of equivalence relationsgenerated by any locally-finite Borel graph such that each component is aquasi-tree. More generally, we show that if each component of a locally-finiteBorel graph admits a finitely-separating Borel family of cuts, then we may'canonically' construct a forest of special ultrafilters; moreover, if the cutsare dense towards ends, then this forest is a Borel treeing.
我们对 R. Chen、A. Poulin、R. Tao 和 A. Tserunyan 的构造进行了精简阐述。Tao, and A. Tserunyan 的构造,该构造证明了由任何局部有限伯尔图生成的等价关系的可树性,且每个分量都是水树。更广义地说,我们证明了如果局部有限伯尔图的每个分量都有一个有限分离的伯尔切分族,那么我们就可以 "规范地 "构造一个特殊超滤波器森林;此外,如果切分向两端密集,那么这个森林就是伯尔树化。
{"title":"Tree-like graphings of countable Borel equivalence relations","authors":"Zhaoshen Zhai","doi":"arxiv-2409.09843","DOIUrl":"https://doi.org/arxiv-2409.09843","url":null,"abstract":"We present a streamlined exposition of a construction by R. Chen, A. Poulin,\u0000R. Tao, and A. Tserunyan, which proves the treeability of equivalence relations\u0000generated by any locally-finite Borel graph such that each component is a\u0000quasi-tree. More generally, we show that if each component of a locally-finite\u0000Borel graph admits a finitely-separating Borel family of cuts, then we may\u0000'canonically' construct a forest of special ultrafilters; moreover, if the cuts\u0000are dense towards ends, then this forest is a Borel treeing.","PeriodicalId":501306,"journal":{"name":"arXiv - MATH - Logic","volume":"54 3 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142266732","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}
引用次数: 0
Adding Abraham clubs and $α$-properness 增加亚伯拉罕俱乐部和α$正确性
Pub Date : 2024-09-15 DOI: arxiv-2409.09697
Mohammad Golshani, Rouholah Hoseini Naveh
For every indecomposable ordinal $alpha < omega_1$, we introduce a variantof Abraham forcing for adding a club in $omega_1$, which is $
对于每一个不可分解的序数$alpha < omega_1$,我们引入一个亚伯拉罕强迫的变体,用于在$omega_1$中添加一个俱乐部,它是$
{"title":"Adding Abraham clubs and $α$-properness","authors":"Mohammad Golshani, Rouholah Hoseini Naveh","doi":"arxiv-2409.09697","DOIUrl":"https://doi.org/arxiv-2409.09697","url":null,"abstract":"For every indecomposable ordinal $alpha < omega_1$, we introduce a variant\u0000of Abraham forcing for adding a club in $omega_1$, which is $<alpha$-proper\u0000but not $alpha$-proper.","PeriodicalId":501306,"journal":{"name":"arXiv - MATH - Logic","volume":"28 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142266956","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}
引用次数: 0
The bottom of the lattice of BCK-varieties BCK 变体网格的底部
Pub Date : 2024-09-15 DOI: arxiv-2409.09854
Tomasz Kowalski
Confirming a conjecture of Pa{l}asi'nski and Wro'nski, we show that thebottom of the lattice of subvarieties of BCK is Y-shaped.
为了证实 Pa{l}asi'nski 和 Wro'nski 的猜想,我们证明了 BCK 子变量网格的底面是 Y 形的。
{"title":"The bottom of the lattice of BCK-varieties","authors":"Tomasz Kowalski","doi":"arxiv-2409.09854","DOIUrl":"https://doi.org/arxiv-2409.09854","url":null,"abstract":"Confirming a conjecture of Pa{l}asi'nski and Wro'nski, we show that the\u0000bottom of the lattice of subvarieties of BCK is Y-shaped.","PeriodicalId":501306,"journal":{"name":"arXiv - MATH - Logic","volume":"5 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142269591","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}
引用次数: 0
On maximal order type of the lexicographic product 论词典积的最大阶类型
Pub Date : 2024-09-15 DOI: arxiv-2409.09699
Mirna Džamonja, Isa Vialard
We give a self-contained proof of Isa Vialard's formula for $o(Pcdot Q)$where $P$ and $Q$ are wpos. The proof introduces the notion of a cut of partialorder, which might be of independent interest.
我们给出了伊萨-维亚拉公式对 $o(Pcdot Q)$(其中 $P$ 和 $Q$ 都是 wpos)的自足证明。证明中引入了部分阶切割的概念,这可能会引起人们的兴趣。
{"title":"On maximal order type of the lexicographic product","authors":"Mirna Džamonja, Isa Vialard","doi":"arxiv-2409.09699","DOIUrl":"https://doi.org/arxiv-2409.09699","url":null,"abstract":"We give a self-contained proof of Isa Vialard's formula for $o(Pcdot Q)$\u0000where $P$ and $Q$ are wpos. The proof introduces the notion of a cut of partial\u0000order, which might be of independent interest.","PeriodicalId":501306,"journal":{"name":"arXiv - MATH - Logic","volume":"22 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142269595","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}
引用次数: 0
Topics, Non-Uniform Substitutions, and Variable Sharing 主题、非均匀代换和变量共享
Pub Date : 2024-09-13 DOI: arxiv-2409.08942
Shawn Standefer, Shay Allen Logan, Thomas Macaulay Ferguson
The family of relevant logics can be faceted by a hierarchy of increasinglyfine-grained variable sharing properties -- requiring that in valid entailments$Ato B$, some atom must appear in both $A$ and $B$ with some additionalcondition (e.g., with the same sign or nested within the same number ofconditionals). In this paper, we consider an incredibly strong variable sharingproperty of lericone relevance that takes into account the path of negationsand conditionals in which an atom appears in the parse trees of the antecedentand consequent. We show that this property of lericone relevance holds of therelevant logic $mathbf{BM}$ (and that a related property of faithful lericonerelevance holds of $mathbf{B}$) and characterize the largest fragments ofclassical logic with these properties. Along the way, we consider theconsequences for lericone relevance for the theory of subject-matter, forLogan's notion of hyperformalism, and for the very definition of a relevantlogic itself.
相关逻辑家族可以通过越来越精细的变量共享属性层次来划分--要求在有效的蕴涵$A/to B$中,某些原子必须同时出现在$A$和$B$中,并带有某些附加条件(例如,带有相同的符号或嵌套在相同数量的条件中)。在本文中,我们考虑到了原子在前件和后件的解析树中出现的否定和条件的路径,从而提出了一个令人难以置信的强大的 lericone 相关性变量共享属性。我们证明了相关逻辑$mathbf{BM}$的lericone相关性属性成立(相关的忠实lericone相关性属性也在$mathbf{B}$中成立),并描述了具有这些属性的经典逻辑的最大片段。在此过程中,我们考虑了莱里孔相关性对主题理论、洛根的超形式主义概念以及相关逻辑定义本身的影响。
{"title":"Topics, Non-Uniform Substitutions, and Variable Sharing","authors":"Shawn Standefer, Shay Allen Logan, Thomas Macaulay Ferguson","doi":"arxiv-2409.08942","DOIUrl":"https://doi.org/arxiv-2409.08942","url":null,"abstract":"The family of relevant logics can be faceted by a hierarchy of increasingly\u0000fine-grained variable sharing properties -- requiring that in valid entailments\u0000$Ato B$, some atom must appear in both $A$ and $B$ with some additional\u0000condition (e.g., with the same sign or nested within the same number of\u0000conditionals). In this paper, we consider an incredibly strong variable sharing\u0000property of lericone relevance that takes into account the path of negations\u0000and conditionals in which an atom appears in the parse trees of the antecedent\u0000and consequent. We show that this property of lericone relevance holds of the\u0000relevant logic $mathbf{BM}$ (and that a related property of faithful lericone\u0000relevance holds of $mathbf{B}$) and characterize the largest fragments of\u0000classical logic with these properties. Along the way, we consider the\u0000consequences for lericone relevance for the theory of subject-matter, for\u0000Logan's notion of hyperformalism, and for the very definition of a relevant\u0000logic itself.","PeriodicalId":501306,"journal":{"name":"arXiv - MATH - Logic","volume":"20 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142266955","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}
引用次数: 0
Decidable varieties of p-algebras p 算法的可解变量
Pub Date : 2024-09-13 DOI: arxiv-2409.09015
Tomasz Kowalski, Katarzyna Słomczyńska
We show that for quasivarieties of p-algebras the properties of (i) havingdecidable first-order theory and (ii) having decidable first-order theory ofthe finite members, coincide. The only two quasivarieties with these propertiesare the trivial variety and the variety of Boolean algebras. This contrastssharply, even for varieties, with the situation in Heyting algebras wheredecidable varieties do not coincide with finitely decidable ones.
我们证明,对于 p 矩阵的准变量,(i) 具有可判定的一阶理论和 (ii) 有限成员具有可判定的一阶理论这两个性质是重合的。唯一具有这些性质的两个类群是三元数群和布尔代数数群。这与海廷(Heyting)代数中的情况形成了鲜明的对比,即使对于代数的变种来说,可判定的变种与有限可判定的变种也不重合。
{"title":"Decidable varieties of p-algebras","authors":"Tomasz Kowalski, Katarzyna Słomczyńska","doi":"arxiv-2409.09015","DOIUrl":"https://doi.org/arxiv-2409.09015","url":null,"abstract":"We show that for quasivarieties of p-algebras the properties of (i) having\u0000decidable first-order theory and (ii) having decidable first-order theory of\u0000the finite members, coincide. The only two quasivarieties with these properties\u0000are the trivial variety and the variety of Boolean algebras. This contrasts\u0000sharply, even for varieties, with the situation in Heyting algebras where\u0000decidable varieties do not coincide with finitely decidable ones.","PeriodicalId":501306,"journal":{"name":"arXiv - MATH - Logic","volume":"8 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142266953","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}
引用次数: 0
Quasivarieties of p-algebras: some new results p 算法的准变量:一些新成果
Pub Date : 2024-09-13 DOI: arxiv-2409.08990
Tomasz Kowalski, Katarzyna Słomczyńska
We investigate quasivarieties of (distributive) p-algebras. We sharpen someprevious results, give a better picture of the subquasivariety lattice, andprove that quasivarieties generated by free p-algebras belong to a rather smallquasivariety characterised by excluding all but 3 subdirectly irreducibles.
我们研究了(分布式)p-代数的准变量。我们对之前的一些结果进行了锐化,给出了亚类群晶格的更好图景,并证明了由自由 p-代数生成的类群属于一个相当小的类群,其特征是除了 3 个亚直接不可还原物之外,排除了所有其他的亚直接不可还原物。
{"title":"Quasivarieties of p-algebras: some new results","authors":"Tomasz Kowalski, Katarzyna Słomczyńska","doi":"arxiv-2409.08990","DOIUrl":"https://doi.org/arxiv-2409.08990","url":null,"abstract":"We investigate quasivarieties of (distributive) p-algebras. We sharpen some\u0000previous results, give a better picture of the subquasivariety lattice, and\u0000prove that quasivarieties generated by free p-algebras belong to a rather small\u0000quasivariety characterised by excluding all but 3 subdirectly irreducibles.","PeriodicalId":501306,"journal":{"name":"arXiv - MATH - Logic","volume":"30 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142266954","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}
引用次数: 0
Borel graphable equivalence relations Borel 可图等价关系
Pub Date : 2024-09-13 DOI: arxiv-2409.08624
Tyler Arant, Alexander S. Kechris, Patrick Lutz
This paper is devoted to the study of analytic equivalence relations whichare Borel graphable, i.e. which can be realized as the connectedness relationof a Borel graph. Our main focus is the question of which analytic equivalencerelations are Borel graphable. First, we study an equivalence relation arisingfrom the theory of countable admissible ordinals and show that it is Borelgraphable if and only if there is a non-constructible real. As a corollary ofthe proof, we construct an analytic equivalence relation which is (provably inZFC) not Borel graphable and an effectively analytic equivalence relation whichis Borel graphable but not effectively Borel graphable. Next, we study analyticequivalence relations given by the isomorphism relation for some class ofcountable structures. We show that all such equivalence relations are Borelgraphable, which implies that for every Borel action of $S_infty$, theassociated orbit equivalence relation is Borel graphable. This leads us tostudy the class of Polish groups whose Borel actions always give rise to Borelgraphable orbit equivalence relations; we refer to such groups as graphicgroups. We show that besides $S_infty$, the class of graphic groups includesall connected Polish groups and is closed under countable products. We finishby studying structural properties of the class of Borel graphable analyticequivalence relations and by considering two variations on Borel graphability:a generalization with hypegraphs instead of graphs and an analogue of Borelgraphability in the setting of computably enumerable equivalence relations.
本文致力于研究可波尔图化的解析等价关系,即可以实现为波尔图的连通性关系的解析等价关系。我们的主要焦点是哪些解析等价关系是伯尔可图关系。首先,我们研究了可数可容许序数理论中产生的等价关系,并证明当且仅当存在一个不可构造的实数时,它是可博尔图的。作为证明的一个推论,我们构造了一个(在 ZFC 中可以证明)不可伯尔图式化的解析等价关系,以及一个可伯尔图式化但不可有效伯尔图式化的有效解析等价关系。接下来,我们研究由某类可数结构的同构关系给出的解析等价关系。我们证明了所有这样的等价关系都是伯尔可图的,这意味着对于 $S_infty$ 的每一个伯尔作用,相关的轨道等价关系都是伯尔可图的。这就引导我们研究一类波兰群,它们的玻尔作用总是引起可玻尔图的轨道等价关系;我们把这类群称为图群。我们证明,除了 $S_infty$,图形群类还包括所有连通的波兰群,并且在可数乘积下是封闭的。最后,我们研究了伯尔可图式分析等价关系类的结构性质,并考虑了伯尔可图式的两种变体:一种是用下图式代替图式的广义化,另一种是在可计算可枚举等价关系中的伯尔可图式。
{"title":"Borel graphable equivalence relations","authors":"Tyler Arant, Alexander S. Kechris, Patrick Lutz","doi":"arxiv-2409.08624","DOIUrl":"https://doi.org/arxiv-2409.08624","url":null,"abstract":"This paper is devoted to the study of analytic equivalence relations which\u0000are Borel graphable, i.e. which can be realized as the connectedness relation\u0000of a Borel graph. Our main focus is the question of which analytic equivalence\u0000relations are Borel graphable. First, we study an equivalence relation arising\u0000from the theory of countable admissible ordinals and show that it is Borel\u0000graphable if and only if there is a non-constructible real. As a corollary of\u0000the proof, we construct an analytic equivalence relation which is (provably in\u0000ZFC) not Borel graphable and an effectively analytic equivalence relation which\u0000is Borel graphable but not effectively Borel graphable. Next, we study analytic\u0000equivalence relations given by the isomorphism relation for some class of\u0000countable structures. We show that all such equivalence relations are Borel\u0000graphable, which implies that for every Borel action of $S_infty$, the\u0000associated orbit equivalence relation is Borel graphable. This leads us to\u0000study the class of Polish groups whose Borel actions always give rise to Borel\u0000graphable orbit equivalence relations; we refer to such groups as graphic\u0000groups. We show that besides $S_infty$, the class of graphic groups includes\u0000all connected Polish groups and is closed under countable products. We finish\u0000by studying structural properties of the class of Borel graphable analytic\u0000equivalence relations and by considering two variations on Borel graphability:\u0000a generalization with hypegraphs instead of graphs and an analogue of Borel\u0000graphability in the setting of computably enumerable equivalence relations.","PeriodicalId":501306,"journal":{"name":"arXiv - MATH - Logic","volume":"2 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142266958","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}
引用次数: 0
Tropicalization through the lens of Łukasiewicz logic, with a topos theoretic perspective 以拓扑理论为视角,从卢卡谢维奇逻辑的角度看热带化问题
Pub Date : 2024-09-13 DOI: arxiv-2409.08682
Antonio Di Nola, Giacomo Lenzi, Brunella Gerla
The main aim of this paper is to show that the topics of {L}ukasiewiczlogic, semirings and tropical structures fruitfully meet. This gives rise to atopos theoretic perspective to {L}ukasiewicz logic. A functorialtropicalization of MV-algebras in the variety V(C) is proposed. We furtherconsider a logic based on perfect MV-algebras and having truth values that areperturbations of boolean values, and we show how this logic can exhibit modelsfunctorially connected with points of a non-commutative geometry.
本文的主要目的是证明{L}ukasiewicz逻辑、语义和热带结构等主题是富有成果的。这给{L}ukasiewicz逻辑带来了topos理论的视角。我们提出了在V(C)中对MV-代数进行函数化的方法。我们进一步考虑了一种基于完备MV-词组的逻辑,它的真值是布尔值的扰动,我们展示了这种逻辑如何展示与非交换几何的点在扇形上相连的模型。
{"title":"Tropicalization through the lens of Łukasiewicz logic, with a topos theoretic perspective","authors":"Antonio Di Nola, Giacomo Lenzi, Brunella Gerla","doi":"arxiv-2409.08682","DOIUrl":"https://doi.org/arxiv-2409.08682","url":null,"abstract":"The main aim of this paper is to show that the topics of {L}ukasiewicz\u0000logic, semirings and tropical structures fruitfully meet. This gives rise to a\u0000topos theoretic perspective to {L}ukasiewicz logic. A functorial\u0000tropicalization of MV-algebras in the variety V(C) is proposed. We further\u0000consider a logic based on perfect MV-algebras and having truth values that are\u0000perturbations of boolean values, and we show how this logic can exhibit models\u0000functorially connected with points of a non-commutative geometry.","PeriodicalId":501306,"journal":{"name":"arXiv - MATH - Logic","volume":"57 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142266957","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}
引用次数: 0
Reasoning Around Paradox with Grounded Deduction 用基础演绎法进行悖论推理
Pub Date : 2024-09-12 DOI: arxiv-2409.08243
Bryan Ford
How can we reason around logical paradoxes without falling into them? Thispaper introduces grounded deduction or GD, a Kripke-inspired approach tofirst-order logic and arithmetic that is neither classical nor intuitionistic,but nevertheless appears both pragmatically usable and intuitively justifiable.GD permits the direct expression of unrestricted recursive definitions -including paradoxical ones such as 'L := not L' - while adding dynamic typingpremises to certain inference rules so that such paradoxes do not lead toinconsistency. This paper constitutes a preliminary development andinvestigation of grounded deduction, to be extended with further elaborationand deeper analysis of its intriguing properties.
我们怎样才能绕过逻辑悖论进行推理而不陷入悖论呢?GD 允许直接表达无限制的递归定义--包括 "L := not L "这样的悖论定义--同时为某些推理规则添加了动态类型预设,从而使这类悖论不会导致不一致。本文是对基础演绎法的初步发展和研究,我们还将进一步阐述和深入分析其引人入胜的特性。
{"title":"Reasoning Around Paradox with Grounded Deduction","authors":"Bryan Ford","doi":"arxiv-2409.08243","DOIUrl":"https://doi.org/arxiv-2409.08243","url":null,"abstract":"How can we reason around logical paradoxes without falling into them? This\u0000paper introduces grounded deduction or GD, a Kripke-inspired approach to\u0000first-order logic and arithmetic that is neither classical nor intuitionistic,\u0000but nevertheless appears both pragmatically usable and intuitively justifiable.\u0000GD permits the direct expression of unrestricted recursive definitions -\u0000including paradoxical ones such as 'L := not L' - while adding dynamic typing\u0000premises to certain inference rules so that such paradoxes do not lead to\u0000inconsistency. This paper constitutes a preliminary development and\u0000investigation of grounded deduction, to be extended with further elaboration\u0000and deeper analysis of its intriguing properties.","PeriodicalId":501306,"journal":{"name":"arXiv - MATH - Logic","volume":"29 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142224553","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}
引用次数: 0
期刊
arXiv - MATH - Logic
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1