arXiv 1609.059762016-09-20math.LOmath.GN

Tangled Closure Algebras

Robert Goldblatt, Ian Hodkinson

发表信息：: Categories and General Algebraic Structures with Applications, Volume 7, 2017, pp. 9-31, http://cgasa.ir/volume_5757.html

英文摘要：

The tangled closure of a collection of subsets of a topological space is the largest subset in which each member of the collection is dense. This operation models a logical `tangle modality' connective, of significance in finite model theory. Here we study an abstract equational algebraic formulation of the operation which generalises the McKinsey-Tarski theory of closure algebras. We show that any dissectable tangled closure algebra, such as the algebra of subsets of any metric space without isolated points, contains copies of every finite tangled closure algebra. We then exhibit an example of a tangled closure algebra that cannot be embedded into any complete tangled closure algebra, so it has no MacNeille completion and no spatial representation.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

模态μ演算的空间逻辑与缠结算子

Spatial logic of modal mu-calculus and tangled closure operators

该研究将McKinsey和Tarski的拓扑模态逻辑成果拓展至模态μ演算与缠结算子逻辑，证明二者在拓扑空间上表达力等价，建立了相关逻辑的有限模型性质，拓展了剖分引理，得到多种语言在自稠密度量空间上的完备性与可靠性结果。

2016-03-05cs.LOmath.LO

A Sheaf Model of the Algebraic Closure

In constructive algebra one cannot in general decide the irreducibility of a polynomial over a field K. This poses some problems to showing the existence of the algebraic closure of K. We give a possible constructive interpretation of the existence of the algebraic closure of a field in characteristic 0 by building, in a constructive metatheory, a suitable site model where there is such an algebraic closure. One can then extract computational content from this model. We give examples of computation based on this model.

2014-09-11math.LO

具有极值关系的深度二闭包代数：其框架、逻辑与结构完备性

Closure algebras of depth two with extremal relations: Their frames, logics, and structural completeness

本文研究典范关系为两层且层级限制为恒等或全关系的有限闭包代数所生成的簇，刻画了相应深度二框架的逻辑及其结构完备性。

2023-09-19math.LO

On computable aspects of algebraic and definable closure

We investigate the computability of algebraic closure and definable closure with respect to a collection of formulas. We show that for a computable collection of formulas of quantifier rank at most $n$, in any given computable structure, both algebraic and definable closure with respect to that collection are $Σ^0_{n+2}$ sets. We further show that these bounds are tight.

2021-01-28cs.LOmath.LO

Lattice of closure endomorphisms of a Hilbert algebra

A closure endomorphism of a Hilbert algebra A is a mapping that is simultaneously an endomorphism of and a closure operator on A. It is known that the set CE of all closure endomorphisms of A is a distributive lattice where the meet of two elements is defined pointwise and their join is given by their composition. This lattice is shown in the paper to be isomorphic to the lattice of certain filters of A, anti-isomorphic to the lattice of certain closure retracts of A, and compactly generated. The set of compact elements of CE coincides with the adjoint semilattice of A, conditions under which …

2017-01-14math.LOmath.RA

Baire闭包及其逻辑

The Baire closure and its logic

本文研究拓扑空间X的Baire代数的闭包算子，证明其模态逻辑为S5，并给出稠密且完全可度量或局部紧Hausdorff情形下的可靠性与强完备性，且S5的扩张对应子代数。

2023-12-31math.LO

更多相关论文收起更多论文

不含有限域的代数闭包的正特征函数域上的Hilbert第十问题

Hilbert's Tenth Problem over Function Fields of Positive Characteristic Not Containing the Algebraic Closure of a Finite Field

证明了特征$p> 0$的函数域$K$的存在性理论在环语言中是不可判定的，只要常量域不包含有限域的代数闭包.我们还将高超越度函数域的不可判定性证明推广到特征2，并证明了正特征{ \bf any}函数域的一阶理论在无参环语言中是不可判定的.

2013-06-11math.LOmath.NT

Lefschetz扩张、紧闭包和大Cohen-Macaulay代数

Lefschetz extensions, tight closure, and big Cohen-Macaulay algebras

我们以弱函子的方式将每一个等特征零Noether局部环$R$关联到一个忠实平坦的环扩张，它是具有各种素特征的环的超积.由于这样的超积自然携带非标准的Frobenius，我们可以通过模仿紧闭包的正特征函数定义来定义$R$上的一个新的紧闭包运算。该方法避免了广义Néron去奇异化的使用，仅依赖于Rotthaus关于特征零点的Artin逼近的结果。如果$R$是等维泛悬链线的，那么我们也可以用规范的、弱函子的方式把它与平衡的大Cohen-Macaulay代数联系起来。

2004-11-16math.ACmath.LO

一阶逻辑的纤维化泛代数

Fibered Universal Algebra for First-Order Logics

本文扩展 Lawvere-Pitts prop-范畴，为非经典一阶逻辑构建代数语义，并刻画两类对应 Birkhoff 及 Blok-Jónsson 定理的一阶闭包算子。

2023-06-01math.LO

Ordinal analysis of partial combinatory algebras

For every partial combinatory algebra (pca), we define a hierarchy of extensionality relations using ordinals. We investigate the closure ordinals of pca's, i.e. the smallest ordinals where these relations become equal. We show that the closure ordinal of Kleene's first model is $ω_1^\textit{CK}$ and that the closure ordinal of Kleene's second model is $ω_1$. We calculate the exact complexities of the extensionality relations in Kleene's first model, showing that they exhaust the hyperarithmetical hierarchy. We also discuss embeddings of pca's.

2021-09-16cs.LOmath.LO