Discriminator varieties and symbolic computation

DOI10.1016/S0747-7171(08)80089-2zbMath0803.08002MaRDI QIDQ1190748

Stanley N. Burris

Publication date: 26 September 1992

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

symbolic computationequational logiccomputational logicdiscriminator varieties

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Applications of universal algebra in computer science (08A70) Equational logic, Mal'tsev conditions (08B05)

Related Items

Almost structural completeness; an algebraic approach ⋮ Equational treatment of first-order logic ⋮ Computers and universal algebra: Some directions ⋮ Unnamed Item ⋮ Polynomial Time Uniform Word Problems ⋮ Paraconsistent constructive logic with strong negation as a contraction-free relevant logic ⋮ Bounded lattice structured discriminator varieties ⋮ Projectivity and unification in substructural logics of generalized rotations ⋮ The minor order of homomorphisms via natural dualities ⋮ On models of exponentiation. Identities in the HSI-algebra of posets ⋮ Structural and universal completeness in algebra and logic ⋮ New perspectives on semi-primal varieties ⋮ Reduction of Hilbert-type proof systems to the if-then-else equational logic ⋮ Unification in pretabular extensions of S4 ⋮ Projective algebras and primitive subquasivarieties in varieties with factor congruences ⋮ Dual binary discriminator varieties ⋮ Expansions of semi-Heyting algebras. I: Discriminator varieties ⋮ Admissibility of \(\Pi_2\)-inference rules: interpolation, model completion, and contact algebras ⋮ BL-global representations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Refutational theorem proving using term-rewriting systems
• Cylindric algebras. Part II
• Equational methods in first order predicate calculus
• Rewrite method for theorem proving in first order theory with equality
• Embedding Boolean expressions into logic programming
• Unification theory
• Equational compactness in quasi-primal varieties
• Equational theory of algebras with a majority polynomial
• The representation of biregular rings by sheaves
• A representation of generalized Boolean rings
• Generalized ``Boolean theory of universal algebras. I. Subdirect sums and normal representation theorem
• Generalized ``Boolean theory of universal algebras. II. Identities and subdirect sums of functionally complete algebras
• Solvable cases of the decision problem
• Structure theory for algebraic algebras of bounded degree
• Unification in primal algebras, their powers and their varieties
• Varieties of ”If-Then-Else“
• Equational Bases for If–Then–Else
• Decidable discriminator varieties from unary varieties
• On spectra, and the negative solution of the decision problem for identities having a finite nontrivial model
• Sheaf Constructions and Their Elementary Properties
• An equational logic sampler
• A Machine-Oriented Logic Based on the Resolution Principle
• Topological Representation of Algebras
• Subdirect unions in universal algebra
• Post Algebras. I. Postulates and General Theory
• Consistency of the Continuum Hypothesis. (AM-3)

This page was built for publication: Discriminator varieties and symbolic computation