Relative Hilbert-Post Completeness for Exceptions

• Published in: Mathematical Aspects of Computer and Information Sciences pp. 596 - 610
• Main Authors: Dumas, Jean-Guillaume, Duval, Dominique, Ekici, Burak, Pous, Damien, Reynaud, Jean-Claude
• Format: Book Chapter
• Language: English
• Published: Cham Springer International Publishing 2016
• Series: Lecture Notes in Computer Science
• Subjects: Core Language; Exact Linear Algebra; Obvious Conversion; Pure Terms; Syntactic Completeness

A theory is complete if it does not contain a contradiction, while all of its proper extensions do. In this paper, first we introduce a relative notion of syntactic completeness; then we prove that adding exceptions to a programming language can be done in such a way that the completeness of the lan...