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).

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,219

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.

My notes

Similar books and articles

P 1 INCOMPLETENESS: finite set equations.Harvey M. Friedman - unknown
P01 INCOMPLETENESS: Finite graph theory.Harvey Friedman - manuscript
Some historical perspectives on certain incompleteness phenomena.Harvey Friedman - manuscript
A compactness theorem for linear equations.Robert Cowen & William Emerson - 1996 - Studia Logica 57 (2-3):355 - 357.
Free set algebras satisfying systems of equations.G. Aldo Antonelli - 1999 - Journal of Symbolic Logic 64 (4):1656-1674.
The incompleteness of theories of games.Marcelo Tsuji, Newton C. A. Costa & Francisco A. Doria - 1998 - Journal of Philosophical Logic 27 (6):553-568.
Non-recursiveness of the set of finite sets of equations whose theories are one-based.Douglas D. Smith - 1972 - Notre Dame Journal of Formal Logic 13 (1):135-138.
Fromal statements of Godel's second incompleteness theorem.Harvey Friedman - manuscript
A note on the logic of signed equations.Stephen L. Bloom - 1982 - Studia Logica 41 (1):75 - 81.
Is Incompleteness A Serious Problem?G. Lolli & U. Pagallo - unknown
About finite predicate logic.Herman Dishkant - 1986 - Studia Logica 45 (4):405 - 414.
The ordertype of β-r.E. Sets.Klaus Sutner - 1990 - Journal of Symbolic Logic 55 (2):573-576.
À propos d'équations génériques.Frank O. Wagner - 1992 - Journal of Symbolic Logic 57 (2):548-554.
Nonfinite axiomatizability results for cylindric and relation algebras.Roger D. Maddux - 1989 - Journal of Symbolic Logic 54 (3):951-974.
Finite structural axiomatization of every finite-valued propositional calculus.Zdzis?aw Dywan - 1980 - Studia Logica 39 (1):1 - 4.

Analytics

Added to PP
2010-12-22

Downloads
141 (#127,560)

6 months
2 (#1,182,310)

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