This is a preview of subscription content, log in via an institution to check access.
References
A. Ádám,Truth Functions and the Problem of their Realization by Two-Terminal Graphs, Budapest 1968.
G. Birkhoff andS. MacLane,A Survey of Modern Algebra, The Macmillan Co., New York, 1965.
A. Ehrenfeucht, Practical decidability, (to appear).
N. J. Fine, Binomial coefficients modulo a prime,Amer. Math. Monthly 54 (1947), 589–592.
F. Galvin, Reduced products, Horn sentences, and decision problems,Bull. Amer. Math. Soc. 73 (1967), 59–64.
F. Galvin, Horn sentences,Annals of Math. Logic 1 (1970), 389–422.
L. Hodes andE. Specker, Lengths of formulas and elimination of quantifiers I,Contributions to Mathematical Logic, Proc. Logic Colloquium, Hanover, 1966, Amsterdam, 1968.
S. C. Kleene,Introduction to Metamathematics, Van Nostrand, Princeton, N.J., 1952.
N. E. Kobrinskii andB. A. Trakhtenbrot,Introduction to the Theory of Finite Automata, North Holland, Amsterdam, 1965.
M. Minsky andS. Papert,Perceptrons, an Introduction Computational Geometry, MIT Press, Cambridge, Mass., 1969.
Jan Mycielski, Undefinability of connected sets,Notices Amer. Math. Soc. 17 (1970), 674.
M. Presburger, Über die Vollständigkeit eines gewissen Systems der Arithmetik,Comptes Rendus du I Congrès des Pays Slaves, Warsaw, 1929.
Julia Robinson, Definability and decision problems in arithmetics,J. Symbolic Logic 14 (1949), 98–114.
W. Szmielew, Elementary properties of abelian groups,Fund. Math. 41 (1955), 203–271.
H. Wielandt,Finite Permutation Groups, Academic Press, New York, 1964.
Author information
Authors and Affiliations
Rights 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
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01694182