On Statman's Finite Completeness Theorem

09/07/2023
by   Richard Statman, et al.
0

We give a complete self-contained proof of Statman's finite completeness theorem and of a corollary of this theorem stating that the λ-definability conjecture implies the higher-order matching conjecture.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/25/2023

Binding Logic: proofs and models

We define an extension of predicate logic, called Binding Logic, where v...
research
11/15/2021

Birkhoff's Completeness Theorem for Multi-Sorted Algebras Formalized in Agda

This document provides a formal proof of Birkhoff's completeness theorem...
research
06/06/2023

Fractals from Regular Behaviours

We are interested in connections between the theory of fractal sets obta...
research
02/01/2023

A formalisation of Gallagher's ergodic theorem

Gallagher's ergodic theorem is a result in metric number theory. It stat...
research
04/28/2022

Skolem Meets Schanuel

The celebrated Skolem-Mahler-Lech Theorem states that the set of zeros o...
research
11/15/2018

Revisiting the generalized Łoś-Tarski theorem

We present a new proof of the generalized Łoś-Tarski theorem (GLT(k)) in...
research
08/02/2023

On Bounded Completeness and the L_1-Denseness of Likelihood Ratios

The classical concept of bounded completeness and its relation to suffic...

Please sign up or login with your details

Forgot password? Click here to reset