On extensions of $L{\omega \omega }(Q1)$

Notre Dame Journal of Formal Logic 22 (1):85-93 (1981)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1305/ndjfl/1093883342

Links

PhilArchive



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

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

On sets of relations definable by addition.James F. Lynch - 1982 - Journal of Symbolic Logic 47 (3):659-668.
Almost everywhere domination.Natasha L. Dobrinen & Stephen G. Simpson - 2004 - Journal of Symbolic Logic 69 (3):914-922.
On the Relationship Between ID^_.Jeremy Avigad - unknown
An ordinal partition avoiding pentagrams.Jean A. Larson - 2000 - Journal of Symbolic Logic 65 (3):969-978.
Models with the ω-property.Roman Kossak - 1989 - Journal of Symbolic Logic 54 (1):177-189.
Models of ${\rm Th}(\langle \omega^\omega<\rangle)$.John W. Rosenthal - 1974 - Notre Dame Journal of Formal Logic 15 (1):122-132.
A cardinality version of biegel's nonspeedup theorem.James C. Owings - 1989 - Journal of Symbolic Logic 54 (3):761-767.
Bounds for the closure ordinals of essentially monotonic increasing functions.Andreas Weiermann - 1993 - Journal of Symbolic Logic 58 (2):664-671.
Generalized R-Cohesiveness and the Arithmetical Hierarchy: A Correction to "Generalized Cohesiveness".Carl G. Jockusch & Tamara J. Lakins - 2002 - Journal of Symbolic Logic 67 (3):1078 - 1082.
Syntax and Semantics of the Logic $\mathcal{L}^\lambda_{\omega\omega}$.Carsten Butz - 1997 - Notre Dame Journal of Formal Logic 38 (3):374-384.
On the Indecomposability of $\omega^{n}$.Jared R. Corduan & François G. Dorais - 2012 - Notre Dame Journal of Formal Logic 53 (3):373-395.
Filters, Cohen sets and consistent extensions of the erdös-dushnik-Miller theorem.Saharon Shelah & Lee J. Stanley - 2000 - Journal of Symbolic Logic 65 (1):259-271.
Infinite numbers are large finite numbers.Jeremy Gwiazda - unknown

Analytics

Added to PP
2010-08-24

Downloads
14 (#968,362)

6 months
9 (#295,075)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Henkin and function quantifiers.Michael Krynicki & Jouko Väänänen - 1989 - Annals of Pure and Applied Logic 43 (3):273-292.
Games and Lindström Theorems.Cheng Liao - 2023 - Logica Universalis 17 (1):1-21.

Add more citations

References found in this work

No references found.

Add more references