On the public citation graph

Nonstandard characterization of pseudovarieties

https://doi.org/10.1007/bf01225473
0 signed · 23 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-94-009-3839-7_1openalex-snapshot
Implicit Operations on Certain Classes of Semigroups
inferredcites →https://doi.org/10.1007/bf00970480openalex-snapshot
Nonstandard varieties of pseudotopological algebraic systems
inferredcites →https://doi.org/10.1007/bf00971030openalex-snapshot
Nonstandard convergences in spaces of mappings
inferredcites →https://doi.org/10.1007/bf01190713openalex-snapshot
On pseudovarieties, varieties of languages, filters of congruences, pseudoidentities and related topics
inferredcites →https://doi.org/10.1007/bf01194543openalex-snapshot
The Birkhoff Theorem for varieties of finite algebras
inferredcites →https://doi.org/10.1007/bf01243870openalex-snapshot
The algebra of implicit operations
inferredcites →https://doi.org/10.1007/bf02483902openalex-snapshot
The Birkhoff theorem for finite algebras
inferredcites →https://doi.org/10.1016/0001-8708(76)90029-3openalex-snapshot
On pseudovarieties
inferredcites →https://doi.org/10.1016/0021-8693(85)90147-4openalex-snapshot
Pseudovarieties, generalized varieties and similarly described classes
inferredcites →https://doi.org/10.1016/0021-8693(86)90070-0openalex-snapshot
Infinite iteration of matrix semigroups II. Structure theorem for arbitrary semigroups up to aperiodic morphism
inferredcites →https://doi.org/10.4171/pmopenalex-snapshot
Portugaliae Mathematica

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/s00025-019-0998-7openalex-snapshot
Pseudovarieties of Ordered Completely Regular Semigroups
inferred← citeshttps://doi.org/10.1007/s00233-021-10167-0openalex-snapshot
A topological shuttle between inequalities and pseudoinequalities
inferred← citeshttps://doi.org/10.1007/s00233-026-10611-zopenalex-snapshot
A purely algebraic proof of the omega-reducibility of pseudovarieties representing low half levels of concatenation hierarchies
inferred← citeshttps://doi.org/10.1007/s11202-999-0015-6openalex-snapshot
On nonstandard axiomatization of elementarily nonaxiomatizable classes of discrete algebraic systems
inferred← citeshttps://doi.org/10.1016/j.jpaa.2006.06.016openalex-snapshot
Pseudovarieties defining classes of sofic subshifts closed under taking shift equivalent subshifts
inferred← citeshttps://doi.org/10.1090/tran/7951openalex-snapshot
Representations of relatively free profinite semigroups, irreducibility, and order primitivity
inferred← citeshttps://doi.org/10.1142/s0218196716500648openalex-snapshot
Reducibility vs. definability for pseudovarieties of semigroups
inferred← citeshttps://doi.org/10.1142/s0218196724500024openalex-snapshot
The omega-reducibility of pseudovarieties of ordered monoids representing low levels of concatenation hierarchies
inferred← citeshttps://doi.org/10.1515/forum-2016-0028openalex-snapshot
The ω-inequality problem for concatenation hierarchies of star-free languages
inferred← citeshttps://doi.org/10.2307/2687834openalex-snapshot
2000 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium 2000
inferred← citeshttps://doi.org/10.2307/421141openalex-snapshot
1998 European Summer Meeting of the Association for Symbolic Logic
inferred← citeshttps://doi.org/10.46298/dmtcs.490openalex-snapshot
New decidable upper bound of the second level in the Straubing-Therien concatenation hierarchy of star-free languages
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.