{"title":"论选择的逻辑结构和条形归纳法原则","authors":"N. Brede, Hugo Herbelin","doi":"10.1109/LICS52264.2021.9470523","DOIUrl":null,"url":null,"abstract":"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 GDCABT of the axiom of dependent choice and dually a generalised bar induction principle GBIABT such that:GDCABT intuitionistically captures the strength of•the general axiom of choice expressed as ∀a∃bR(a,b) ⇒ ∃α∀aR(a,α(a))) when T is a filter that derives point-wise from a relation R on A × B without introducing further constraints,•the Boolean Prime Filter Theorem / Ultrafilter Theorem if B is the two-element set $\\mathbb{B}$ (for a constructive definition of prime filter),•the axiom of dependent choice if $A = \\mathbb{N}$,•Weak Kőnig’s Lemma if $A = \\mathbb{N}$ and $B = \\mathbb{B}$ (up to weak classical reasoning).GBIABT intuitionistically captures the strength of•Gödel’s completeness theorem in the form validity implies provability for entailment relations if $B = \\mathbb{B}$ (for a constructive definition of validity),•bar induction if $A = \\mathbb{N}$,•the Weak Fan Theorem if $A = \\mathbb{N}$ and $B = \\mathbb{B}$.Contrastingly, even though GDCABT and GBIABT 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}$.","PeriodicalId":174663,"journal":{"name":"2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"On the logical structure of choice and bar induction principles\",\"authors\":\"N. Brede, Hugo Herbelin\",\"doi\":\"10.1109/LICS52264.2021.9470523\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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 GDCABT of the axiom of dependent choice and dually a generalised bar induction principle GBIABT such that:GDCABT intuitionistically captures the strength of•the general axiom of choice expressed as ∀a∃bR(a,b) ⇒ ∃α∀aR(a,α(a))) when T is a filter that derives point-wise from a relation R on A × B without introducing further constraints,•the Boolean Prime Filter Theorem / Ultrafilter Theorem if B is the two-element set $\\\\mathbb{B}$ (for a constructive definition of prime filter),•the axiom of dependent choice if $A = \\\\mathbb{N}$,•Weak Kőnig’s Lemma if $A = \\\\mathbb{N}$ and $B = \\\\mathbb{B}$ (up to weak classical reasoning).GBIABT intuitionistically captures the strength of•Gödel’s completeness theorem in the form validity implies provability for entailment relations if $B = \\\\mathbb{B}$ (for a constructive definition of validity),•bar induction if $A = \\\\mathbb{N}$,•the Weak Fan Theorem if $A = \\\\mathbb{N}$ and $B = \\\\mathbb{B}$.Contrastingly, even though GDCABT and GBIABT 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}$.\",\"PeriodicalId\":174663,\"journal\":{\"name\":\"2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-05-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LICS52264.2021.9470523\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LICS52264.2021.9470523","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
摘要
我们开发了一种选择原则及其对负条形归纳原则的方法,作为将分别有不良和良好基础的性质的“内涵”或“有效”观点与这些性质的“外延”或“理想”观点连接起来的外延性方案。在对非基性和良基性的不同内涵定义之间的关系进行分类和分析之后,我们在函数从a到B的有限近似上,对域a、上域B和“滤波器”T进行了引入,∃α∀aR(a,α(a)))当T是一个从a × b上的关系R点推导而不引入进一步约束的滤波器时,•布尔素数滤波定理/超滤定理,如果b是二元集合$\mathbb{b}$(对于素数的构造定义)•如果$A = \mathbb{N}$的依赖选择公理,•如果$A = \mathbb{N}$和$B = \mathbb{B}$的弱Kőnig引理(直至弱经典推理)。如果$B = \mathbb{B}$(对于有效性的建设性定义),•条形归纳法如果$ a = \mathbb{N}$,•弱扇定理如果$ a = \mathbb{N}$和$B = \mathbb{B}$,则直观地捕捉到•Gödel完备性定理的强度。相比之下,尽管GDCABT和GBIABT平滑地捕获了选择和条形归纳的几个变体,但有些实例是不一致的,例如当A是${\mathbb{B}^{\mathbb{N}}}$而B是$\mathbb{N}$时。
On the logical structure of choice and bar induction principles
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 GDCABT of the axiom of dependent choice and dually a generalised bar induction principle GBIABT such that:GDCABT intuitionistically captures the strength of•the general axiom of choice expressed as ∀a∃bR(a,b) ⇒ ∃α∀aR(a,α(a))) when T is a filter that derives point-wise from a relation R on A × B without introducing further constraints,•the Boolean Prime Filter Theorem / Ultrafilter Theorem if B is the two-element set $\mathbb{B}$ (for a constructive definition of prime filter),•the axiom of dependent choice if $A = \mathbb{N}$,•Weak Kőnig’s Lemma if $A = \mathbb{N}$ and $B = \mathbb{B}$ (up to weak classical reasoning).GBIABT intuitionistically captures the strength of•Gödel’s completeness theorem in the form validity implies provability for entailment relations if $B = \mathbb{B}$ (for a constructive definition of validity),•bar induction if $A = \mathbb{N}$,•the Weak Fan Theorem if $A = \mathbb{N}$ and $B = \mathbb{B}$.Contrastingly, even though GDCABT and GBIABT 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}$.