English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We provide a type theoretic treatment of the paper "On Tarski's fixed pointtheorem" by Giovanni Curi. There are benefits to having a type theoreticformulation apart from routine implementation in a proof assistant. By takingadvantage of (higher) inductive types, we can avoid complicated set theoreticconstructions. Arguably, this results in a presentation that is conceptuallyclearer. Additionally, due the predicative admissibility of (higher) inductivetypes we take a step towards the "system independent" derivation that Curicalls for in his conclusion. Finally, we explore a condition on monotone mapsthat guarantees they are `generated' and give an alternative statement of theleast fixed point theorem in terms of this condition.

Tarski's least fixed point theorem: A predicative type theoretic formulation