This paper is in final form and no version of it will be submitted for publication elsewhere.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R. Balbes and Ph. Dwinger [1974], Distributive Lattices, U. of Missouri Press.
N.D. Belnap, Jr. [1976], How a Computer Should Think, in Contemporary Aspects of Philosophy, ed. G. Ryle.
J. Berman and W.J. Blok, [1988] Positive Boolean dependencies, Inf. Processing Letters, 27, 147–150.
J. Berman and W.J. Blok, [1989], Equational Dependencies, Research Report no. 32, Dept. of Math., Stat., and C.S., Univ. of Illinois at Chicago.
J. Berman and M. Mukaidono [1984], Enumerating fuzzy switching functions and free Kleene algebras, Comp. and Math. with Applications10, pp. 25–35.
S. Blamey [1986], Partial Logic, in Handbook of Philosophical Logic, Vol. III, ed. D. Gabbay and F. Guenthner, D. Reidel Pub, pp. 1–70.
D.A. Bochvar [1939], On a 3-valued logical calculus and its application to the analysis of contradictions, (Russian), Math. Sbornik 4, 287–308. Eng. Trans. in Hist. Philos. Logic 2(1981), 87–112.
S. Burris and H.P. Sankappanavar [1981], A Course in Universal Algebra, Graduate Texts in Mathematics, vol. 78, Springer-Verlag.
G. Czédli [1981], On dependencies in the relational model of data, Elektron. Informationsverab. u.Kybernet., 17, 103–112.
J. Demetrovics and Gy. Gyepesi [1983], Some generalized type functional dependencies formalized as equality set on matrices, Discrete Applied Math., 6, 35–47.
M.L. Ginsburg [1987], Multi-valued Logics, I,II,II. preprints.
D. Gries [1981], The Science of Programming, Springer-Verlag.
F. Guzman [1989], The implications in conditional logic, Proceedings of the Conference on Algebra and Computer Science, Iowa State University.
F. Guzman and C. Squier [1989], The algebra of conditional logic, Algebra Universalis, to appear.
D. Hobby and R. McKenzie [1988], The Structure of Finite Algebras, Contemporary Mathematics, 76, Amer. Math. Soc. Pub.
S. Kleene [1952], Introduction to Metamathematics, pp. 332–340, Van Nostrand.
A.D. Korshunov [1981], On the number of monotonic Boolean functions, (Russian), Problemy Kibernetiki 38, 5–108.
D. Maier [1983], The Theory of Relational Databases, Computer Science Press.
J. McCarthy [1963], A basis for a mathematical theory of computation, in Computer Programming and Formal Systems, P. Braffort and D. Hirschberg eds., North-Holland Publishing Co., 33–70.
J. McCarthy [1963a], Predicate calculus with “undefined” as a truth value, Stanford Artificial Intelligence Project, Memo 1, March 1963.
R. McKenzie, G. McNulty and W. Taylor [1987], ALgebras, Lattices, Varieties, vol. 1, Wadsworth.
M. Mukaidono and I.G. Rosenberg [1986], κ-valued functions for treating ambiquities: Their clone and a normal form. 18th Internat. Symposium on Multiple-valued Logic, IEEE.
M. Nagata, M. Nakanishi, and T. Nishimura [1975], Implementation of Łukasiewicz's, Kleene's and McCarthy's 3-valued logics, Sci. Rep. Tokyo Kyoiku Daigaku Sect A 13, no. 347–365, 90–100. Math. Rev.53 #2055.
A. Romanowska and A. Trakul [1989], On the structure of some bilattices, preprint.
Y. Sagiv, C. Delobel, D.S. Parker and R. Fagin [1981], An equivalence between relational database dependencies and a fragment of propositional logic, J. ACM, 28, 435–453. Corrigendum J. ACM, 34(1987), 1016–1018.
D.S. Scott [1973], Models of various type-free calculi, in Logic, Methodology and Philosophy of ScienceIV, ed. P. Suppes et al., North-Holland, 157–187.
A. Szendrei [1986], Clones in Universal Algebra, SMS 99, University of Montreal Press.
W. Taylor [1975], The fine spectrum of a variety, Algebra Universalis, 5, 263–303.
B. Thalheim, [1985], Funktionale Abhängigkeiten in relationalen Datenstrukturen, Elektron. Informationsverarb. u. Kybernet., 21, 23–33.
P.M. Winkler [1980], Classification of algebraic structures by work space, Algebra Universalis11, 320–33.
P.M. Winkler [1983], Polynomial Hyperforms, Algebra Universalis17, 101–109.
I.D. Zaslavskii [1979], Realization of three-valued logical functions by means of recursive and Turing operators. (Russian), Studies in the theory of algorithms and mathematical logic, Nauka, 52–61. Math. Rev.81i:03031.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Berman, J. (1990). The value of free algebras. In: Bergman, C.H., Maddux, R.D., Pigozzi, D.L. (eds) Algebraic Logic and Universal Algebra in Computer Science. ALUACS 1988. Lecture Notes in Computer Science, vol 425. Springer, New York, NY. https://doi.org/10.1007/BFb0043076
Download citation
DOI: https://doi.org/10.1007/BFb0043076
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-97288-6
Online ISBN: 978-0-387-34804-9
eBook Packages: Springer Book Archive