On the public citation graph

Free Lattices II

https://doi.org/10.2307/1968883
0 signed · 68 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.1017/s0305004100011464openalex-snapshot
On the combination of subalgebras
inferredcites →https://doi.org/10.1215/s0012-7094-40-00655-xopenalex-snapshot
Numerical analysis of certain free distributive structures
inferredcites →https://doi.org/10.2307/2371374openalex-snapshot
Partially Ordered Sets

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-44683-4_56openalex-snapshot
On the Equational Definition of the Least Prefixed Point
inferred← citeshttps://doi.org/10.1007/3-540-62950-5_66openalex-snapshot
On the word problem for free lattices
inferred← citeshttps://doi.org/10.1007/978-1-4899-2608-1_7openalex-snapshot
Finitely Presented Lattices: Continuity and Semidistributivity
inferred← citeshttps://doi.org/10.1007/978-1-4899-3558-8_6openalex-snapshot
Lattices with Unique Complements
inferred← citeshttps://doi.org/10.1007/978-1-4899-3558-8_8openalex-snapshot
Uniquely Complemented Lattices
inferred← citeshttps://doi.org/10.1007/978-1-4899-3795-7_4openalex-snapshot
F
inferred← citeshttps://doi.org/10.1007/978-3-642-01815-2_23openalex-snapshot
RESTRUCTURING LATTICE THEORY: AN APPROACH BASED ON HIERARCHIES OF CONCEPTS
inferred← citeshttps://doi.org/10.1007/978-94-009-5997-2_1openalex-snapshot
F
inferred← citeshttps://doi.org/10.1007/978-94-009-7798-3_11openalex-snapshot
Some Order Theoretic Questions About Free Lattices and Free Modular Lattices
inferred← citeshttps://doi.org/10.1007/978-94-009-7798-3_15openalex-snapshot
Restructuring Lattice Theory: An Approach Based on Hierarchies of Concepts
inferred← citeshttps://doi.org/10.1007/bf00340775openalex-snapshot
Free lattice algorithms
inferred← citeshttps://doi.org/10.1007/bf00346132openalex-snapshot
Infinite intervals in free lattices
inferred← citeshttps://doi.org/10.1007/bf00403408openalex-snapshot
Singular covers in free lattices
inferred← citeshttps://doi.org/10.1007/bf01187059openalex-snapshot
Polynomial interpolation and the Chinese Remainder Theorem for algebraic systems
inferred← citeshttps://doi.org/10.1007/bf01190933openalex-snapshot
Weak distributive laws and their role in free lattices
inferred← citeshttps://doi.org/10.1007/bf01221796openalex-snapshot
Directions in lattice theory
inferred← citeshttps://doi.org/10.1007/bf01221797openalex-snapshot
J�nsson's contributions to lattice theory
inferred← citeshttps://doi.org/10.1007/bf01238669openalex-snapshot
Finite sublattices generated by order-isomorphic subsets
inferred← citeshttps://doi.org/10.1007/bf01344076openalex-snapshot
Order convergence and topological completion of commutative lattice-groups
inferred← citeshttps://doi.org/10.1007/bf01673824openalex-snapshot
Canonical decompositions in complete lattices
inferred← citeshttps://doi.org/10.1007/bf02302481openalex-snapshot
On the entry problem for free and almost free lattices
inferred← citeshttps://doi.org/10.1007/bf02485417openalex-snapshot
Embedding and unsolvability theorems for modular lattices
inferred← citeshttps://doi.org/10.1007/bf02485732openalex-snapshot
From a lattice to its ideal lattice
inferred← citeshttps://doi.org/10.1007/bf02945025openalex-snapshot
Sublattices of intervals in relatively free lattices
inferred← citeshttps://doi.org/10.1007/bfb0098456openalex-snapshot
Connected components of the covering relation in free lattices
inferred← citeshttps://doi.org/10.1007/pl00012448openalex-snapshot
The free orthomodular lattice on countably many generators is a subalgebra of the free orthomodular lattice on three generators
inferred← citeshttps://doi.org/10.1007/s00012-020-00674-6openalex-snapshot
Generalizing Galvin and Jónsson’s classification to $$N_5$$
inferred← citeshttps://doi.org/10.1007/s00012-023-00814-8openalex-snapshot
Extremality, left-modularity and semidistributivity
inferred← citeshttps://doi.org/10.1007/s10474-015-0560-3openalex-snapshot
A selfdual embedding of the free lattice over countably many generators into the three-generated one
inferred← citeshttps://doi.org/10.1007/s11083-022-09594-7openalex-snapshot
Amalgamating Poset Extensions and Generating Free Lattices
inferred← citeshttps://doi.org/10.1016/0001-8708(78)90010-5openalex-snapshot
The diamond lemma for ring theory
inferred← citeshttps://doi.org/10.1016/0001-8708(85)90118-5openalex-snapshot
Proof theory for linear lattices
inferred← citeshttps://doi.org/10.1016/j.entcs.2018.11.010openalex-snapshot
Isotropy of Algebraic Theories
inferred← citeshttps://doi.org/10.1016/j.topol.2011.06.029openalex-snapshot
Quotients and colimits of κ-quantales
inferred← citeshttps://doi.org/10.1016/j.topol.2012.11.001openalex-snapshot
Topologies as points within a Stone space: Lattice theory meets topology
inferred← citeshttps://doi.org/10.1016/s0022-4049(01)00098-6openalex-snapshot
Free μ-lattices
inferred← citeshttps://doi.org/10.1016/s0079-8169(08)61359-8openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00412-7openalex-snapshot
On the equational definition of the least prefixed point
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00311-9openalex-snapshot
From multiple sequent for additive linear logic to decision procedures for free lattices
inferred← citeshttps://doi.org/10.1017/s1446788700017766openalex-snapshot
Finite sublattices of three-generated lattices
inferred← citeshttps://doi.org/10.1080/00927872.2022.2064145openalex-snapshot
Free objects and coproducts in categories of posets and lattices
inferred← citeshttps://doi.org/10.1080/03081079.2017.1354964openalex-snapshot
Generating complete sublattices by methods of formal concept analysis
inferred← citeshttps://doi.org/10.1090/s0002-9904-1961-10681-2openalex-snapshot
Coverings in free lattices
inferred← citeshttps://doi.org/10.1090/s0002-9939-1956-0078957-4openalex-snapshot
Component subsets of the free lattice on 𝑛 generators
inferred← citeshttps://doi.org/10.1090/s0002-9939-1966-0195769-8openalex-snapshot
The free modular lattice, ${\rm FM}(2+2+2)$, is infinite
inferred← citeshttps://doi.org/10.1090/s0002-9947-1945-0012263-6openalex-snapshot
Lattices with unique complements
inferred← citeshttps://doi.org/10.1090/s0002-9947-1956-0080076-2openalex-snapshot
Completely Free Lattices Generated by Partially Ordered Sets
inferred← citeshttps://doi.org/10.1090/s0002-9947-1959-0108447-9openalex-snapshot
Free Lattices with Infinite Operations
inferred← citeshttps://doi.org/10.1090/s0002-9947-1972-0313141-1openalex-snapshot
Equational Bases and Nonmodular Lattice Varieties
inferred← citeshttps://doi.org/10.1090/s0002-9947-1980-0576864-xopenalex-snapshot
Free Modular Lattices
inferred← citeshttps://doi.org/10.1090/s0002-9947-1982-0637041-9openalex-snapshot
Finite Sublattices of a Free Lattice
inferred← citeshttps://doi.org/10.1090/s0002-9947-1985-0773044-4openalex-snapshot
Covers in free lattices
inferred← citeshttps://doi.org/10.1090/s0002-9947-1989-0949899-0openalex-snapshot
Finitely Presented Lattices: Canonical Forms and the Covering Relation
inferred← citeshttps://doi.org/10.1109/t-c.1972.223439openalex-snapshot
Minimization of Fuzzy Functions
inferred← citeshttps://doi.org/10.1137/0216011openalex-snapshot
On the Computational Complexity of Algebra on Lattices
inferred← citeshttps://doi.org/10.11575/prism/24830openalex-snapshot
An Analysis of Countable Sublattices of Free Lattices
inferred← citeshttps://doi.org/10.14232/actasm-015-586-2openalex-snapshot
Lattices embeddable in three-generated lattices
inferred← citeshttps://doi.org/10.1515/ms-2016-0291openalex-snapshot
Conditional associativity in orthomodular lattices
inferred← citeshttps://doi.org/10.2307/2695031openalex-snapshot
Free ordered algebraic structures towards proof theory
inferred← citeshttps://doi.org/10.2748/tmj/1178244623openalex-snapshot
On free modular lattices, II
inferred← citeshttps://doi.org/10.4099/jjm1924.21.0_53openalex-snapshot
On Free Modular Lattices
inferred← citeshttps://doi.org/10.4153/cjm-1961-021-0openalex-snapshot
Sublattices of a Free Lattice
inferred← citeshttps://doi.org/10.4153/cjm-1962-040-1openalex-snapshot
Finite Sublattices of a Free Lattice
inferred← citeshttps://doi.org/10.70675/01cff03fzeec3z4ad2zb86az1ede861398f5openalex-snapshot
Une histoire de la théorie des treillis au sein de l'American Mathematical Society entre 1933 et 1948
inferred← citeshttps://doi.org/10.70930/tac/mhxqkgguopenalex-snapshot
The alternation hierarchy for the theory of μ-lattices
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.