On Church’s thesis in cubical assemblies-Reference-Cited by-同舟云学术

On Church’s thesis in cubical assemblies

Published:2021-11 Issue:10 Volume:31 Page:1185-1204
ISSN:0960-1295
Container-title:Mathematical Structures in Computer Science
language:en
Short-container-title:Math. Struct. Comp. Sci.

Author:

Swan Andrew W.^ORCID,Uemura Taichi^ORCID

Abstract

AbstractWe show that Church’s thesis, the axiom stating that all functions on the naturals are computable, does not hold in the cubical assemblies model of cubical type theory. We show that nevertheless Church’s thesis is consistent with univalent type theory by constructing a lex modality in cubical assemblies such that Church’s thesis holds in the corresponding reflective subuniverse.

Publisher

Cambridge University Press (CUP)

Subject

Computer Science Applications,Mathematics (miscellaneous)

Reference22 articles.

1. Uemura, T. (2019). Cubical assemblies, a univalent and impredicative universe and a failure of propositional resizing. In: Dybjer, P., Santo, J. E. and Pinto, L. (eds.) 24th International Conference on Types for Proofs and Programs (TYPES 2018), Leibniz International Proceedings in Informatics (LIPIcs), vol. 130, Dagstuhl, Germany, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 7:1–7:20.

2. van den Berg, B. (2006). Predicative Topos Theory and Models for Constructive Set Theory. Phd thesis, University of Utrecht.

3. Constructive sheaf models of type theory;Coquand;Mathematical Structures in Computer Science,2021

4. Gambino, N. and Hyland, M. (2004). Wellfounded trees and dependent polynomial functors. In: Berardi, S., Coppo, M. and Damiani, F. (eds.) Types for Proofs and Programs: International Workshop, TYPES 2003, Torino, Italy, April 30–May 4, 2003, Revised Selected Papers, Berlin, Heidelberg, Springer, 210–225.

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. “Upon This Quote I Will Build My Church Thesis”;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08

2. The compatibility of the minimalist foundation with homotopy type theory;Theoretical Computer Science;2024-04