Count(ifq) does not imply Count

Annals of Pure and Applied Logic 90 (1-3):1-56 (1997)
  Copy   BIBTEX

Abstract

It is shown that the elementary principles Count and Count are logically independent in the system IΔ0 of Bounded Arithmetic. More specifically it is shown that Count implies Count exactly when each prime factor in p is a factor in q

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,590

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Count(q) versus the pigeon-hole principle.Søren Riis - 1997 - Archive for Mathematical Logic 36 (3):157-188.
We Do Not Count by Identity.David Liebesman - 2015 - Australasian Journal of Philosophy 93 (1):21-42.

Analytics

Added to PP
2014-01-16

Downloads
14 (#264,824)

6 months
3 (#1,723,834)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Søren Riis
Roskilde University

Citations of this work

The complexity of propositional proofs.Nathan Segerlind - 2007 - Bulletin of Symbolic Logic 13 (4):417-481.

Add more citations

References found in this work

Bounded arithmetic, propositional logic, and complexity theory.Jan Krajíček - 1995 - New York, NY, USA: Cambridge University Press.
¹1-formulae on finite structures.M. Ajtai - 1983 - Annals of Pure and Applied Logic 24 (1):1.

View all 7 references / Add more references