1888 search results - page 26 / 378 » Proof theory and computational analysis |
88
Voted
SYNTHESE
2010
14 years 11 months ago
2010
Though pictures are often used to present mathematical arguments, they are not typically thought to be an acceptable means for presenting mathematical arguments rigorously. With re...
107
click to vote
CADE
2003
Springer
16 years 25 days ago
2003
Springer
We describe the integration of permutation group algorithms with proof planning. We consider eight basic questions arising in computational permutation group theory, for which our ...
80
Voted
CORR
2004
Springer
15 years 11 days ago
2004
Springer
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
95
Voted
STOC
2007
ACM
16 years 25 days ago
2007
ACM
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
110
Voted
HICSS
2003
IEEE
15 years 5 months ago
2003
IEEE
This conceptual paper suggests how Politeness Theory [6] – well known in anthropological and linguistic literatures – can contribute to the study of role relations in computer...