A Completeness Proof for A Regular Predicate Logic with Undefined Truth Value

by   Antti Valmari, et al.

We provide a sound and complete proof system for an extension of Kleene's ternary logic to predicates. The concept of theory is extended with, for each function symbol, a formula that specifies when the function is defined. The notion of "is defined" is extended to terms and formulas via a straightforward recursive algorithm. The "is defined" formulas are constructed so that they themselves are always defined. The completeness proof relies on the Henkin construction. For each formula, precisely one of the formula, its negation, and the negation of its "is defined" formula is true on the constructed model. Many other ternary logics in the literature can be reduced to ours. Partial functions are ubiquitous in computer science and even in (in)equation solving at schools. Our work was motivated by an attempt to explain, precisely in terms of logic, typical informal methods of reasoning in such applications.


page 1

page 2

page 3

page 4


About the unification type of simple symmetric modal logics

The unification problem in a normal modal logic is to determine, given a...

Compactly Representing Uniform Interpolants for EUF using (conditional) DAGS

The concept of a uniform interpolant for a quantifier-free formula from ...

Sahlqvist-Type Completeness Theory for Hybrid Logic with Binder

In the present paper, we continue the research in <cit.> to develop the ...

Set-Theoretic Completeness for Epistemic and Conditional Logic

The standard approach to logic in the literature in philosophy and mathe...

Relating Information and Proof

In mathematics information is a number that measures uncertainty (entrop...

Checking Observational Purity of Procedures

Verifying whether a procedure is observationally pure is useful in many ...

Statistical EL is ExpTime-complete

We show that consistency of Statistical EL knowledge bases, as defined b...