首页 > 最新文献

arXiv - MATH - Logic最新文献

英文 中文
Strong completeness for the predicate logic of the continuous t-norms 连续 t 规范谓词逻辑的强完备性
Pub Date : 2024-08-08 DOI: arxiv-2408.04792
Diego Castaño, José Patricio Díaz Varela, Gabriel Savoy
The axiomatic system introduced by H'ajek axiomatizes first-order logicbased on BL-chains. In this study, we extend this system with the axiom$(forall x phi)^2 leftrightarrow forall x phi^2$ and the infinitary rule[ frac{phi vee (alpha to beta^n):n in mathbb{N}}{phi vee (alpha toalpha & beta)} ] to achieve strong completeness with respect to continuoust-norms.
阿杰克(H'ajek)引入的公理系统将基于BL-链的一阶逻辑公理化。在本研究中,我们用公理$(forall x phi)^2 leftrightarrow forall x phi^2$ 和无穷规则来扩展这个系统:n in mathbb{N}}{phi vee (alpha toalpha & beta)} ]来实现关于连续规范的强完备性。
{"title":"Strong completeness for the predicate logic of the continuous t-norms","authors":"Diego Castaño, José Patricio Díaz Varela, Gabriel Savoy","doi":"arxiv-2408.04792","DOIUrl":"https://doi.org/arxiv-2408.04792","url":null,"abstract":"The axiomatic system introduced by H'ajek axiomatizes first-order logic\u0000based on BL-chains. In this study, we extend this system with the axiom\u0000$(forall x phi)^2 leftrightarrow forall x phi^2$ and the infinitary rule\u0000[ frac{phi vee (alpha to beta^n):n in mathbb{N}}{phi vee (alpha to\u0000alpha & beta)} ] to achieve strong completeness with respect to continuous\u0000t-norms.","PeriodicalId":501306,"journal":{"name":"arXiv - MATH - Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141945479","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
A note on surjective cardinals 关于投射红心的说明
Pub Date : 2024-08-08 DOI: arxiv-2408.04287
Jiaheng Jin, Guozhen Shen
For cardinals $mathfrak{a}$ and $mathfrak{b}$, we write$mathfrak{a}=^astmathfrak{b}$ if there are sets $A$ and $B$ of cardinalities$mathfrak{a}$ and $mathfrak{b}$, respectively, such that there are partialsurjections from $A$ onto $B$ and from $B$ onto $A$. $=^ast$-equivalenceclasses are called surjective cardinals. In this article, we show that$mathsf{ZF}+mathsf{DC}_kappa$, where $kappa$ is a fixed aleph, cannot provethat surjective cardinals form a cardinal algebra, which gives a negativesolution to a question proposed by Truss [J. Truss, Ann. Pure Appl. Logic 27,165--207 (1984)]. Nevertheless, we show that surjective cardinals form a``surjective cardinal algebra'', whose postulates are almost the same withthose of a cardinal algebra, except that the refinement postulate is replacedby the finite refinement postulate. This yields a smoother proof of thecancellation law for surjective cardinals, which states that$mcdotmathfrak{a}=^ast mcdotmathfrak{b}$ implies$mathfrak{a}=^astmathfrak{b}$ for all cardinals $mathfrak{a},mathfrak{b}$and all nonzero natural numbers $m$.
对于红心$mathfrak{a}$和$mathfrak{b}$,如果存在红心分别为$mathfrak{a}$和$mathfrak{b}$的集合$A$和$B$,从而存在从$A$到$B$和从$B$到$A$的偏射,我们就写$mathfrak{a}=^astmathfrak{b}$。$=^ast$-等价类被称为投射红心。在本文中,我们证明了$mathsf{ZF}+mathsf{DC}_kappa$,其中$kappa$是一个固定的aleph,不能证明投射红心构成了一个红心代数,这给出了特鲁斯[J. Truss, Ann. Pure Appl. Logic 27,165--207 (1984)]提出的一个问题的否定解答。然而,我们证明了投射红心构成了一个 "投射红心代数",其公设与红心代数的公设几乎相同,只是细化公设被有限细化公设所取代。对于所有的红心数$mathfrak{a}, mathfrak{b}$和所有非零自然数$m$来说,这意味着$mathfrak{a}=^astmathfrak{b}$。
{"title":"A note on surjective cardinals","authors":"Jiaheng Jin, Guozhen Shen","doi":"arxiv-2408.04287","DOIUrl":"https://doi.org/arxiv-2408.04287","url":null,"abstract":"For cardinals $mathfrak{a}$ and $mathfrak{b}$, we write\u0000$mathfrak{a}=^astmathfrak{b}$ if there are sets $A$ and $B$ of cardinalities\u0000$mathfrak{a}$ and $mathfrak{b}$, respectively, such that there are partial\u0000surjections from $A$ onto $B$ and from $B$ onto $A$. $=^ast$-equivalence\u0000classes are called surjective cardinals. In this article, we show that\u0000$mathsf{ZF}+mathsf{DC}_kappa$, where $kappa$ is a fixed aleph, cannot prove\u0000that surjective cardinals form a cardinal algebra, which gives a negative\u0000solution to a question proposed by Truss [J. Truss, Ann. Pure Appl. Logic 27,\u0000165--207 (1984)]. Nevertheless, we show that surjective cardinals form a\u0000``surjective cardinal algebra'', whose postulates are almost the same with\u0000those of a cardinal algebra, except that the refinement postulate is replaced\u0000by the finite refinement postulate. This yields a smoother proof of the\u0000cancellation law for surjective cardinals, which states that\u0000$mcdotmathfrak{a}=^ast mcdotmathfrak{b}$ implies\u0000$mathfrak{a}=^astmathfrak{b}$ for all cardinals $mathfrak{a},mathfrak{b}$\u0000and all nonzero natural numbers $m$.","PeriodicalId":501306,"journal":{"name":"arXiv - MATH - Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141945519","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 ultrafilters to Shelah's model for no nowhere dense ultrafilters 在谢拉无处密集超滤波器模型中添加超滤波器
Pub Date : 2024-08-08 DOI: arxiv-2408.04446
Dilip Raghavan, Juris Stepr= ans
We exhibit a forcing for producing a model with no nowhere dense ultrafiltersthat satisfies the full Sacks Property. By interleaving this forcing with otherforcing notions, a model containing a $(2, {aleph}_{0})$-selectiveultrafilter, but no nowhere dense ultrafilters is produced. It is thus provedthat the existence of $(2, {aleph}_{0})$-selective ultrafilters does not implythe existence of nowhere dense ultrafilters.
我们展示了一个满足完整萨克斯性质的无处密集超滤波器模型。通过将这一强制与其他强制概念交织在一起,一个包含$(2, {aleph}_{0})$ 选择性超滤波器但没有无处密集超滤波器的模型就产生了。由此证明,$(2, {aleph}_{0})$ 选择性超滤波器的存在并不意味着无处密集超滤波器的存在。
{"title":"Adding ultrafilters to Shelah's model for no nowhere dense ultrafilters","authors":"Dilip Raghavan, Juris Stepr= ans","doi":"arxiv-2408.04446","DOIUrl":"https://doi.org/arxiv-2408.04446","url":null,"abstract":"We exhibit a forcing for producing a model with no nowhere dense ultrafilters\u0000that satisfies the full Sacks Property. By interleaving this forcing with other\u0000forcing notions, a model containing a $(2, {aleph}_{0})$-selective\u0000ultrafilter, but no nowhere dense ultrafilters is produced. It is thus proved\u0000that the existence of $(2, {aleph}_{0})$-selective ultrafilters does not imply\u0000the existence of nowhere dense ultrafilters.","PeriodicalId":501306,"journal":{"name":"arXiv - MATH - Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141945520","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
Strong standard completeness theorems for S5-modal Lukasiewicz logics S5 模态卢卡西维茨逻辑的强标准完备性定理
Pub Date : 2024-08-08 DOI: arxiv-2408.04757
Diego Castaño, José Patricio Díaz Varela, Gabriel Savoy
We study the S5-modal expansion of the logic based on the Lukasiewicz t-norm.We exhibit a finitary propositional calculus and show that it is finitelystrongly complete with respect to this logic. This propositional calculus isthen expanded with an infinitary rule to achieve strong completeness. Theseresults are derived from properties of monadic MValgebras: functionalrepresentations of simple and finitely subdirectly irreducible algebras, aswell as the finite embeddability property. We also show similar completenesstheorems for the extension of the logic based on models with bounded universe.
我们研究了基于卢卡西维茨 t 规范的逻辑的 S5 模扩展。我们展示了一个有限命题微积分,并证明它相对于该逻辑是有限强完备的。我们展示了一个有限命题微积分,并证明它相对于这个逻辑是有限强完备的。然后用一个无穷规则对这个命题微积分进行扩展,以实现强完备性。这些结果源自单元 MV 对象的性质:简单和有限次直接不可还原对象的函数表示,以及有限可嵌入性性质。我们还展示了基于有界宇宙模型的逻辑扩展的类似完备性定理。
{"title":"Strong standard completeness theorems for S5-modal Lukasiewicz logics","authors":"Diego Castaño, José Patricio Díaz Varela, Gabriel Savoy","doi":"arxiv-2408.04757","DOIUrl":"https://doi.org/arxiv-2408.04757","url":null,"abstract":"We study the S5-modal expansion of the logic based on the Lukasiewicz t-norm.\u0000We exhibit a finitary propositional calculus and show that it is finitely\u0000strongly complete with respect to this logic. This propositional calculus is\u0000then expanded with an infinitary rule to achieve strong completeness. These\u0000results are derived from properties of monadic MValgebras: functional\u0000representations of simple and finitely subdirectly irreducible algebras, as\u0000well as the finite embeddability property. We also show similar completeness\u0000theorems for the extension of the logic based on models with bounded universe.","PeriodicalId":501306,"journal":{"name":"arXiv - MATH - Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141945517","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 short exact sequence in definable Galois cohomology 可定义伽罗瓦同调中的短精确序列
Pub Date : 2024-08-08 DOI: arxiv-2408.04147
David Meretzky
In Remarks on Galois Cohomology and Definability [2], Pillay introduceddefinable Galois cohomology, a model-theoretic generalization of Galoiscohomology. Let $M$ be an atomic and strongly $omega$-homogeneous structureover a set of parameters $A$. Let $B$ be a normal extension of $A$ in $M$. Weshow that a short exact sequence of automorphism groups $1 to text{Aut}(M/B)to text{Aut}(M/A) to text{Aut}(B/A) to 1$ induces a short exact sequencein definable Galois cohomology. Our result complements the long exact sequencein definable Galois cohomology developed in More on Galois cohomology,definability and differential algebraic groups [3].
在《关于伽罗瓦同调与可定义性的评论》[2]中,皮莱介绍了可定义伽罗瓦同调,它是伽罗瓦同调的一种模型理论概括。让 $M$ 是在一组参数 $A$ 上的原子和强 $omega$ 同调结构。让 $B$ 是 $A$ 在 $M$ 中的正常扩展。我们可以看到,自变群的短精确序列 $1 (到)text{Aut}(M/B)(到)text{Aut}(M/A)(到)text{Aut}(B/A)(到)1$ 在可定义的伽罗瓦同调中诱导了一个短精确序列。我们的结果是对《更多关于伽罗瓦同调、可定义性和微分代数群》[3] 中提出的可定义伽罗瓦同调中的长精确序列的补充。
{"title":"The short exact sequence in definable Galois cohomology","authors":"David Meretzky","doi":"arxiv-2408.04147","DOIUrl":"https://doi.org/arxiv-2408.04147","url":null,"abstract":"In Remarks on Galois Cohomology and Definability [2], Pillay introduced\u0000definable Galois cohomology, a model-theoretic generalization of Galois\u0000cohomology. Let $M$ be an atomic and strongly $omega$-homogeneous structure\u0000over a set of parameters $A$. Let $B$ be a normal extension of $A$ in $M$. We\u0000show that a short exact sequence of automorphism groups $1 to text{Aut}(M/B)\u0000to text{Aut}(M/A) to text{Aut}(B/A) to 1$ induces a short exact sequence\u0000in definable Galois cohomology. Our result complements the long exact sequence\u0000in definable Galois cohomology developed in More on Galois cohomology,\u0000definability and differential algebraic groups [3].","PeriodicalId":501306,"journal":{"name":"arXiv - MATH - Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141945521","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 Namba Forcing and Minimal Collapses 关于难波强迫和最小坍塌
Pub Date : 2024-08-07 DOI: arxiv-2408.03487
Maxwell Levine
We build on a 1990 paper of Bukovsky and Coplakova-Hartova. First, we removethe hypothesis of $textsf{CH}$ from one of their minimality results. Then,using a measurable cardinal, we show that there is a$|aleph_2^V|=aleph_1$-minimal extension that is not a$|aleph_3^V|=aleph_1$-extension, answering the first of their questions.
我们以布科夫斯基和科普拉科娃-哈托娃 1990 年的一篇论文为基础。首先,我们从他们的一个最小性结果中删除了$textsf{CH}$的假设。然后,我们用一个可测的红心证明,有一个$|aleph_2^V|=aleph_1$最小扩展不是$|aleph_3^V|=aleph_1$扩展,从而回答了他们的第一个问题。
{"title":"On Namba Forcing and Minimal Collapses","authors":"Maxwell Levine","doi":"arxiv-2408.03487","DOIUrl":"https://doi.org/arxiv-2408.03487","url":null,"abstract":"We build on a 1990 paper of Bukovsky and Coplakova-Hartova. First, we remove\u0000the hypothesis of $textsf{CH}$ from one of their minimality results. Then,\u0000using a measurable cardinal, we show that there is a\u0000$|aleph_2^V|=aleph_1$-minimal extension that is not a\u0000$|aleph_3^V|=aleph_1$-extension, answering the first of their questions.","PeriodicalId":501306,"journal":{"name":"arXiv - MATH - Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141945524","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
Impact Analysis of Data Drift Towards The Development of Safety-Critical Automotive System 数据漂移对开发安全关键型汽车系统的影响分析
Pub Date : 2024-08-07 DOI: arxiv-2408.04476
Md Shahi Amran Hossain, Abu Shad Ahammed, Divya Prakash Biswas, Roman Obermaisser
A significant part of contemporary research in autonomous vehicles isdedicated to the development of safety critical systems where state-of-the-artartificial intelligence (AI) algorithms, like computer vision (CV), can play amajor role. Vision models have great potential for the real-time detection ofnumerous traffic signs and obstacles, which is essential to avoid accidents andprotect human lives. Despite vast potential, computer vision-based systems havecritical safety concerns too if the traffic condition drifts over time. Thispaper represents an analysis of how data drift can affect the performance ofvision models in terms of traffic sign detection. The novelty in this researchis provided through a YOLO-based fusion model that is trained with drifted datafrom the CARLA simulator and delivers a robust and enhanced performance inobject detection. The enhanced model showed an average precision of 97.5%compared to the 58.27% precision of the original model. A detailed performancereview of the original and fusion models is depicted in the paper, whichpromises to have a significant impact on safety-critical automotive systems.
当代自动驾驶汽车研究的很大一部分致力于安全关键系统的开发,而在这些系统中,计算机视觉(CV)等最先进的人工智能(AI)算法可以发挥重要作用。视觉模型在实时检测大量交通标志和障碍物方面具有巨大潜力,这对于避免事故和保护人类生命至关重要。尽管潜力巨大,但如果交通状况随时间发生变化,基于计算机视觉的系统也存在严重的安全问题。本文分析了数据漂移如何影响视觉模型在交通标志检测方面的性能。这项研究的新颖之处在于基于 YOLO 的融合模型,该模型使用来自 CARLA 模拟器的漂移数据进行训练,在目标检测方面具有稳健和增强的性能。与原始模型的 58.27% 的精度相比,增强模型的平均精度达到了 97.5%。论文对原始模型和融合模型进行了详细的性能评测,该模型有望对安全关键型汽车系统产生重大影响。
{"title":"Impact Analysis of Data Drift Towards The Development of Safety-Critical Automotive System","authors":"Md Shahi Amran Hossain, Abu Shad Ahammed, Divya Prakash Biswas, Roman Obermaisser","doi":"arxiv-2408.04476","DOIUrl":"https://doi.org/arxiv-2408.04476","url":null,"abstract":"A significant part of contemporary research in autonomous vehicles is\u0000dedicated to the development of safety critical systems where state-of-the-art\u0000artificial intelligence (AI) algorithms, like computer vision (CV), can play a\u0000major role. Vision models have great potential for the real-time detection of\u0000numerous traffic signs and obstacles, which is essential to avoid accidents and\u0000protect human lives. Despite vast potential, computer vision-based systems have\u0000critical safety concerns too if the traffic condition drifts over time. This\u0000paper represents an analysis of how data drift can affect the performance of\u0000vision models in terms of traffic sign detection. The novelty in this research\u0000is provided through a YOLO-based fusion model that is trained with drifted data\u0000from the CARLA simulator and delivers a robust and enhanced performance in\u0000object detection. The enhanced model showed an average precision of 97.5%\u0000compared to the 58.27% precision of the original model. A detailed performance\u0000review of the original and fusion models is depicted in the paper, which\u0000promises to have a significant impact on safety-critical automotive systems.","PeriodicalId":501306,"journal":{"name":"arXiv - MATH - Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141969400","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
Smart Health Software to Support Rescue Personnel in Emergency Situations 智能健康软件为紧急情况下的救援人员提供支持
Pub Date : 2024-08-07 DOI: arxiv-2408.03739
Abu Shad Ahammed, Roman Obermaisser
Rescue stations around the world receive millions of emergency rescue callseach year, most of which are due to health complications. Due to the highfrequency and necessity of rescue services, there is always an increasingdemand for quick, accurate, and coordinated responses from rescue personnel tosave lives and mitigate damage. This paper introduces a rescue healthmanagement software solution designed to improve the efficiency andeffectiveness of rescue situational awareness by rapidly assessing the healthstatus of emergency patients using AI-driven decision support systems. Thenovelty in this software approach is it's user-centered design principles toensure that its solutions are specifically tailored to meet the uniquerequirements of emergency responders. It used pre-trained machine learningmodels with rescue data and accepted new patient's input data to provide aprobability of the major health complications so that rescue personnel canexpedite treatment plan following the outcome. The paper focuses primarily onthe software development and implementation steps with three use cases, whilealso providing a short overview of the previous machine learning-baseddevelopment phases.
世界各地的救援站每年都会接到数百万个紧急救援电话,其中大部分都是由于健康问题引起的。由于救援服务的高频率和必要性,对救援人员做出快速、准确和协调响应以挽救生命和减少损失的需求一直在不断增加。本文介绍了一种救援健康管理软件解决方案,旨在利用人工智能驱动的决策支持系统快速评估紧急病人的健康状况,从而提高救援态势感知的效率和效果。这种软件方法的新颖之处在于它采用了以用户为中心的设计原则,以确保其解决方案是专门为满足应急响应人员的独特需求而量身定制的。它利用预先训练好的机器学习模型和抢救数据,并接受新病人的输入数据,提供主要健康并发症的可能性,以便抢救人员能根据结果推断治疗方案。本文主要介绍了软件开发和实施步骤以及三个使用案例,同时还简要概述了之前基于机器学习的开发阶段。
{"title":"Smart Health Software to Support Rescue Personnel in Emergency Situations","authors":"Abu Shad Ahammed, Roman Obermaisser","doi":"arxiv-2408.03739","DOIUrl":"https://doi.org/arxiv-2408.03739","url":null,"abstract":"Rescue stations around the world receive millions of emergency rescue calls\u0000each year, most of which are due to health complications. Due to the high\u0000frequency and necessity of rescue services, there is always an increasing\u0000demand for quick, accurate, and coordinated responses from rescue personnel to\u0000save lives and mitigate damage. This paper introduces a rescue health\u0000management software solution designed to improve the efficiency and\u0000effectiveness of rescue situational awareness by rapidly assessing the health\u0000status of emergency patients using AI-driven decision support systems. The\u0000novelty in this software approach is it's user-centered design principles to\u0000ensure that its solutions are specifically tailored to meet the unique\u0000requirements of emergency responders. It used pre-trained machine learning\u0000models with rescue data and accepted new patient's input data to provide a\u0000probability of the major health complications so that rescue personnel can\u0000expedite treatment plan following the outcome. The paper focuses primarily on\u0000the software development and implementation steps with three use cases, while\u0000also providing a short overview of the previous machine learning-based\u0000development phases.","PeriodicalId":501306,"journal":{"name":"arXiv - MATH - Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141945522","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
Elements of affine model theory 仿射模型理论要素
Pub Date : 2024-08-07 DOI: arxiv-2408.03555
Seyed-Mohammad Bagheri
By Lindstr"{o}m's theorems, the expressive power of first order logic (andsimilarly continuous logic) is not strengthened without losing some interestingproperty. Weakening it, is however less harmless and has been payed attentionby some authors. Affine continuous logic is the fragment of continuous logicobtained by avoiding the connectives $wedge,vee$. This reduction leads to theaffinization of most basic tools and technics of continuous logic such as theultraproduct construction, compactness theorem, type, saturation etc. Theaffine variant of the ultraproduct construction is the ultramean constructionwhere ultrafilters are replaced with maximal finitely additive probabilitymeasures. A consequence of this relaxation is that compact structures with atleast two elements have now proper elementary extensions. In particular, theyhave non-categorical theories in the new setting. Thus, a model theoreticframework for study of such structures is provided. A more remarkable aspect ofthis logic is that the type spaces are compact convex sets. The extreme typesthen play a crucial role in the study of affine theories. In this text, wepresent the foundations of affine continuous model theory.
通过林德斯特伦定理,一阶逻辑(以及类似的连续逻辑)的表达能力并没有在不失去某些有趣特性的情况下得到加强。然而,削弱一阶逻辑的表达能力并不那么无害,而且一些学者已经注意到了这一点。仿射连续逻辑是通过避免连接词$wedge,vee$而得到的连续逻辑片段。这种简化导致连续逻辑的大多数基本工具和技术,如超积构造、紧凑性定理、类型、饱和等的咖啡因化。超积构造的咖啡因变体是超我构造,其中超过滤器被最大有限可加概率度量所取代。这种放宽的结果是,至少有两个元素的紧凑结构现在有了适当的基本扩展。特别是,它们在新的环境中具有非分类理论。因此,我们为研究这类结构提供了一个模型论框架。这种逻辑的一个更显著的方面是,类型空间是紧凑的凸集。极值类型在仿射理论的研究中起着至关重要的作用。在本文中,我们将介绍仿射连续模型理论的基础。
{"title":"Elements of affine model theory","authors":"Seyed-Mohammad Bagheri","doi":"arxiv-2408.03555","DOIUrl":"https://doi.org/arxiv-2408.03555","url":null,"abstract":"By Lindstr\"{o}m's theorems, the expressive power of first order logic (and\u0000similarly continuous logic) is not strengthened without losing some interesting\u0000property. Weakening it, is however less harmless and has been payed attention\u0000by some authors. Affine continuous logic is the fragment of continuous logic\u0000obtained by avoiding the connectives $wedge,vee$. This reduction leads to the\u0000affinization of most basic tools and technics of continuous logic such as the\u0000ultraproduct construction, compactness theorem, type, saturation etc. The\u0000affine variant of the ultraproduct construction is the ultramean construction\u0000where ultrafilters are replaced with maximal finitely additive probability\u0000measures. A consequence of this relaxation is that compact structures with at\u0000least two elements have now proper elementary extensions. In particular, they\u0000have non-categorical theories in the new setting. Thus, a model theoretic\u0000framework for study of such structures is provided. A more remarkable aspect of\u0000this logic is that the type spaces are compact convex sets. The extreme types\u0000then play a crucial role in the study of affine theories. In this text, we\u0000present the foundations of affine continuous model theory.","PeriodicalId":501306,"journal":{"name":"arXiv - MATH - Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141945523","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
Solovay reducibility implies S2a-reducibility 索洛维还原性意味着 S2a 还原性
Pub Date : 2024-08-07 DOI: arxiv-2408.04074
Ivan Titov
The original notion of Solovay reducibility was introduced by Robert M.Solovay (unpublished notes) in 1975 as a measure of relative randomness. The S2a-reducibility introduced by Xizhong Zheng and Robert Rettinger(DOI:10.1007/978-3-540-27798-9_39) in 2004 is a modification of Solovayreducibility suitable for computably approximable (c.a.) reals. We demonstrate that Solovay reducibility implies S2a-reducibility on the setof c.a. reals, even with the same constant, but not vice versa.
索洛维可还原性的最初概念是由罗伯特-索洛维(Robert M.Solovay)(未发表的笔记)于1975年提出的,作为一种相对随机性的度量。郑锡忠和罗伯特-雷廷格(DOI:10.1007/978-3-540-27798-9_39)于 2004 年提出的 S2a-reducibility 是对索洛维可简化性的修改,适用于可计算近似(c.a. )的实数。我们证明了索洛维可简化性意味着 c.a. 复数集上的 S2a 可简化性,即使使用同一个常数也是如此,反之亦然。
{"title":"Solovay reducibility implies S2a-reducibility","authors":"Ivan Titov","doi":"arxiv-2408.04074","DOIUrl":"https://doi.org/arxiv-2408.04074","url":null,"abstract":"The original notion of Solovay reducibility was introduced by Robert M.\u0000Solovay (unpublished notes) in 1975 as a measure of relative randomness. The S2a-reducibility introduced by Xizhong Zheng and Robert Rettinger\u0000(DOI:10.1007/978-3-540-27798-9_39) in 2004 is a modification of Solovay\u0000reducibility suitable for computably approximable (c.a.) reals. We demonstrate that Solovay reducibility implies S2a-reducibility on the set\u0000of c.a. reals, even with the same constant, but not vice versa.","PeriodicalId":501306,"journal":{"name":"arXiv - MATH - Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141969401","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