438 search results - page 21 / 88 » On theorem proving in annotated logics |
102
click to vote
EUSFLAT
2009
14 years 7 months ago
2009
We examine generalizations of random variables and martingales. We prove a new convergence theorem for setvalued martingales. We also generalize a well known characterization of se...
CSL
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. We prove "untyping" theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be d...
CADE
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. While many higher-order interactive theorem provers include a choice operator, higher-order automated theorem provers currently do not. As a step towards supporting autom...
74
Voted
CADE
2003
Springer
15 years 10 months ago
2003
Springer
This paper presents on-going researches on theoretical and practical issues of combining rewriting based automated theorem proving and user-guided proof development, with the stron...
AML
2005
14 years 9 months ago
2005
We perform a proof-theoretical investigation of two modal predicate logics: global intuitionistic logic GI and global intuitionistic fuzzy logic GIF. These logics were introduced b...