Generalizing The Morley Trisector and Various Theorems with Realizability Computations

TL;DR

This paper presents an algorithmic approach to prove plane geometry theorems, including a generalization of Morley's theorem, by translating geometric constraints into a satisfiability framework for transparent proofs.

Contribution

It introduces a realizability computation method that generalizes Morley's theorem and other classical results through constraint satisfaction techniques.

Findings

Algorithmic proofs of geometric theorems

Generalization of Morley's theorem

Transparent, constraint-based proofs

Abstract

An approach is shown that proves various theorems of plane geometry in an algorithmic manner. The approach affords transparent proofs of a generalization of the Theorem of Morley and other well known results by casting them in terms of constraint satisfaction.