1888 search results - page 55 / 378 » Proof theory and computational analysis |
IMAMS
2007
13 years 8 months ago
2007
Conformal geometry is in the core of pure mathematics. Conformal structure is more flexible than Riemaniann metric but more rigid than topology. Conformal geometric methods have p...
CIE
2005
Springer
14 years 29 days ago
2005
Springer
Abstract. This paper extends the logical approach to computable analysis via Σ–definability to higher type continuous data such as functionals and operators. We employ definab...
STOC
2004
ACM
14 years 7 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
SIGCSE
2006
ACM
14 years 1 months ago
2006
ACM
Case-based analysis is a bottom-up methodology for ethical reasoning. In a teaching environment, it can be a useful alternative to top-down methods, such as Kantianism, utilitaria...
APAL
2010
13 years 7 months ago
2010
A well-known polymodal provability logic GLP is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in...