Stability and stable groups in continuous logic
英文摘要：
We develop several aspects of local and global stability in continuous first order logic. In particular, we study type-definable groups and genericity.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
相关论文
Continuous first order logic and local stability
We develop continuous first order logic, a variant of the logic described in \cite{Chang-Keisler:ContinuousModelTheory}. We show that this logic has the same power of expression as the framework of open Hausdorff cats, and as such extends Henson's logic for Banach space structures. We conclude with the development of local stability, for which this logic is particularly well-suited.
math.LO
通过可定义过滤获得预传递逻辑的稳定公理规则和公式
Stable Canonical Rules and Formulas for Pre-transitive Logics via Definable Filtration
Institute for Logic, Language and Computation, University of Amsterdam（阿姆斯特丹大学逻辑、语言与计算研究所）
本文通过可定义过滤方法，推广了稳定公理规则和公式理论，将K4的公理化结果推广到预传递逻辑K4^{m+1}_1，并研究了相关逻辑的性质。
math.LO
Amenability, extreme amenability, model-theoretic stability, and dependence property in integral logic
This paper has three parts. First, we study and characterize amenable and extremely amenable topological semigroups in terms of invariant measures using integral logic. We prove definability of some properties of a topological semigroup such as amenability and the fixed point on compacta property. Second, we define types and develop local stability in the framework of integral logic. For a stable formula $ϕ$, we prove definability of all complete $ϕ$-types over models and deduce from this the fundamental theorem of stability. Third, we study an important property in measure theory, Talagrand's…
math.LO
直观模态逻辑的稳定公理规则
Stable Canonical Rules for Intuitionistic Modal Logics
本文研究了直观模态逻辑的稳定公理规则，证明了多结论推论关系可由稳定公理规则 axiomatize，并以此证明了Blok-Esakia定理的替代证明及扩展，同时解决了Dummett-Lemmon猜想。
math.LO
Dependence Logic in Pregeometries and $ω$-Stable Theories
University of Helsinki（赫尔辛基大学）；University of Amsterdam（阿姆斯特丹大学）
We present a framework for studying the concept of independence in a general context covering database theory, algebra and model theory as special cases. We show that well-known axioms and rules of independence for making inferences concerning basic atomic independence statements are complete with respect to a variety of semantics. Our results show that the uses of independence concepts in as different areas as database theory, algebra and model theory, can be completely characterized by the same axioms. We also consider concepts related to independence, such as dependence.
math.LO
Stability and Paradox in Algorithmic Logic
Type-free systems of logic are designed to consistently handle significant instances of self-reference. Some consistent type-free systems also have the feature of allowing the sort of general abstraction or comprehension principle that infamously leads to paradox in naive set theory. Because type-free systems possess these features, and avoid the hierarchy of types that is felt to be unnatural in some contexts, they have the potential to play an important role in the foundations of mathematics, the theory of classes (producing a richer notion of class than that currently used in set theory and…
math.LO
更多相关论文收起更多论文
Strong Completeness and the Finite Model Property for Bi-Intuitionistic Stable Tense Logics
Bi-Intuitionistic Stable Tense Logics (BIST Logics) are tense logics with a Kripke semantics where worlds in a frame are equipped with a pre-order as well as with an accessibility relation which is 'stable' with respect to this pre-order. BIST logics are extensions of a logic, BiSKt, which arose in the semantic context of hypergraphs, since a special case of the pre-order can represent the incidence structure of a hypergraph. In this paper we provide, for the first time, a Hilbert-style axiomatisation of BISKt and prove the strong completeness of BiSKt. We go on to prove strong completeness of…
cs.LOmath.LO
affine逻辑中的稳定性
Stability in affine logic
Université Claude Bernard Lyon 1（里昂第一大学）；Institut Camille Jordan（卡米尔·让研究所）；Université Paris Cité（巴黎西岱大学）；CNRS IMJ-PRG（法国国家科学研究中心 IMJ-PRG）
本文研究了 affine逻辑中稳定性理论的基础，证明了稳定性在直接积分下的保持性，并推导了极值模型稳定性与理论稳定性之间的关系。
math.FAmath.LO
通过稳定典范规则的Blok-Esakia定理
Blok-Esakia Theorems via Stable Canonical Rules
本文基于稳定典范规则提出统一方法，获Blok-Esakia定理等替代证明，可推广至丰富符号集，还证明双超直觉等规则系统的类似定理及KM与GL扩展规则系统的同构。
math.LO
Definable operators on stable set lattices
A fundamental result from Boolean modal logic states that a first-order definable class of Kripke frames defines a logic that is validated by all of its canonical frames. We generalise this to the level of non-distributive logics that have a relational semantics provided by structures based on polarities. Such structures have associated complete lattices of stable subsets, and these have been used to construct canonical extensions of lattice-based algebras. We study classes of structures that are closed under ultraproducts and whose stable set lattices have additional operators that are first-…
math.LO
On pp elimination and stability in a continuous setting
We generalize pp elimination for modules, or more generally abelian structures, to a continuous logic environment where the abelian structure is equipped with a homomorphism to a compact (Hausdorff) group. We conclude that the continuous logic theory of such a structure is stable.
math.LO
稳定性逻辑：反事实推理中相似性的形式化
A Logic of Stability: Formalizing Similarity in Counterfactual Reasoning
本文针对反事实推理中可能世界的相似性问题，提出量化相似程度的超度量方法，开发并公理化多模态相似性逻辑\ud835\udc4b\ud835\udc5b\ud835\udc5f，证明其可靠性与完备性，建立超度量语义与反事实理论的联系。
math.LO
连续逻辑中的一般稳定测度与远端正则性
Generically Stable Measures and Distal Regularity in Continuous Logic
该研究将经典逻辑的相关结论推广至连续逻辑框架，在NIP度量理论中发展生成稳定与光滑Keisler测度理论，给出其等价刻画，并结合弱正交性结果与切割引理，得到远端正则性与强Erdős-Hajnal性质的解析版本。
math.COmath.LO
非初等模态逻辑，假设 P ≠ NP
Elementary modal logics and circuit complexity
Institute for Logic, Language and Computation, University of Amsterdam（逻辑、语言与计算研究所，阿姆斯特丹大学）
本文证明有限公理化初等模态逻辑的有效性问题属于P，并利用图论复杂性结果，在假设P≠NP下构造无限多个非初等的K4-稳定逻辑，条件性否定回答开放问题。
math.LO
模与无穷逻辑
Modules and Infinitary Logics
The Hebrew University of Jerusalem（耶路撒冷希伯来大学）；Rutgers, The State University of New Jersey（新泽西州立罗格斯大学）
本文证明了阿贝尔群和R-模的理论在无穷逻辑中具有稳定性，并得到了一定程度的理解。
math.LO
更精细地切割：通过细分构造在模态逻辑中获得有限模型属性
Chopping More Finely: Finite Countermodels in Modal Logic via the Subdivision Construction
Institute for Logic, Language and Computation, University of Amsterdam（阿姆斯特丹大学逻辑、语言与计算研究所）
本文提出细分构造法，用于证明广泛模态逻辑和规则系统的有限模型属性，通过构建有限模态空间和代数作为反例，揭示了NExt(K4)中一种度为1的联合分裂类。
math.LO
仿射逻辑与积分算子的结合
Affine logic with the integration operator
Tarbiat Modares University（塔比阿特·莫达雷斯大学）
本文提出了仿射积分逻辑，扩展了仿射连续逻辑，并通过两种方法证明了紧致性定理，同时给出了证明系统和完备性定理，利用Keisler-Shelah同构定理的变体来表征非分叉扩展。
math.LO
泛型稳定性与收敛模式
Generic Stability and Modes of Convergence
该研究在经典与连续逻辑中探究泛型稳定型/测度，分析其与随机化及型/测度收敛模式的联系，推进相关逻辑领域研究。
math.LO
Generic stability and stability
We prove two results about generically stable types $p$ in arbitrary theories. The first, on existence of strong germs, generalizes results from D. Haskell, E. Hrushovski and D. Macpherson on stably dominated types. The second is an equivalence of forking and dividing, assuming generic stability of $p^{(m)}$ for all $m$. We use the latter result to answer in full generality a question posed by Hasson and Onshuus: If $p(x)\in S(B)$ is stable and does not fork over $A$ then $p\restriction A$ is stable. (They had solved some special cases.)
math.LO
Topometric characterization of type spaces in continuous logic
We show that a topometric space $X$ is topometrically isomorphic to a type space of some continuous first-order theory if and only if $X$ is compact and has an open metric (i.e., satisfies that $\{p : d(p,U) < \varepsilon\}$ is open for every open $U$ and $\varepsilon > 0$). Furthermore, we show that this can always be accomplished with a stable theory.
math.LO
