Proofs without syntax
Annals of mathematics, Tome 164 (2006) no. 3, pp. 1065-1076
Proofs are traditionally syntactic, inductively generated objects. This paper presents an abstract mathematical formulation of propositional calculus (propositional logic) in which proofs are combinatorial (graph-theoretic), rather than syntactic. It defines a combinatorial proof of a proposition $\phi$ as a graph homomorphism $h:C\to G(\phi)$, where $G(\phi)$ is a graph associated with $\phi$ and $C$ is a coloured graph. The main theorem is soundness and completeness: $\,\phi$ is true if and only if there exists a combinatorial proof $h:C\to G(\phi)$.
@article{10_4007_annals_2006_164_1065,
author = {Dominic J. D. Hughes},
title = {Proofs without syntax},
journal = {Annals of mathematics},
pages = {1065--1076},
year = {2006},
volume = {164},
number = {3},
doi = {10.4007/annals.2006.164.1065},
mrnumber = {2259253},
zbl = {1130.03009},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.4007/annals.2006.164.1065/}
}
Dominic J. D. Hughes. Proofs without syntax. Annals of mathematics, Tome 164 (2006) no. 3, pp. 1065-1076. doi: 10.4007/annals.2006.164.1065
Cité par Sources :