In this paper we answer the following well-known open question in computable model theory. Does there exist a computable not ℵ0-categorical saturated structure with a unique com...
Bakhadyr Khoussainov, Pavel Semukhin, Frank Stepha...
Abstract. We address the problem of term normalisation modulo associativecommutative (AC) theories, and describe several techniques for compiling many-to-one AC matching and reduce...
The abstraction inherent in most specifications and the need to specify nondeterministic programs are two well-known sources of nondeterminism in formal specifications. In this pap...
Set theories are traditionally based on first-order logic. We show that in a constructive setting, basing a set theory on a dependent logic yields many benefits. To this end, we...
Abstract— Chierchia [2, 3, 4], pointed out the inadequacy of Montague’s approach in the analysis of certain natural language constructions, such as nominalization and propositi...