The Size of a Formula as a Measure of Complexity

In Åsa Hirvonen, Juha Kontinen, Roman Kossak & Andrés Villaveces (eds.), Logic Without Borders: Essays on Set Theory, Model Theory, Philosophical Logic and Philosophy of Mathematics. Boston: De Gruyter. pp. 193-214 (2015)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,197

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

A note on propositional proof complexity of some Ramsey-type statements.Jan Krajíček - 2011 - Archive for Mathematical Logic 50 (1-2):245-255.
Schoonheid in de wiskunde: Birkhoff revisited.J. P. Van Bendegem - 1998 - Tijdschrift Voor Filosofie 60 (1):106-130.
Monotone Proofs of the Pigeon Hole Principle.R. Gavalda, A. Atserias & N. Galesi - 2001 - Mathematical Logic Quarterly 47 (4):461-474.
Strong measure zero sets without Cohen reals.Martin Goldstern, Haim Judah & Saharon Shelah - 1993 - Journal of Symbolic Logic 58 (4):1323-1341.
Is multi-tasking complex?W. Bentley MacLeod - 1998 - Behavioral and Brain Sciences 21 (6):840-841.
Y = 2x vs. Y = 3x.Alexei Stolboushkin & Damian Niwiński - 1997 - Journal of Symbolic Logic 62 (2):661-672.
$Y = 2x$ vs. $y = 3x$.Alexei Stolboushkin & Damian Niwinski - 1997 - Journal of Symbolic Logic 62 (2):661-672.

Analytics

Added to PP
2015-03-31

Downloads
25 (#635,790)

6 months
7 (#437,422)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Jouko A Vaananen
University of Helsinki

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references