DeepAI AI Chat
Log In Sign Up

A computational interpretation of Zorn's lemma

by   Thomas Powell, et al.

We give a computational interpretation to an abstract instance of Zorn's lemma formulated as a wellfoundedness principle in the language of arithmetic in all finite types. This is achieved through Gödel's functional interpretation, and requires the introduction of a novel form of recursion over chain complete partial orders whose existence in the model of total continuous functionals is proven using domain theoretic techniques. We show that a realizer for the functional interpretation of open induction over the lexicographic ordering on sequences follows as a simple application of our main results.


page 1

page 2

page 3

page 4


Sound up-to techniques and Complete abstract domains

Abstract interpretation is a method to automatically find invariants of ...

On the Herbrand Functional Interpretation

We show that the types of the witnesses in the Herbrand functional inter...

Abstract Interpretation on E-Graphs

Recent e-graph applications have typically considered concrete semantics...

On an Interpretation of ResNets via Solution Constructions

This paper first constructs a typical solution of ResNets for multi-cate...

An interpretation of system F through bar recursion

There are two possible computational interpretations of second-order ari...

Combining E-Graphs with Abstract Interpretation

E-graphs are a data structure that compactly represents equivalent expre...