Hostname: page-component-cd9895bd7-jn8rn Total loading time: 0 Render date: 2024-12-25T19:09:55.086Z Has data issue: false hasContentIssue false
  • English
  • Français

Fragments of first order logic, I: universal Horn logic

Published online by Cambridge University Press:  12 March 2014

George F. McNulty
George F. McNulty*
Affiliation:
University of South Carolina, Columbia, South Carolina 29208
Get access Rights & Permissions [Opens in a new window]

Extract

Let L be any finitary language. By restricting our attention to the universal Horn sentences of L and appealing to a semantical notion of logical consequence, we can formulate the universal Horn logic of L. The present paper provides some theorems about universal Horn logic that serve to distinguish it from the full first order predicate logic. Universal Horn equivalence between structures is characterized in two ways, one resembling Kochen's ultralimit theorem. A sharp version of Beth's definability theorem is established for universal Horn logic by means of a reduced product construction. The notion of a consistency property is relativized to universal Horn logic and the corresponding model existence theorem is proven. Using the model existence theorem another proof of the definability result is presented. The relativized consistency properties also suggest a syntactical notion of proof that lies entirely within the universal Horn logic. Finally, a decision problem in universal Horn logic is discussed. It is shown that the set of universal Horn sentences preserved under the formation of homomorphic images (or direct factors) is not recursive, provided the language has at least two unary function symbols or at least one function symbol of rank more than one.

This paper begins with a discussion of how algebraic relations between structures can be used to obtain fragments of a given logic. Only two such fragments seem to be under current investigation: equational logic and universal Horn logic. Other fragments which seem interesting are pointed out.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 42 , Issue 2 , June 1977 , pp. 221 - 237
Copyright
Copyright © Association for Symbolic Logic 1977

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Abakumov, A. I., Palyutin, E. A., Taitslin, M. A. and Shishmarev, Yu. E., Categorical quasivarieties, Algebra and Logic, vol. 11 (1972), pp. 1–20.Google Scholar
[2]Baldwin, J. and Lachlan, A., On universal Horn classes categorical on some infinite power, Algebra Universalis, vol 3 (1973), pp. 98–111.Google Scholar
[3]Birkhoff, G., On the structure of abstract algebras, Proceedings of the Cambridge Philosophical Society, vol. 31 (1935), pp. 433–454.Google Scholar
[4]Boone, W. W., Cannonito, F. B. and Lyndon, R. C. (Editors), Word problems, decision problems and the Burnside problem in group theory, North-Holland, Amsterdam, 1973.Google Scholar
[5]Chang, C. C. and Keisler, H. J., Model theory, North-Holland, Amsterdam, 1973.Google Scholar
[6]Chang, C. C. and Morel, A. C., On closure under direct product, this Journal, vol. 23 (1958), pp. 149–154.Google Scholar
[7]Frayne, T. E., Morel, A. C. and Scott, D. S., Reduced direct products, Fundamente Mathematical vol. 51 (1962), pp. 195–228.CrossRefGoogle Scholar
[8]Friedman, H., The complexity of explicit definitions, Advances in Mathematics (to appear).Google Scholar
[9]Fujiwara, T., On the construction of the least universal Horn class containing a given class, Osaka Journal of Mathematics, vol. 8 (1971), pp. 425–436.Google Scholar
[10]Galvin, F., Horn sentences, Annals of Mathematical Logic, vol. 1 (1970), pp. 389–422.Google Scholar
[11]Givant, S., Doctoral Thesis, University of California, Berkeley, 1975.Google Scholar
[12]Grätzer, G., On polynomial algebras and free algebras, Canadian Journal of Mathematics, vol. 20 (1968), pp. 575–581.Google Scholar
[13]Grätzer, G. and Lakser, H., Some new relations on operators in general, and for pseudocomplemented distributive lattices in particular, Notices of the American Mathematical Society, vol. 17 (1970), p. 642.Google Scholar
[14]Herrmann, C. and Poguntke, W., Axiomatic classes of lattices of normal subgroups, Algebra Universalis, 1975.Google Scholar
[15]Kashiwagi, T., On (m, A)-implicational classes, Mathematica Japonicae, vol. 17 (1972), pp. 1–12.Google Scholar
[16]Keisler, H. J., Model theory for infinitary logic, North-Holland, Amsterdam, 1971.Google Scholar
[17]Lindström, P., On relations between structures, Theoria, vol. 57 (1965), pp. 253–272.Google Scholar
[18]Lyndon, R. C., Properties preserved under homomorphism, Pacific Journal of Mathematics, vol. 9 (1959), pp. 143–154.CrossRefGoogle Scholar
[19]Makkai, M., Svenonius sentences and Lindström 's theory of regular relations, Fundamenta Mathematicae, vol 73 (1972), pp. 219–233.Google Scholar
[20]Makkai, M., An Application of a method of Smullyan to logics on admissible sets, Bulletin de l'Académie Polonaise des Sciences, vol. 17 (1969), pp. 341–346.Google Scholar
[21]Makkai, M. and McNulty, G., Universal Horn axiom systems for lattice of submodules, Algebra Universalis (to appear).Google Scholar
[22]Mal'cev, A. I., The metamathematics of algebraic systems (translated and edited by Wells, B. F. III), North-Holland, Amsterdam, 1971.Google Scholar
[23]Mal'cev, A. I., Algebraic systems, Springer-Verlag, Berlin, 1973.Google Scholar
[24]Mal'cev, A. I., Tozdestvennye sootnosenija na mnogoobruzijah kvazigrupp, Matematičeskiǐ Sbornik. Sovaja Serija. vol. 69 (111) (1966), pp. 2–12; (translations: American Mathematical Society, Translations, (2), vol. 82 (1969), pp. 225–235; also [21, Chapter 29]).Google Scholar
[25]Mal'cev, A. I., Kvaziprimitivnye klassy abstractnyh algebr, Doklady Akademii Nauk SSSR, vol. 108 (1956), pp. 187–189; (translations: [21, Chapter 4]; see also [22, Chapter V]).Google Scholar
[26]McKenzie, R., On spectra and the negative solution to the decision problem for identities having a finite nontrivial model, this Journal, vol. 40 (1975), pp. 186–196.Google Scholar
[27]McKinsey, J. C. C., The decision problem for some classes of sentences without quantifiers, this Journal, vol. 8 (1943), pp. 61–76.Google Scholar
[28]McNulty, G. F., The decision problem for equational bases of algebras, Annals of Mathematical Logic (to appear).Google Scholar
[29]Selman, A., Completeness of calculi for axiomatically defined classes of algebras, Algebra Universalis, vol. 2 (1972), pp. 20–32.Google Scholar
[30]Smullyan, R., A unifying principle in quantification theory, Proceedings of the National Academy of Sciences of the U.S.A., vol. 49 (1963), pp. 828–832.CrossRefGoogle Scholar
[31]Smullyan, R., First-order logic, Springer-Verlag, New York, 1968.Google Scholar
[32]Tabata, H., A generalized free structure and several properties of universal Horn classes, Mathematica Japonicae, vol. 16 (1971), pp. 91–102.Google Scholar
[33]Tarski, A., Equational logic, Contribution to mathematical logic (Schütte, K., Editor), North-Holland, Amsterdam, 1968, pp. 275–288.Google Scholar