226 search results - page 2 / 46 » Extensional Theories and Rewriting |
LICS
1999
IEEE
15 years 2 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...
76
Voted
SLOGICA
2010
14 years 8 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...
75
Voted
ENTCS
2007
14 years 10 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...
78
Voted
CIE
2007
Springer
15 years 4 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...
82
Voted
SARA
2007
Springer
15 years 4 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...