Completeness and representation theorem for epistemic states in first-order predicate calculus
Abstract
The aim of this paper is to present a strongly complete first order functional predicate calculus generalized to models containing not only ordinary classical total functions but also arbitrary partial functions. The completeness proof follows Henkin’s approach, but instead of using maximally consistent sets, we define saturated deductively closed consistent sets . This provides not only a completeness theorem but a representation theorem: any SDCCS defines a canonical model which determine a unique partial value for every predicate symbol and any function symbol. Any SDCCS can thus be interpreted as an epistemic state