The following pages link to (Q4530231):
Displaying 50 items.
- Canonical extensions of double quasioperator algebras: an algebraic perspective on duality for certain algebras with binary operations (Q863916) (← links)
- Horn axiomatizations for sequential data (Q870272) (← links)
- Cycles and communicating classes in membrane systems and molecular dynamics (Q872209) (← links)
- Maximum \(H\)-colourable subdigraphs and constraint optimization with arbitrary weights (Q881590) (← links)
- The covering problem in Rosenbloom-Tsfasman spaces (Q888588) (← links)
- On the order-theoretic properties of lower concept formula systems (Q891194) (← links)
- Lattice based communication P systems with applications in cluster analysis (Q894659) (← links)
- Open set lattices of subspaces of spectrum spaces (Q895880) (← links)
- Bases of closure systems over residuated lattices (Q896027) (← links)
- A representation of L-domains by information systems (Q896923) (← links)
- Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory (Q898737) (← links)
- A concept approach to input/output logic (Q898776) (← links)
- Gödel spaces and perfect MV-algebras (Q898780) (← links)
- Individualized skill assessment in educational games: the mathematical foundations of partitioning (Q899146) (← links)
- An axiomatic analysis of structured argumentation with priorities (Q899441) (← links)
- Chu connections and back diagonals between \(\mathcal{Q}\)-distributors (Q899562) (← links)
- Multi-adjoint algebras versus non-commutative residuated structures (Q900276) (← links)
- Classifying finite-dimensional \(C^*\)-algebras by posets of their commutative \(C^*\)-subalgebras (Q904516) (← links)
- On additively commutative near-ring congruences on seminearrings. (Q906967) (← links)
- Posets of finite functions (Q907250) (← links)
- The lattice-theoretic structure of the sets of triangular norms and semi-copulas (Q928575) (← links)
- Algebraic neighbourhood logic (Q929966) (← links)
- A framework for the verification of infinite-state graph transformation systems (Q937301) (← links)
- Modelling higher-order dual nondeterminacy (Q938301) (← links)
- A Hofmann-Mislove theorem for bitopological spaces (Q941428) (← links)
- Ordering the order of a distributive lattice by itself (Q941431) (← links)
- Causal set topology (Q949624) (← links)
- Machine semantics (Q959818) (← links)
- Concept lattices of fuzzy contexts: formal concept analysis vs. rough set theory (Q962890) (← links)
- Zero-divisor graphs of partially ordered sets (Q963831) (← links)
- Using abstract interpretation to add type checking for interfaces in Java bytecode verification (Q974112) (← links)
- Counting linear extension majority cycles in partially ordered sets on up to 13 elements (Q980203) (← links)
- Triangle, parallelogram, and trapezoid orders (Q981682) (← links)
- Algebraic aspects of generalized approximation spaces (Q990971) (← links)
- Set choice problems with incomplete information about the preferences of the decision maker (Q992615) (← links)
- Representing roommates' preferences with symmetric utilities (Q996394) (← links)
- An incremental algorithm to construct a lattice of set intersections (Q1001808) (← links)
- An algebra of hybrid systems (Q1001892) (← links)
- Bi-inductive structural semantics (Q1012127) (← links)
- Canonical extensions and relational representations of lattices with negation (Q1015482) (← links)
- Cascade estimators for systems on a partial order (Q1024527) (← links)
- Generalizations of Boolean products for lattice-ordered algebras (Q1035658) (← links)
- Formal concept analysis via multi-adjoint concept lattices (Q1037849) (← links)
- Distributive lattices of small width. II: A problem from Stanley's 1986 text \textsl{Enumerative combinatorics} (Q1040828) (← links)
- Packing and covering k-chain free subsets in Boolean lattices (Q1043999) (← links)
- MacNeille completion and profinite completion can coincide on finitely generated modal algebras (Q1047116) (← links)
- Symmetry in data mining and analysis: a unifying view based on hierarchy (Q1048428) (← links)
- Probabilistic argumentation systems. A new way to combine logic with probability. (Q1427350) (← links)
- Theory of relations. Transl. from the French by P. Clote. With an appendix by Norbert Sauer. (Q1591661) (← links)
- A fast algorithm for building lattices (Q1606994) (← links)
