A Non‐Representation Theorem for Gödel‐Bernays Set Theory

Mathematical Logic Quarterly 16 (6):341-345 (1970)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

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

On a Subtheory of the Bernays‐Gödel Set Theory.Jannis Manakos - 1989 - Mathematical Logic Quarterly 35 (5):413-414.
Eine Bemerkung zur Bernays‐Gödel‐Mengenlehre.E. Burger - 1958 - Mathematical Logic Quarterly 4 (12‐16):178-179.
A generalization of the Dual Ellentuck Theorem.Lorenz Halbeisen & Pierre Matet - 2003 - Archive for Mathematical Logic 42 (2):103-128.
The Converse to a Metatheorem in Gödel Set Theory.Richard A. Platek - 1971 - Mathematical Logic Quarterly 17 (1):21-22.
The Converse to a Metatheorem in Gödel Set Theory.Richard A. Platek - 1971 - Mathematical Logic Quarterly 17 (1):21-22.
A Gödel Theorem on Network Complexity Lower Bounds.C. P. Schnorr - 1986 - Mathematical Logic Quarterly 32 (19‐24):377-384.
A note on the first incompleteness theorem.Katsumasa Ishii - 2003 - Mathematical Logic Quarterly 49 (2):214-216.
The Representation of Cardinals in Models of Set Theory.Erik Ellentuck - 1968 - Mathematical Logic Quarterly 14 (7-12):143-158.

Analytics

Added to PP
2013-11-24

Downloads
13 (#1,044,693)

6 months
6 (#702,272)

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