default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRalph McKenzie
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[j23]Petar Markovic
, Miklós Maróti, Ralph McKenzie:
Finitely Related Clones and Algebras with Cube Terms. Order 29(2): 345-359 (2012)- 2010
- [j22]Jaroslav Jezek, Ralph McKenzie:
Definability in Substructure Orderings, II: Finite Ordered Sets. Order 27(2): 115-145 (2010) - [j21]Pawel M. Idziak, Petar Markovic, Ralph McKenzie, Matthew Valeriote, Ross Willard:
Tractability and Learnability Arising from Algebras with Few Subpowers. SIAM J. Comput. 39(7): 3023-3037 (2010)
2000 – 2009
- 2007
- [c1]Pawel M. Idziak, Petar Markovic, Ralph McKenzie, Matthew Valeriote, Ross Willard:
Tractability and learnability arising from algebras with few subpowers. LICS 2007: 213-224 - 2006
- [j20]Marcel Jackson, Ralph McKenzie:
Interpreting Graph Colorability in Finite Semigroups. Int. J. Algebra Comput. 16(1): 119-140 (2006) - [j19]Kira V. Adaricheva, Ralph McKenzie, Eric Richard Zenk, Miklós Maróti, James B. Nation:
The Jónsson-Kiefer Property. Stud Logica 83(1-3): 111-131 (2006) - 2004
- [j18]Ralph McKenzie, J. Donald Monk:
On some small cardinals for Boolean algebras. J. Symb. Log. 69(3): 674-682 (2004) - [j17]Miklós Maróti, Ralph McKenzie:
Finite basis problems and results for quasivarieties. Stud Logica 78(1-2): 293-320 (2004) - 2003
- [j16]Ralph McKenzie:
The Zig-Zag Property and Exponential Cancellation of Ordered Sets. Order 20(3): 185-221 (2003) - 2001
- [j15]Ralph McKenzie, Japheth Wood:
The Type Set of a Variety is Not Computable. Int. J. Algebra Comput. 11(1): 89-130 (2001) - 2000
- [j14]Jaroslav Jezek, Petar Markovic, Miklós Maróti, Ralph McKenzie:
Equations of tournaments are not finitely based. Discret. Math. 211: 243-248 (2000) - [j13]Ralph McKenzie:
Recursive Inseparability for Residual Bounds of Finite Algebras. J. Symb. Log. 65(4): 1863-1880 (2000) - [j12]Ralph McKenzie:
Arithmetic of Finite Ordered Sets: Cancellation of Exponents, II. Order 17(4): 309-332 (2000)
1990 – 1999
- 1999
- [j11]Ralph McKenzie:
Arithmetic of Finite Ordered Sets: Cancellation of Exponents, I. Order 16(4): 313-333 (1999) - 1996
- [j10]Ralph McKenzie:
The Residual Bounds of Finite Algebras. Int. J. Algebra Comput. 6(1): 1-28 (1996) - [j9]Ralph McKenzie:
The Residual Bound of a Finite Algebra is not Computable. Int. J. Algebra Comput. 6(1): 29-48 (1996) - [j8]Ralph McKenzie:
Tarski's Finite Basis Problem is Undecidable. Int. J. Algebra Comput. 6(1): 49-104 (1996) - 1991
- [j7]Stanley Burris, Ralph McKenzie, Matthew Valeriote:
Decidable Discriminator Varieties from Unary Varieties. J. Symb. Log. 56(4): 1355-1368 (1991)
1980 – 1989
- 1989
- [b1]Ralph McKenzie, Matthew Valeriote:
Structure of decidable locally finite varieties. Progress in mathematics 79, Birkhäuser 1989, ISBN 978-3-7643-3439-0, pp. I-VIII, 1-212 - 1984
- [j6]Joel Berman, Ralph McKenzie:
Clones satisfying the term condition. Discret. Math. 52(1): 7-21 (1984) - 1982
- [j5]Ralph McKenzie, J. Donald Monk:
Chains in Boolean algebras. Ann. Math. Log. 22(2): 137-175 (1982) - 1981
- [j4]Ralph McKenzie, Robert W. Quackenbush:
The spectrum of a lattice-primal algebra. Discret. Math. 35(1-3): 157-163 (1981)
1970 – 1979
- 1975
- [j3]Ralph McKenzie:
On Spectra, and the Negative Solution of the Decision Problem for Identities having a Finite Nontrivial Model. J. Symb. Log. 40(2): 186-196 (1975) - 1971
- [j2]Ralph McKenzie:
Negative Solution of the Decision Problem for Sentences True in Every Subalgebra of < N, + >. J. Symb. Log. 36(4): 607-609 (1971) - [j1]Ralph McKenzie, Jan Mycielski, David Thompson:
On Boolean Functions and Connected Sets. Math. Syst. Theory 5(3): 259-270 (1971)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:52 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
