AI Chat AI Image Generator AI Video Text to Speech

Finitary-based Domain Theory in Coq: An Early Report

01/17/2018

∙

by Moez A. AbdelGawad, et al.

∙

∙

In domain theory every finite computable object can be represented by a single mathematical object instead of a set of objects, using the notion of finitary-basis. In this article we report on our effort to formalize domain theory in Coq in terms of finitary-basis.

page 1

page 2

page 3

page 4

research

∙ 10/31/2020

Partial Functions and Recursion in Univalent Type Theory

We investigate partial functions and computability theory from within a ...

0 Cory Knapp, et al. ∙

research

∙ 05/11/2023

How Much Partiality Is Needed for a Theory of Computability?

Partiality is a natural phenomenon in computability that we cannot get a...

0 Dieter Spreen, et al. ∙

research

∙ 04/13/1999

A Computer Scientist's View of Life, the Universe, and Everything

Is the universe computable? If so, it may be much cheaper in terms of in...

0 Juergen Schmidhuber, et al. ∙

research

∙ 07/23/2021

Formalizing Galois Theory

We describe a project to formalize Galois theory using the Lean theorem ...

0 Thomas Browning, et al. ∙

research

∙ 06/28/2022

Computation as uncertainty reduction: a simplified order-theoretic framework

Although there is a somewhat standard formalization of computability on ...

0 Pedro Hack, et al. ∙

research

∙ 06/30/2020

Frege's theory of types

There is a widespread assumption in type theory that the discipline begi...

0 Bruno Bentzen, et al. ∙

research

∙ 01/22/2023

The umbilical cord of finite model theory

Model theory was born and developed as a part of mathematical logic. It ...

0 Yuri Gurevich, et al. ∙