default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStanley Burris
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[j20]Stanley N. Burris, Hanamantagouda P. Sankappanavar:
The Horn theory of Boole's partial algebras. Bull. Symb. Log. 19(1): 97-105 (2013)- 2012
- [j19]Jason P. Bell, Stanley Burris, Karen A. Yeats:
Monadic second-order classes of forests with a monadic second-order 0-1 law. Discret. Math. Theor. Comput. Sci. 14(1): 87-108 (2012) - 2010
- [j18]Jason P. Bell, Stanley Burris, Karen A. Yeats:
Characteristic Points of Recursive Systems. Electron. J. Comb. 17(1) (2010)
2000 – 2009
- 2009
- [c3]Jason P. Bell, Stanley N. Burris, Karen A. Yeats:
Spectra and Systems of Equations. AMS-ASL Joint Special Session 2009: 43-96 - [c2]Jason P. Bell, Stanley N. Burris:
Compton's Method for Proving Logical Limit Laws. AMS-ASL Joint Special Session 2009: 97-128 - 2008
- [j17]Stanley Burris, Karen A. Yeats:
Sufficient Conditions for Labelled 0-1 Laws. Discret. Math. Theor. Comput. Sci. 10(1) (2008) - 2006
- [j16]Jason P. Bell, Stanley Burris, Karen A. Yeats:
Counting Rooted Trees: The Universal Law t(n)~C ρ-n n-3/2. Electron. J. Comb. 13(1) (2006) - 2004
- [j15]Jason P. Bell, Stanley Burris:
Partition Identities I: Sandwich Theorems and Logical 0-1 Laws. Electron. J. Comb. 11(1) (2004)
1990 – 1999
- 1996
- [j14]Stanley Burris, Pawel M. Idziak:
A directly Representable Variety has a discrete First-Order Law. Int. J. Algebra Comput. 6(3): 269-276 (1996) - 1995
- [j13]Stanley Burris:
Polynomial Time Uniform Word Problems. Math. Log. Q. 41: 173-182 (1995) - [c1]Stanley N. Burris:
Spectrally determined first-order limit laws. Logic and Random Structures 1995: 33-52 - 1994
- [j12]Stanley Burris:
Model Companions with Finitely Many Countable Models. Math. Log. Q. 40: 141-142 (1994) - [j11]Stanley Burris, Isabel M. A. Ferreirim:
Decidable Varieties of Hoops. Reports Math. Log. 28: 53-59 (1994) - 1993
- [j10]Stanley Burris, John Lawrence:
The Equivalence Problem for Finite Rings. J. Symb. Comput. 15(1): 67-71 (1993) - 1992
- [j9]Stanley Burris, Simon Lee:
Small Models of the High School identities. Int. J. Algebra Comput. 2(2): 139-178 (1992) - [j8]Stanley Burris:
Discriminator Varieties and Symbolic Computation. J. Symb. Comput. 13(2): 175-208 (1992) - 1991
- [j7]Stanley Burris, John Lawrence:
Term Rewrite Rules for Finite Fields. Int. J. Algebra Comput. 1(3): 353-370 (1991) - [j6]Stanley Burris, Ralph McKenzie, Matthew Valeriote
:
Decidable Discriminator Varieties from Unary Varieties. J. Symb. Log. 56(4): 1355-1368 (1991) - 1990
- [j5]Stanley Burris, John Lawrence:
Unification in Commutative Rings is Not Finitary. Inf. Process. Lett. 36(1): 37-38 (1990)
1980 – 1989
- 1989
- [j4]Stanley Burris:
Decidable Model Companions. Math. Log. Q. 35(3): 225-227 (1989) - 1988
- [j3]Michael H. Albert, Stanley Burris:
Bounded Obstructions, Model Companions and Amalgamation Bases. Math. Log. Q. 34(2): 109-115 (1988) - 1987
- [j2]Stanley Burris:
The Model Completion of the Class of ℒ-Structures. Math. Log. Q. 33(4): 313-314 (1987) - 1984
- [j1]Stanley Burris:
Model Companions for Finitely Generated Universal Horn Classes. J. Symb. Log. 49(1): 68-74 (1984) - 1981
- [b1]Stanley Burris, Hanamantagouda P. Sankappanavar:
A course in universal algebra. Graduate texts in mathematics 78, Springer 1981, ISBN 978-0-387-90578-5, pp. I-XV, 1-276
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 2024-04-25 05:53 CEST 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:
