P01 INCOMPLETENESS: finite set equations

Abstract

Let R Õ [1,n]3k ¥ [1,n]k. We define R = {y Œ [1,n]k:($xŒA3)(R(x,y))}. We say that R is strictly dominating if and only if for all x,yŒ[1,n]k, if R(x,y) then max(x) < max(y).

Links

PhilArchive



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

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

Similar books and articles

Rings which admit elimination of quantifiers.Bruce I. Rose - 1978 - Journal of Symbolic Logic 43 (1):92-112.
Hardy–Sobolev–Maz’ya inequalities for polyharmonic operators.Qiaohua Yang - 2021 - Annali di Matematica Pura Ed Applicata 200 (6):2561-2587.
On the space of morphisms into generic real algebraic varieties.Riccardo Ghiloni - 2006 - Annali della Scuola Normale Superiore di Pisa- Classe di Scienze 5 (3):419-438.
Proofs of regular identities.Ewa Graczynska & Francis Pastijn - 1981 - Bulletin of the Section of Logic 10 (1):35-37.
Characterization of recursively enumerable sets.Jesse B. Wright - 1972 - Journal of Symbolic Logic 37 (3):507-511.
Definability of types, and pairs of o-minimal structures.Anand Pillay - 1994 - Journal of Symbolic Logic 59 (4):1400-1409.

Analytics

Added to PP
2010-12-22

Downloads
141 (#135,939)

6 months
141 (#28,474)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references