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

&
Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 31 (19-20):299-308 (1985)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19850311904

Links

PhilArchive



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

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

A Non‐Boolean Version of Feferman‐Vaught's Theorem.R. Lavendhomme & Th Lucas - 1985 - Mathematical Logic Quarterly 31 (19‐20):299-308.
Algorithmic uses of the Feferman–Vaught Theorem.J. A. Makowsky - 2004 - Annals of Pure and Applied Logic 126 (1-3):159-213.
A direct proof of the Feferman-Vaught theorem and other preservation theorems in products.Yiannis Vourtsanis - 1991 - Journal of Symbolic Logic 56 (2):632-636.
The Vaught Conjecture: Do Uncountable Models Count?John T. Baldwin - 2007 - Notre Dame Journal of Formal Logic 48 (1):79-92.
Definability and automorphisms in abstract logics.Xavier Caicedo - 2004 - Archive for Mathematical Logic 43 (8):937-945.
On a theorem of Feferman.Michael Detlefsen - 1980 - Philosophical Studies 38 (2):129 - 140.
Some remarks on openly generated Boolean algebras.Sakaé Fuchino - 1994 - Journal of Symbolic Logic 59 (1):302-310.
On essentially low, canonically well-generated Boolean algebras.Robert Bonnet & Matatyahu Rubin - 2002 - Journal of Symbolic Logic 67 (1):369-396.
Arithmetization of metamathematics in a general setting.Solomon Feferman with with R. L. Vaught - manuscript
The first order properties of products of algebraic systems.Solomon Feferman with with R. L. Vaught - manuscript
Vaught's theorem on axiomatizability by a scheme.Albert Visser - 2012 - Bulletin of Symbolic Logic 18 (3):382-402.
The First Order Properties of Products of Algebraic Systems.S. Feferman & R. L. Vaught - 1967 - Journal of Symbolic Logic 32 (2):276-276.
Review: R. L. Vaught, Sentences True in all Constructive Models. [REVIEW]S. Feferman - 1966 - Journal of Symbolic Logic 31 (1):132-132.
Every recursive boolean algebra is isomorphic to one with incomplete atoms.Rod Downey - 1993 - Annals of Pure and Applied Logic 60 (3):193-206.
A Boolean model of ultrafilters.Thierry Coquand - 1999 - Annals of Pure and Applied Logic 99 (1-3):231-239.

Analytics

Added to PP
2015-12-02

Downloads
23 (#664,515)

6 months
1 (#1,510,037)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

No references found.

Add more references