1322 search results - page 49 / 265 » Unsound Theorem Proving |
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
The trace subshift of a cellular automaton is the subshift of all possible columns that may appear in a space-time diagram. We prove the undecidability of a rather large class of p...
DCG
2002
13 years 7 months ago
2002
In this paper we study the topology of transversals to a family of convex sets as a subset of a Grassmanian manifold. This topology seems to be ruled by a combinatorial structure w...
CAS
1999
13 years 7 months ago
1999
In this paper, we formalize and prove the statement that coincidences cannot be accidental, a statement that underlies many useful heuristics in mathematics and physics. Our proof...
CADE
2006
Springer
14 years 8 months ago
2006
Springer
Abstract. We extend our previous study of the automatic construction of isomorphic classification theorems for algebraic domains by considering the isotopy equivalence relation. Is...
IJCAI
1997
13 years 9 months ago
1997
Theoremsin automated theorem proving are usually proved by logical formal proofs. However,there is a subset of problems which humanscan prove in a different wayby the use of geome...