226 search results - page 2 / 46 » Extensional Theories and Rewriting |
LICS
1999
IEEE
13 years 9 months ago
1999
IEEE
We present a new approach to introducing an extensional propositional equality in Intensional Type Theory. Our construction is based on the observation that there is a sound, inte...
SLOGICA
2010
13 years 3 months ago
2010
Abstract. The naive set theory problem is to begin with a full comprehension axiom, and to find a logic strong enough to prove theorems, but weak enough not to prove everything. T...
ENTCS
2007
13 years 5 months ago
2007
Nominal rewriting introduced a novel method of specifying rewriting on syntax-with-binding. We extend this treatment of rewriting with hierarchy of variables representing increasi...
CIE
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We consider an extensional version, called qmTT, of the intensional Minimal Type Theory mTT, introduced in a previous paper with G. Sambin, enriched with proof-irrelevanc...
SARA
2007
Springer
13 years 11 months ago
2007
Springer
Relational databases have had great industrial success in computer science, their power evidenced by theoretical analysis and widespread adoption. Often, automated theorem provers...