arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2105.08951cs.LO
收藏

关于选择原理和巴归纳原理的逻辑结构

On the logical structure of choice and bar induction principles

University of Potsdam(波茨坦大学)

Nuria Brede, Hugo Herbelin

AI总结:

本文提出了一种广义依赖选择公理和巴归纳原理,用于连接不同视角下的良基性性质,并探讨其在不同条件下的逻辑强度和一致性。

摘要:

我们开发了一种方法,将选择原理及其逆否的巴归纳原理作为扩展性方案,将“内涵”或“有效”视角下的不良和良基性质与“外延”或“理想”视角下的这些性质联系起来。在分类和分析不同内涵定义的不良性和良基性关系之后,我们引入了一个领域A,一个余域B以及一个“滤子”T,该滤子在从A到B的有限近似函数上,提出了一种广义的依赖选择公理GDC_{A,B,T}以及其对偶的广义巴归纳原理GBI_{A,B,T},使得:- GDC_{A,B,T}直觉上捕捉了以下强度:• 一般选择公理以∀a∃βR(a, b) ⇒ ∃α∀a R(α,(a α(a)))的形式表达,当T是一个从关系R在A x B上点wise导出的滤子且不引入进一步的约束时,• 如果B是二元素集B(对于构造性的素滤子定义),则为布尔素滤子定理/超滤子定理,• 如果A = N,则为依赖选择公理,• 如果A = N且B = B,则为弱科尼格引理(在弱经典推理下)- GBI_{A,B,T}直觉上捕捉了以下强度:• 如果B = B,则为哥德尔完备性定理的形式,即有效性蕴含可证性对于蕴含关系,• 当A = N时为巴归纳,• 当A = N且B = B时为弱扇定理。相反,尽管GDC_{A,B,T}和GBI_{A,B,T}能够平滑地捕捉到几种选择和巴归纳的变体,但某些实例是不一致的,例如当A是B^N且B是N时。

英文摘要:

We develop an approach to choice principles and their contrapositive bar-induction principles as extensionality schemes connecting an ''intensional'' or ''effective'' view of respectively ill-and well-foundedness properties to an ''extensional'' or ''ideal'' view of these properties. After classifying and analysing the relations between different intensional definitions of ill-foundedness and well-foundedness, we introduce, for a domain $A$, a codomain $B$ and a ''filter'' $T$ on finite approximations of functions from $A$ to $B$, a generalised form GDC$_{A,B,T}$ of the axiom of dependent choice and dually a generalised bar induction principle GBI$_{A,B,T}$ such that: - GDC$_{A,B,T}$ intuitionistically captures the strength of $\bullet$ the general axiom of choice expressed as $\forall a\existsβR(a, b) \Rightarrow\existsα\forall a R(α,(a α(a)))$ when $T$ is a filter that derives point-wise from a relation $R$ on $A x B$ without introducing further constraints, $\bullet$ the Boolean Prime Filter Theorem / Ultrafilter Theorem if $B$ is the two-element set $\mathbb{B}$ (for a constructive definition of prime filter), $\bullet$ the axiom of dependent choice if $A = \mathbb{N}$, $\bullet$ Weak K{ö}nig's Lemma if $A = \mathbb{N}$ and $B = \mathbb{B}$ (up to weak classical reasoning) - GBI$_{A,B,T}$ intuitionistically captures the strength of $\bullet$ G{ö}del's completeness theorem in the form validity implies provability for entailment relations if $B = \mathbb{B}$, $\bullet$ bar induction when $A = \mathbb{N}$, $\bullet$ the Weak Fan Theorem when $A = \mathbb{N}$ and $B = \mathbb{B}$. Contrastingly, even though GDC$_{A,B,T}$ and GBI$_{A,B,T}$ smoothly capture several variants of choice and bar induction, some instances are inconsistent, e.g. when $A$ is $\mathbb{B}^\mathbb{N}$ and $B$ is $\mathbb{N}$.

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

↑