A Non‐Boolean Version of Feferman‐Vaught's Theorem

Mathematical Logic Quarterly 31 (19‐20):299-308 (1985)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

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

A Non-Boolean Version of Feferman-Vaught's Theorem.R. Lavendhomme & Th Lucas - 1985 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 31 (19-20):299-308.
Definability and automorphisms in abstract logics.Xavier Caicedo - 2004 - Archive for Mathematical Logic 43 (8):937-945.
Rado's selection lemma does not imply the Boolean prime ideal theorem.Paul E. Howard - 1984 - Mathematical Logic Quarterly 30 (9‐11):129-132.
Algebraic closure without choice.Bernhard Banaschewski - 1992 - Mathematical Logic Quarterly 38 (1):383-385.
Algebraic Closure Without Choice.Bernahrd Banschewski - 1992 - Mathematical Logic Quarterly 38 (1):383-385.
Variations of Rado's lemma.Paul Howard - 1993 - Mathematical Logic Quarterly 39 (1):353-356.

Analytics

Added to PP
2013-12-09

Downloads
9 (#1,269,748)

6 months
5 (#838,466)

Historical graph of downloads
How can I increase my downloads?

References found in this work

No references found.

Add more references