On a theorem of Borsuk
Countable Toronto spaces
A space X is called an α-Toronto space if X is scattered of Cantor-Bendixson rank α and is homeomorphic to each of its subspaces of the same rank. We answer a question of Steprāns by constructing a countable α-Toronto space for each α ≤ ω. We also construct consistent examples of countable α-Toronto spaces for each .
Homotopie des complexes monoïdaux, II
Constructions sur des complexes d'anneaux
Homotopie des complexes monoïdaux, I
Le théorème de Freudenthal, la suite exacte de James et l'invariant de Hopf généralisé
Systèmes de Postnikov et complexes monoïdaux
Comparaison de la bar-construction à la construction et aux complexes
Quasi-essential subsocles of Abelian p-groups
Some key research problems in automated theorem proving for hardware and software verification.
This paper sketches the state of the art in the application of mechanical theorem provers to the verification of commercial computer hardware and software. While the paper focuses on the theorem proving system ACL2, developed by the two authors, it references much related work in formal methods. The paper is intended to satisfy the curiosity of readers interested in logic and artificial intelligence as to the role of mechanized theorem proving in hardware and software design today. In addition,...
An optimal search strategy based on user preferences for choice oriented databases
Page 1