Skip to main content
SpringerLink
Log in

On boolean functions and connected sets

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. A. Ádám,Truth Functions and the Problem of their Realization by Two-Terminal Graphs, Budapest 1968.

  2. G. Birkhoff andS. MacLane,A Survey of Modern Algebra, The Macmillan Co., New York, 1965.

    Google Scholar 

  3. A. Ehrenfeucht, Practical decidability, (to appear).

  4. N. J. Fine, Binomial coefficients modulo a prime,Amer. Math. Monthly 54 (1947), 589–592.

    Google Scholar 

  5. F. Galvin, Reduced products, Horn sentences, and decision problems,Bull. Amer. Math. Soc. 73 (1967), 59–64.

    Google Scholar 

  6. F. Galvin, Horn sentences,Annals of Math. Logic 1 (1970), 389–422.

    Google Scholar 

  7. L. Hodes andE. Specker, Lengths of formulas and elimination of quantifiers I,Contributions to Mathematical Logic, Proc. Logic Colloquium, Hanover, 1966, Amsterdam, 1968.

  8. S. C. Kleene,Introduction to Metamathematics, Van Nostrand, Princeton, N.J., 1952.

    Google Scholar 

  9. N. E. Kobrinskii andB. A. Trakhtenbrot,Introduction to the Theory of Finite Automata, North Holland, Amsterdam, 1965.

    Google Scholar 

  10. M. Minsky andS. Papert,Perceptrons, an Introduction Computational Geometry, MIT Press, Cambridge, Mass., 1969.

    Google Scholar 

  11. Jan Mycielski, Undefinability of connected sets,Notices Amer. Math. Soc. 17 (1970), 674.

    Google Scholar 

  12. M. Presburger, Über die Vollständigkeit eines gewissen Systems der Arithmetik,Comptes Rendus du I Congrès des Pays Slaves, Warsaw, 1929.

  13. Julia Robinson, Definability and decision problems in arithmetics,J. Symbolic Logic 14 (1949), 98–114.

    Google Scholar 

  14. W. Szmielew, Elementary properties of abelian groups,Fund. Math. 41 (1955), 203–271.

    Google Scholar 

  15. H. Wielandt,Finite Permutation Groups, Academic Press, New York, 1964.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of California, Berkeley, USA

    Ralph McKenzie

  2. University of Colorado, Boulder, USA

    Jan Mycielski

  3. State University of New York, Buffalo, USA

    David Thompson

Authors
  1. Ralph McKenzie
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jan Mycielski
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. David Thompson
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

McKenzie, R., Mycielski, J. & Thompson, D. On boolean functions and connected sets. Math. Systems Theory 5, 259–270 (1971). https://doi.org/10.1007/BF01694182

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01694182

Keywords

Search

Navigation