14084 search results - page 226 / 2817 » A Theory for Game Theories |
187
click to vote
MST
2007
15 years 6 months ago
2007
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Edalat–Potts in type theory. We choose the constructive type theory extended with coind...
197
click to vote
CIKM
2010
Springer
15 years 5 months ago
2010
Springer
The probabilistic formalism of quantum physics is said to provide a sound basis for building a principled information retrieval framework. Such a framework can be based on the not...
182
click to vote
WRLA
2010
15 years 5 months ago
2010
For a rewrite theory to be executable, its equations E should be (ground) confluent and terminating modulo the given axioms A, and their rules should be (ground) coherent with E m...
189
click to vote
ENTCS
2011
15 years 1 months ago
2011
The past decade has seen a remarkable resurgence of the old programme of finding more or less a priori axioms for the mathematical framework of quantum mechanics. The new impetus...
139
click to vote
CADE
2005
Springer
16 years 7 months ago
2005
Springer
Abstract. We describe methods for automated theorem proving in extensional type theory with primitive equality. We discuss a complete, cut-free sequent calculus as well as a compac...