Boolean pairs formed by the Δn0-sets

Annals of Pure and Applied Logic 87 (2):145-149 (1997)
  Copy   BIBTEX

Abstract

It will be shown that for all numbers n and m with n > m 1 the Boolean pairs have undecidable elementary theories

Links

PhilArchive



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

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

Boolean pairs formed by the< i> Δ_< sub> n< sup> 0-sets.E. Herrmann - 1997 - Annals of Pure and Applied Logic 87 (2):145-149.
The Boolean algebra of objectives.Boguslaw Wolniewicz - 1981 - Bulletin of the Section of Logic 10 (1):17-22.
Definable sets in Boolean ordered o-minimal structures. II.Roman Wencel - 2003 - Journal of Symbolic Logic 68 (1):35-51.
Fine hierarchies and Boolean terms.V. L. Selivanov - 1995 - Journal of Symbolic Logic 60 (1):289-317.
Exact Pairs for Abstract Bounded Reducibilities.Wolfgang Merkle - 1999 - Mathematical Logic Quarterly 45 (3):343-360.
Two consistency results on set mappings.Péter Komjáth & Saharon Shelah - 2000 - Journal of Symbolic Logic 65 (1):333-338.
Boolean algebra and syllogism.V. A. Bocharov - 1986 - Synthese 66 (1):35 - 54.
Regular ideals and Boolean pairs.Lutz Heindorf - 1984 - Mathematical Logic Quarterly 30 (35):547-560.

Analytics

Added to PP
2014-01-16

Downloads
10 (#1,160,791)

6 months
3 (#1,023,809)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations