z-logo
open-access-imgOpen Access
A notion of functional completeness for first-order structure
Author(s) -
Etienne R. A. Temgoua,
Marcel Tonga
Publication year - 2005
Publication title -
international journal of mathematics and mathematical sciences
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 39
eISSN - 1687-0425
pISSN - 0161-1712
DOI - 10.1155/ijmms.2005.2207
Subject(s) - algorithm , artificial intelligence , computer science
Using ☆-congruences and implications, Weaver (1993) introduced the concepts of prevariety and quasivariety of first-order structures as generalizations of the corresponding concepts for algebras. The notion of functional completeness on algebras has been defined and characterized by Burris and Sankappanavar (1981), Kaarli and Pixley (2001), Pixley (1996), and Quackenbush (1981). We study the notion of functional completeness with respect to ☆-congruences. We extend some results on functionally complete algebras to first-order structures A=(A;FA;RA) and find conditions for these structures to have a compatible Pixley function which is interpolated by term functions on suitable subsets of the base set A

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom