Sciweavers

7988 search results - page 130 / 1598
» A Useful Undecidable Theory
Sort
View
TPHOL
2005
IEEE
14 years 3 months ago
A HOL Theory of Euclidean Space
We describe a formalization of the elementary algebra, topology and analysis of finite-dimensional Euclidean space in the HOL Light theorem prover. (Euclidean space is RN with the...
John Harrison
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
14 years 3 months ago
Complexity Theory for Operators in Analysis
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
Akitoshi Kawamura and Stephen Cook
AISC
1998
Springer
14 years 2 months ago
Reasoning About Coding Theory: The Benefits We Get from Computer Algebra
The use of computer algebra is usually considered beneficial for mechanised reasoning in mathematical domains. We present a case study, in the application domain of coding theory, ...
Clemens Ballarin, Lawrence C. Paulson
EDBT
1990
ACM
108views Database» more  EDBT 1990»
14 years 2 months ago
Deductive Databases - Theory Meets Practice
Deductive Databases are coming of age with the emergence of efficient and easy to use systems that support queries, reasoning, and application development on databases through dec...
Carlo Zaniolo
CORR
2010
Springer
137views Education» more  CORR 2010»
13 years 10 months ago
Open Graphs and Monoidal Theories
String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. The distinguishing feature of...
Lucas Dixon, Aleks Kissinger