Single identities for lattice theory and for weakly associative lattices

McCune, W; Padmanabhan, R

doi:10.2172/510566

Title: Single identities for lattice theory and for weakly associative lattices

Full Record
Other Related Research

Abstract

We present a single identity for the variety of all lattices that is much simpler than those previously known to us. We also show that the variety of weakly associative lattices is one-based, and we present a generalized one-based theorem for subvarieties of weakly associative lattices that can be defined with absorption laws. The automated theorem-proving program OTTER was used in substantial way to obtain the results.

Authors:

McCune, W ^[1]; Padmanabhan, R ^[2]

Argonne National Lab., IL (United States)
Univ. of Manitoba, Winnipeg (Canada). Dept. of Mathematics

Publication Date:: Mon Mar 13 00:00:00 EST 1995

Research Org.:: Argonne National Lab. (ANL), Argonne, IL (United States)

Sponsoring Org.:: USDOE Office of Energy Research, Washington, DC (United States)

OSTI Identifier:: 510566

Report Number(s):: ANL/MCS/PP-86040
ON: DE97008386; TRN: 97:004773

DOE Contract Number:: W-31109-ENG-38

Resource Type:: Technical Report

Resource Relation:: Other Information: PBD: 13 Mar 1995

Country of Publication:: United States

Language:: English

Subject:: 99 MATHEMATICS, COMPUTERS, INFORMATION SCIENCE, MANAGEMENT, LAW, MISCELLANEOUS; LATTICE FIELD THEORY; EQUATIONS; ALGEBRA

Citation Formats


                    McCune, W, and Padmanabhan, R. Single identities for lattice theory and for weakly associative lattices.  United States: N. p., 1995. 
        Web.  doi:10.2172/510566.

Copy to clipboard


                    McCune, W, & Padmanabhan, R. Single identities for lattice theory and for weakly associative lattices.  United States.  https://doi.org/10.2172/510566

Copy to clipboard


                    McCune, W, and Padmanabhan, R. 1995.  
        "Single identities for lattice theory and for weakly associative lattices".  United States.  https://doi.org/10.2172/510566.  https://www.osti.gov/servlets/purl/510566.

Copy to clipboard


                    
@article{osti_510566,

  title        = {Single identities for lattice theory and for weakly associative lattices},

  author       = {McCune, W and Padmanabhan, R},

  abstractNote = {We present a single identity for the variety of all lattices that is much simpler than those previously known to us. We also show that the variety of weakly associative lattices is one-based, and we present a generalized one-based theorem for subvarieties of weakly associative lattices that can be defined with absorption laws. The automated theorem-proving program OTTER was used in substantial way to obtain the results.},

  doi          = {10.2172/510566},

  url          = {https://www.osti.gov/biblio/510566},
  journal      = {},
number       = ,

  volume       = ,

  place        = {United States},

  year         = {Mon Mar 13 00:00:00 EST 1995},

  month        = {Mon Mar 13 00:00:00 EST 1995}

}

Copy to clipboard

Technical Report:

View Technical Report (0.69 MB)

https://doi.org/10.2172/510566

Save / Share:

Export Metadata

Save to My Library

Similar records in OSTI.GOV collections:

Once More on the Lattice of Subvarieties of the Wreath Product of the Variety of Semilattices and the Variety of Semigroups with Zero Multiplication

Journal Article

It is known that the monoid wreath product of any two semigroup varieties that are atoms in the lattice of all semigroup varieties may have a finite as well as an infinite lattice of subvarieties. If this lattice is finite, then as a rule it has at most eleven elements. This was proved in a paper of the author in 2007. The exclusion is the monoid wreath product Sl w N{sub 2} of the variety of semilattices and the variety of semigroups with zero multiplication. The number of elements of the lattice L(Sl w N{sub 2}) of subvarieties of Slmore »« less
https://doi.org/10.1007/S10958-018-3961-3
An entry in the 1992 Overbeek theorem-proving contest

Technical Report Lusk, E; McCune, W

The Conference on Automated Deduction (CADE) has been for nearly twenty years a meeting where both theoreticians and system implementors present their work. Feeling perhaps that the conference was becoming dominated by the theoreticians, Ross Overbeek proposed at CADE-10 in 1990 a contest to stimulate work on the implementation and use of theorem-proving systems. The challenge was to prove a set of theorems, and do so with a uniform approach. That is, it was not allowed to set parameters in the system to specialize it for individual problems. There were actually two separate contests, one represented by a set ofmore »« less
https://doi.org/10.2172/10114594

Full Text Available
An entry in the 1992 Overbeek theorem-proving contest

Technical Report Lusk, E.; McCune, W.

The Conference on Automated Deduction (CADE) has been for nearly twenty years a meeting where both theoreticians and system implementors present their work. Feeling perhaps that the conference was becoming dominated by the theoreticians, Ross Overbeek proposed at CADE-10 in 1990 a contest to stimulate work on the implementation and use of theorem-proving systems. The challenge was to prove a set of theorems, and do so with a uniform approach. That is, it was not allowed to set parameters in the system to specialize it for individual problems. There were actually two separate contests, one represented by a set ofmore »« less
https://doi.org/10.2172/6940861

Full Text Available
The application of automated reasoning to proof translation and to finding proofs with specified properties: A case study in many-valued sentential calculus

Technical Report Wos, L; McCune, W

In both mathematics and logic, many theorems exist such that each can be proved in entirely different ways. For a striking example, there exist theorems from group theory that can be proved by relying solely on equality and (from the viewpoint of automated reasoning) the use of paramodulation, but can also be proved in a notation in which equality is totally absent and the inference rule is condensed detachment (captured with a single clause and the rule hyperresolution). A study of such examples immediately shows how far from obvious is the problem of producing a proof in one system evenmore »« less
Appendix: Conjectures concerning proof, design, and verification.

Conference Wos, L

This article focuses on an esoteric but practical use of automated reasoning that may indeed be new to many, especially those concerned primarily with verification of both hardware and software. Specifically, featured are a discussion and some methodology for taking an existing design -- of a circuit, a chip, a program, or the like--and refining and improving it in various ways. Although the methodology is general and does not require the use of a specific program, McCune's program OTTER does offer what is needed. OTTER has played and continues to play the key role in my research, and an interestedmore »« less
https://doi.org/10.1007/3-540-44659-1_33

Full Text Available

Similar Records