Skip to main content

On Logical Method for Counting Dedekind Numbers

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2138))

Included in the following conference series:

Abstract

A description of the property of monotonicity of Boolean functions using propositional calculus is presented, which allows to use #SAT algorithms for computing Dedekind numbers. Using an obvious modification of Davis-Putnam satisfiability algorithm, Dedekind numbers until the seventh have been calculated. Standard arithmetization of propositional logic allows to deduce Kisielewicz’s formula in more transparent way.

Supported in part by Estonian Science Foundation grant no. 3056

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Davis, M., Putnam, H.: A computing procedure for quantification theory. J. Assoc. Comput. Mach. 7 (1960) 201–215

    MATH  MathSciNet  Google Scholar 

  2. R. Dedekind, R.: Über Zerlegungen von Zahlen durch ihre grossten gemeinsamen Teiler. Festschrift der Technischen Hochschule zu Braunschweig bei Gelegenheit der 69 Versammlung Deutscher Naturforscher und Ärzte (1897) 1–40

    Google Scholar 

  3. Kisielewicz, A.: A solution of Dedekind’s problem on the number of isotone Boolean functions. J. reine angew. Math. 386 (1988) 139–144

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tombak, M., Isotamm, A., Tamme, T. (2001). On Logical Method for Counting Dedekind Numbers. In: Freivalds, R. (eds) Fundamentals of Computation Theory. FCT 2001. Lecture Notes in Computer Science, vol 2138. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44669-9_48

Download citation

  • DOI: https://doi.org/10.1007/3-540-44669-9_48

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42487-1

  • Online ISBN: 978-3-540-44669-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics