Ralph Freese
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Ralph Freese has a total of 36 co-authors. Here are the top co-authors by number of shared publications:
- James B. Nation
Department of Mathematics, University of Hawaii, Honolulu, USA
4 shared publications Alan Day
Lakehead University
2 shared publications- Matt Valeriote
McMaster University
2 shared publications - William DeMeo
Department of Mathematics Iowa State University in Ames Iowa USA
2 shared publications András P. Huhn
University of Hawaii
1 shared publication- Brian A. Davey
La Trobe University
1 shared publication
Latest Publications
- 12 January 2024
- Published by Springer Nature in Algebra universalis
- Vol. 85 (1) , 1-18
Finitely based congruence varieties
- 12 January 2024
- Published by Springer Nature in Algebra universalis
- Vol. 85 (1) , 1-18
Finitely based congruence varieties
- Open Access
- 23 April 2022
- Published by Springer Nature in Algebra universalis
- Vol. 83 (2) , 1-18
Free-lattice functors weakly preserve epi-pullbacks
Supposep(x, y, z) andq(x, y, z) are terms. If there is a common “ancestor” term $$s(z_{1},z_{2},z_{3},z_{4})$$ specializing topandqthrough identifying some variables $$\begin{aligned} p(x,y,z)&\approx s(x,y,z,z)\\ q(x,y,z)&\approx s(x,x,y,z), \end{aligned}$$ then the equation $$\begin{aligned} p(x,x,z)\approx q(x,z,z) \end{aligned}$$ is a trivial consequence. In this note we show that for lattice terms, and more generally for terms of lattice-ordered algebras, a converse is true, too. Given termsp, q, and an equation where $$\{u_{1},\ldots ,u_{m}\}=\{v_{1},\ldots ,v_{n}\},$$ there is always an “ancestor term” $$s(z_{1},\ldots ,z_{r})$$ such that $$p(x_{1},\ldots ,x_{m})$$ and $$q(y_{1},\ldots ,y_{n})$$ arise as substitution instances ofs, whose unification results in the original equation ( $$*$$ ). In category theoretic terms the above proposition, when restricted to lattices, has a much more concise formulation:Free-lattice functors weakly preserve pullbacksof epis. Finally, we show thatweakpreservation is all that we can hope for. We prove that for an arbitrary idempotent variety $${{\mathcal {V}}}$$ the free-algebra functor $$F_{{\mathcal {V}}}$$ will notpreservepullbacks of epis unless $${{\mathcal {V}}}$$ is trivial (satisfying $$x\approx y$$ ) or $${{\mathcal {V}}}$$ contains the “variety of sets” (where all operations are implemented as projections).- 23 April 2022
- Published by Springer Nature in Algebra universalis
- Vol. 83 (2) , 1-18
Open AccessFree-lattice functors weakly preserve epi-pullbacks
Supposep(x, y, z) andq(x, y, z) are terms. If there is a common “ancestor” term $$s(z_{1},z_{2},z_{3},z_{4})$$ specializing topandqthrough identifying some variables $$\begin{aligned} p(x,y,z)&\approx s(x,y,z,z)\\ q(x,y,z)&\approx s(x,x,y,z), \end{aligned}$$ then the equation $$\begin{aligned} p(x,x,z)\approx q(x,z,z) \end{aligned}$$ is a trivial consequence. In this note we show that for lattice terms, and more generally for terms of lattice-ordered algebras, a converse is true, too. Given termsp, q, and an equation where $$\{u_{1},\ldots ,u_{m}\}=\{v_{1},\ldots ,v_{n}\},$$ there is always an “ancestor term” $$s(z_{1},\ldots ,z_{r})$$ such that $$p(x_{1},\ldots ,x_{m})$$ and $$q(y_{1},\ldots ,y_{n})$$ arise as substitution instances ofs, whose unification results in the original equation ( $$*$$ ). In category theoretic terms the above proposition, when restricted to lattices, has a much more concise formulation:Free-lattice functors weakly preserve pullbacksof epis. Finally, we show thatweakpreservation is all that we can hope for. We prove that for an arbitrary idempotent variety $${{\mathcal {V}}}$$ the free-algebra functor $$F_{{\mathcal {V}}}$$ will notpreservepullbacks of epis unless $${{\mathcal {V}}}$$ is trivial (satisfying $$x\approx y$$ ) or $${{\mathcal {V}}}$$ contains the “variety of sets” (where all operations are implemented as projections). - Open Access
Polynomial-time Tests for Difference Terms in Idempotent Varieties
We consider the following practical question: given a finite algebra A in a finite language, can we efficiently decide whether the variety generated by A has a difference term? We answer this question (positively) in the idempotent case and then describe algorithms for constructing difference term operations.
Open AccessPolynomial-time Tests for Difference Terms in Idempotent Varieties
We consider the following practical question: given a finite algebra A in a finite language, can we efficiently decide whether the variety generated by A has a difference term? We answer this question (positively) in the idempotent case and then describe algorithms for constructing difference term operations.
- 26 August 2019
- Published by World Scientific Pub Co Pte Ltd in International Journal of Algebra and Computation
- Vol. 29 (06) , 927-949
Polynomial-time tests for difference terms in idempotent varieties
We consider the following practical question: given a finite algebra [ ] in a finite language, can we efficiently decide whether the variety generated by [ ] has a difference term? We answer this question (positively) in the idempotent case and then describe algorithms for constructing difference term operations.
- 26 August 2019
- Published by World Scientific Pub Co Pte Ltd in International Journal of Algebra and Computation
- Vol. 29 (06) , 927-949
Polynomial-time tests for difference terms in idempotent varieties
We consider the following practical question: given a finite algebra [ ] in a finite language, can we efficiently decide whether the variety generated by [ ] has a difference term? We answer this question (positively) in the idempotent case and then describe algorithms for constructing difference term operations.
- 14 March 2018
- Published by Springer Nature in Order
- Vol. 36 (1) , 65-76
Testing for a Semilattice Term
- 14 March 2018
- Published by Springer Nature in Order
- Vol. 36 (1) , 65-76
Testing for a Semilattice Term
- 10 January 2017
- Published by Springer Nature in Algebra universalis
- Vol. 77 (1) , 29-50
Maltsev families of varieties closed under join or Maltsev product
- 10 January 2017
- Published by Springer Nature in Algebra universalis
- Vol. 77 (1) , 29-50
Maltsev families of varieties closed under join or Maltsev product
- 11 June 2014
- Published by Springer Nature in Order
- Vol. 32 (2) , 245-254
Projective Ordinal Sums of Lattices and Isotone Sections
- 11 June 2014
- Published by Springer Nature in Order
- Vol. 32 (2) , 245-254
Projective Ordinal Sums of Lattices and Isotone Sections
- Open Access
- 27 September 2013
- Published by Springer Nature in Algebra universalis
- Vol. 70 (4) , 347-357
Equations implying congruence n-permutability and semidistributivity
- 27 September 2013
- Published by Springer Nature in Algebra universalis
- Vol. 70 (4) , 347-357
Open AccessEquations implying congruence n-permutability and semidistributivity
- 4 November 2008
- Published by Springer Nature in Algebra universalis
- Vol. 59 (3-4) , 337-343
Computing congruences efficiently
- 4 November 2008
- Published by Springer Nature in Algebra universalis
- Vol. 59 (3-4) , 337-343
Computing congruences efficiently
- 1 August 2006
- Published by Springer Nature in Algebra universalis
- Vol. 55 (2-3) , 119-125
A modular inherently nonfinitely based lattice
- 1 August 2006
- Published by Springer Nature in Algebra universalis
- Vol. 55 (2-3) , 119-125
A modular inherently nonfinitely based lattice