Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-16T09:46:45.582Z Has data issue: false hasContentIssue false

Weak cardinality theorems†

Published online by Cambridge University Press:  12 March 2014

Till Tantau*
Affiliation:
Fakultät für Elektrotechnik und Informatik, Technische Universität Berlin, Berlin, GermanyE-mail:, tantau@cs.tu-berlin.de

Abstract

Kummer's Cardinality Theorem states that a language A must be recursive if a Turing machine can exclude for any n words , …, one of the n + 1 possibilities for the cardinality of {, …, }⋂ A. There was good reason to believe that this theorem is a peculiarity of recursion theory: neither the Cardinality Theorem nor weak forms of it hold for resource-bounded computational models like polynomial time. This belief may be flawed. In this paper it is shown that weak cardinality theorems hold for finite automata and also for other models. An explanation is proposed as to why recursion-theoretic and automata-theoretic weak cardinality theorems hold, but not corresponding 'middle-ground theorems': The recursion- and automata-theoretic weak cardinality theorems are instantiations of purely logical weak cardinality theorems. The logical theorems can be instantiated for logical structures characterizing recursive computations and finite automata computations. A corresponding structure characterizing polynomial time computations does not exist.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2005

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable