Journal of Logic and Computation Advance Access published online on April 23, 2008
Journal of Logic and Computation, doi:10.1093/logcom/exn014
Original Papers |
Complete Axiomatization of Discrete-Measure Almost-Everywhere Quantification
Lasige and Dep. Informática, FC, U Lisbon, Portugal E-mail: lcf{at}di.fc.ul.pt
SQIG - Instituto de Telecomunicações and Dep. Matemática, IST, TU Lisbon, Portugal E-mail: jfr{at}math.ist.utl.pt; acs{at}math.ist.utl.pt; css{at}math.ist.utl.pt
Received 9 June 2006.
| Abstract |
|---|
Following recent developments in the topic of generalized quantifiers, and also having in mind applications in the areas of security and artificial intelligence, a conservative enrichment of (two-sorted) first-order logic (FOL) with almost-everywhere quantification is proposed. The completeness of the axiomatization against the measure-heoretic semantics is carried out using a variant of the Lindenbaum–Henkin technique. The independence of the axioms is analysed, and the almost-everywhere quantifier is compared with related notions of generalized quantification. A suitable fragment of the logic is translated to FOL and validity is shown to be preserved.
Keywords: Generalized quantification; almost-everywhere logic; probabilistic logic; measure-theoretic semantics; complete axiomatization