On the strength of several versions of Dirichlet's (“pigeon-hole”-)principle in the sense of first-order logic

Archive for Mathematical Logic 21 (1):69-76 (1981)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,553

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

Definable combinatorics with dense linear orders.Himanshu Shukla, Arihant Jain & Amit Kuber - 2020 - Archive for Mathematical Logic 59 (5-6):679-701.
On constants and the strict order property.Predrag Tanović - 2006 - Archive for Mathematical Logic 45 (4):423-430.
Count(q) versus the pigeon-hole principle.Søren Riis - 1997 - Archive for Mathematical Logic 36 (3):157-188.
The strength of countable saturation.Benno van den Berg, Eyvind Briseid & Pavol Safarik - 2017 - Archive for Mathematical Logic 56 (5-6):699-711.
Liberated versions ofT, S4, andS5.Charles G. Morgan - 1975 - Archive for Mathematical Logic 17 (3-4):85-90.
Glivenko–Cantelli classes and NIP formulas.Karim Khanaki - 2024 - Archive for Mathematical Logic 63 (7):1005-1031.
Model theory of the inaccessibility scheme.Shahram Mohsenipour - 2011 - Archive for Mathematical Logic 50 (7-8):697-706.

Analytics

Added to PP
2020-12-03

Downloads
6 (#1,704,271)

6 months
3 (#1,498,028)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Pure proof theory aims, methods and results.Wolfram Pohlers - 1996 - Bulletin of Symbolic Logic 2 (2):159-188.

Add more citations

References found in this work

No references found.

Add more references