Algebra and Logic

, Volume 42, Issue 2, pp 105–111

Degree Spectra of Relations on Boolean Algebras

  • S. S. Goncharov
  • R. G. Downey
  • D. R. Hirschfeldt
Article

Abstract

We show that every computable relation on a computable Boolean algebra \(\mathfrak{B}\) is either definable by a quantifier-free formula with constants from \(\mathfrak{B}\) (in which case it is obviously intrinsically computable) or has infinite degree spectrum.

computable Boolean algebra computable relation intrinsically computable relation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Plenum Publishing Corporation 2003

Authors and Affiliations

  • S. S. Goncharov
    • 1
  • R. G. Downey
    • 2
  • D. R. Hirschfeldt
    • 3
  1. 1.Akademika Koptyuga Prospekt, 4Institute of Mathematics SB RASNovosibirsk
  2. 2.School of Mathematical and Computing SciencesVictoria UniversityWellingtonNew Zealand
  3. 3.Department of MathematicsUniversity of ChicagoUSA

Personalised recommendations