This paper presents a new take on how argument dependencies in natural language are established and constrained. The paper starts with a rather standard view that (quantificationa...
The timestamps of now-relative bitemporal databases are modeled as growing, shrinking, or rectangular regions. The shape of these regions makes it a challenge to design bitemporal...
This paper addresses the crucial issue in the design of a proof development system of how to deal with partial functions and the related question of how to treat undefined terms. ...
An oversight in Guaspari and Solovay's "Rosser sentences" (1979, Ann. Math. Log., 16, 81) is pointed out and emended. It concerns the premisses of their proof that ...
We introduce the notion of non-malleable noninteractive zero-knowledge (NIZK) proof systems. We show how to transform any ordinary NIZK proof system into one that has strong non-m...