Higher-order concepts for the potential infinite

DOI10.1016/j.tcs.2022.12.017OpenAlexW4312082705MaRDI QIDQ2682910

Matthias Eberl

Publication date: 1 February 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.12.017

zbMATH Keywords

potential infinitepotentialismdenotational semantics of lambda calculus

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• The seven virtues of simple type theory
• Constructivism in mathematics. An introduction. Volume I
• Total sets and objects in domain theory
• Higher-Order Computability
• From Coinductive Proofs to Exact Real Arithmetic
• Locally finite theories
• A realizability interpretation of Church's simple theory of types
• Hyperfinite type structures
• A Model Theory for the Potential Infinite
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Higher-order concepts for the potential infinite