scientific article; zbMATH DE number 194916

Publication date: 5 June 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to ordered structures (06-01)

Related Items

A new contribution to the fixed point theory in partial quasi-metric spaces and its applications to asymptotic complexity analysis of algorithms, Belief models: An order-theoretic investigation, Insertion of lattice-valued and hedgehog-valued functions, Safety and precision of spatial context models for autonomous systems, Characterising E-projectives via co-monads, Enriched categories and many-valued preorders: categorical, semantical, and topological perspectives, Representation of lattices by fuzzy weak congruence relations, On fixed point theory in topological posets, extended quasi-metric spaces and an application to asymptotic complexity of algorithms, Ockham's razor and reasoning about information flow, Normal forms and free algebras for some extensions of MTL, Analytic rules for mereology, Control of parameterized discrete event systems, Pure strategy equilibrium in finite weakly unilaterally competitive games, Interaction transform for bi-set functions over a finite set, Entropy of capacities on lattices and set systems, Decision effects, the Hahn-Jordan decomposition for states, and their connection to Ludwig's axiomatic approach to quantum mechanics, Poset extensions, convex sets, and semilattice presentations, Data structures for symbolic multi-valued model-checking, Robustness of interval-valued fuzzy inference triple I algorithms based on normalized Minkowski distance, An analysis of the equational properties of the well-founded fixed point, A structure theorem for posets admitting a ``strong chain partition: a generalization of a conjecture of Daykin and Daykin (with connections to probability correlation inequalities), Recursive decomposition and bounds of the lattice of Moore co-families., Non-standard cut classification of fuzzy sets, On the random generation and counting of weak order extensions of a poset with given class cardinalities, $L$-fuzzy soft sets based on complete Boolean lattices, More on fuzzy lattices, A note on the structure of spaces of domino tilings, Decision making over necessity measures through the Choquet integral criterion, Tilings with trichromatic colored-edges triangles, Domino tilings and related models: Space of configurations of domains with holes, Maximal contractions in Boolean algebras, First-order logic formalisation of impossibility theorems in preference aggregation, The complexity of embedding orders into small products of chains, The core of bicapacities and bipolar games, Distributive lattices, polyhedra, and generalized flows, On the mereological structure of complex states of affairs, Just in time control of constrained $(max,+)$-linear systems, Hyperspaces of a weightable quasi-metric space: application to models in the theory of computation, Orders on intervals over partially ordered sets: extending Allen's algebra and interval graph results., Sparse grid quadrature on products of spheres, Orthogonality and dimensionality, Robustness of full implication algorithms based on interval-valued fuzzy inference, Model checking computation tree logic over finite lattices, Endomorphisms of finite regular Kleene lattices, Games on concept lattices: Shapley value and core, Generic local computation, Multi-valued model checking games, Limit theorems for a random directed slab graph, Robustness of reverse triple I algorithms based on interval-valued fuzzy inference, On algebra of languages representable by vertex-labeled graphs, Modalities in the Stone age: a comparison of coalgebraic logics, On calculating residuated approximations, Fine hierarchies via Priestley duality, Connectivity spaces, A generic topology library, On lower and upper intension order relations by different cover concepts, Robustness of interval-valued fuzzy inference, The complexity of approximately counting stable matchings, Grishin algebras and cover systems for classical bilinear logic, Soft rough approximation operators on a complete atomic Boolean lattice, Distributivity conditions and the order-skeleton of a lattice, Structural universals as structural parts: toward a general theory of parthood and composition, Lattice-valued simulations for quantitative transition systems, Heyting mereology as a framework for spatial reasoning, The lattice of synchrony subspaces of a coupled cell network: characterization and computation algorithm, A fixed point theorem in partial quasi-metric spaces and an application to software engineering, The largest cartesian closed category of stable domains, Formal query systems on contexts and a representation of algebraic lattices, Semi-metrics, closure spaces and digital topology, On rough approximations via ideal, From CML to its process algebra, Extremal solutions of inequations over lattices with applications to supervisory control, Embedding a demonic semilattice in a relation algebra, Multi-valued logic programming semantics An algebraic approach, Nondeterministic fuzzy automata with membership values in complete residuated lattices, Generalized three-way decision models based on subset evaluation, A logical view of composition, The Baire partial quasi-metric space: a mathematical tool for asymptotic complexity analysis in computer science, The restricted core of games on distributive lattices: how to share benefits in a hierarchy, Finite retracts of Priestley spaces and sectional coproductivity, Influence functions, followers and command games, Coarsening a knowledge structure, Lattice-valued modal propositional logic and its completeness, A note on a natural equivalence relation on fuzzy power set, Simulations in coalgebra, A coalgebraic view on positive modal logic, Solving multi-metric network problems: an interplay between idempotent semiring rules, A Sahlqvist theorem for distributive modal logic, General frames for relevant modal logics, An application of rough sets to graph theory, Minimal bases of temporal attribute implications, Partial description of quantum states, An elementary theory of product-line variations, Realizability of polytopes as a low rank matrix completion problem, Mass problems associated with effectively closed sets, Least reflexive points of relations, Nondeterministic semantics of compound diagrams, Regular algebra applied to language problems, Bimonotone linear inequalities and sublattices of $\mathbb R^n$, Free and cofree acts of dcpo-monoids on directed complete posets., Spectral sets, Order theoretic variants of the fundamental theorem of compact semigroups, Braids and their monotone clones, An incremental concept formation approach for learning from databases, The nested universal relation data model, Quasivarities of distributive lattices with a quantifier, Deciding Frattini is NP-complete, Series-parallel posets and relative Ockham lattices, Autoepistemic logic programming, Sandpiles and order structure of integer partitions, Comparator circuits over finite bounded posets, Compositional strategy synthesis for stochastic games with multiple objectives, Perfect sequences of chain-complete posets, Weak and strong fuzzy interval orders, Reducible classes of finite lattices, The automorphism group of a function lattice: A problem of Jónsson and McKenzie, Automatic synthesis of logical models for order-sorted first-order theories, Tree structure for distributive lattices and its applications, The structure of perceptual categories, Null inclusion dependencies in relational databases, Finite distributive lattices and doubly irreducible elements, The quotient of an abstract interpretation, Duality for modal $\mu$-logics, The common order-theoretic structure of version spaces and ATMSs, A calculational approach to mathematical induction, Classes extraction from procedural programs, A characterization of moral transitive acyclic directed graph Markov models as labeled trees., Classes of lattices induced by chip firing (and sandpile) dynamics., A discrete fixed point theorem and its applications., The presence of lattice theory in discrete problems of mathematical social sciences. Why., System theory for system identification., On a quasi-ordering on Boolean functions, Fixed set theory for closed correspondences with applications to self-similarity and games., Applying relation algebra and RelView to solve problems on orders and lattices, A formal framework for characterizing querying algorithms., Resolution-based decision procedures for the universal theory of some classes of distributive lattices with operators, Parametric $\lambda $-theories, Algebraic reasoning for probabilistic action systems and while-loops, The poset structures admitting the extended binary Golay code to be a perfect code, On the structure of certain po-semigroups, Forbidden retracts for finite ordered sets of width at most four, CPO semantics of timed interactive actor networks, Semantic networks, Completing sort hierarchies, Concept lattices and conceptual knowledge systems, On the expressiveness of interaction, Representation insensitivity in immediate prediction under exchangeability, On the random generation of monotone data sets, The lattice of distributive closure operators over an algebra, The lattice of embedded subsets, The Hausdorff fuzzy quasi-metric, Myhill-Nerode type theory for fuzzy languages and automata, The multiple facets of the canonical direct unit implicational basis, The axiomatization of override and update, Quantum logic in dagger kernel categories, On lattice valued up-sets and down-sets, Dual unbounded nondeterminacy, recursion, and fixpoints, Fuzzy lattice reasoning (FLR) classifier and its application for ambient ozone estimation, Ideals in ordered sets, a unifying approach, Construction of some uncountable 2-arc-transitive bipartite graphs, Normal linear regression models with recursive graphical Markov structure, Representation of computations in concurrent automata by dependence orders, Rough concept lattices and domains, Matroids on partially ordered sets, The lattice of integer partitions and its infinite extension, New work for Carnap's quasi-analysis, Operational and denotational semantics for the box algebra, Axiomatisation of functional dependencies in incomplete relations, A useful fixpoint theorem, A Priestley sum of finite trees is acyclic, Ordinal decompositions for preordered root systems, Cryptographically-enforced hierarchical access control with multiple keys, Diagram rules for the generation of Schubert polynomials, Subjective spacetime derived from a causal histories approach, A behavioural theory of first-order CML, Fuzzy complete lattices, The Dedekind-MacNeille completions for fuzzy posets, On verifying and engineering the wellgradedness of a union-closed family, Confidence relations and ordinal information, Incompatible empirically equivalent theories: a structural explication., $\mathcal{MOQA}$; unlocking the potential of compositional static average-case analysis, Properly injective spaces and function spaces, Computation on metric spaces via domain theory, Uniform approximation of topological spaces, Prime spectra of lattice-ordered abelian groups, On a representation of posets by fuzzy sets, Construction of the $L$-fuzzy concept lattice, Representation of the Choquet integral with the $\sigma$-additive Möbius transform, An application of lattice theory to knowledge representation, On maximal sublattices of finite lattices, Posets in which every cutset meets every fibre, Every cutset meets every fibre in certain poset products, Lattice conditional independence models for contingency tables with non-monotone missing data patterns, On generation of finite posets by meet-irreducibles, A Daniell-Kolmogorov theorem for supremum preserving upper probabilities, Down and up operators associated to fuzzy relations and t-norms: A definition of fuzzy semi-ideals, On a generalized product for domains, A note on the correspondence among entail relations, rough set dependencies, and logical consequence, On the Yoneda completion of a quasi-metric space, Information categories, Completion of ordered structures by cuts of fuzzy sets: An overview, Representing ordered structures by fuzzy sets: An overview, The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey, Quasi-continuous Yoneda complete quasi-metric space, Inductive $^{*}$-semirings, Cayley lattices of finite Coxeter groups are bounded, Computational aspects of the 2-dimension of partially ordered sets, Sandpile models and lattices: a comprehensive survey, Saturated models of intuitionistic theories, Approximation algorithms for sorting by bounded singleton moves, Algebras of sets and coherent sets of gambles, Representation of De Morgan and (semi-)Kleene lattices, Syntactic codes and grammar refinement, Subdifferentiation of monotone functions from semilattices to distributive lattices, The poset on connected induced subgraphs of a graph need not be Sperner, Set theory for verification. II: Induction and recursion, Attribute reduction of SE-ISI concept lattices for incomplete contexts, On the relation between conditional independence models determined by finite distributive lattices and by directed acyclic graphs, QuasiBoolean algebras and simultaneously definite properties in quantum mechanics, An approach to literate and structured formal developments, Optimal natural dualities for varieties of Heyting algebras, Duality for algebras of relevant logics, On intermediate inquisitive and dependence logics: an algebraic study, Interval-valued fuzzy reasoning method based on similarity measure, Fixed point theorems for correspondences with values in a partially ordered set and extended supermodular games, Rough sets and matroids from a lattice-theoretic viewpoint, Fuzzy alternating Büchi automata over distributive lattices, Closure structures parameterized by systems of isotone Galois connections, The fixed point property for ordered sets, The strong endomorphism kernel property in double MS-algebras, Interval-valued rank in finite ordered sets, Lexicographic choice functions, Interval-valued fuzzy reasoning full implication algorithms based on the t-representable t-norm, Constrained consequence, A method of representing rough sets system determined by quasi orders, Rough approximations based on soft binary relations and knowledge bases, Similarity of binary relations based on complete Boolean lattices and related results, Mathematical morphology on bipolar fuzzy sets: general algebraic framework, On degree spectra of topological spaces, Techniques and applications of computation slicing, Efficient dependency tracking for relevant events in concurrent systems, The lattice and matroid representations of definable sets in generalized rough sets based on relations, Solving linear equations by fuzzy quasigroups techniques, The powerset operator on abstract interpretations, Design of abstract domains using first-order logic, Supremum preserving upper probabilities, Functions on distributive lattices with the congruence substitution property: Some problems of Grätzer from 1964, Knowledge reduction in formal contexts using non-negative matrix factorization, Sign-restricted matrices of 0's, 1's, and $-1$'s, Quasi-differential posets and cover functions of distributive lattices. I: A conjecture of Stanley, Lattice-valued algebraic structures via residuated maps, Thompson aggregators, Scott continuous koopmans operators, and least fixed point theory, Generalizing quasi-ordinal knowledge spaces to polytomous items, Orthomodular lattice in Lorentzian globally hyperbolic space-time, Dualities for subresiduated lattices, Effectful applicative similarity for call-by-name lambda calculi, Aggregation of convex intuitionistic fuzzy sets, Recursive decomposition tree of a Moore co-family and closure algorithm., An experimental comparison of seriation methods for one-mode two-way data, Fixed point theorems in generalized metric spaces with applications to computer science, Information structures in a lattice-valued information system, Characterizing functional dependencies in formal concept analysis with pattern structures, Feedforward networks: adaptation, feedback, and synchrony, On the restricted cores and the bounded core of games on distributive lattices, Lattice valued intuitionistic fuzzy sets, General complementarities on complete partial orders, States of finite GBL-algebras with monoidal sum, $\Omega$-lattices, Bi-capacities. I: Definition, Möbius transform and interaction, Isotone relations revisited, Prime ideals in ultraproducts of commutative rings, Refinement algebra for probabilistic programs, Equivalent bipolar fuzzy relations, Quantized hyperalgebras of rank 1, The number of Moore families on $n=6$, Definable operators on stable set lattices, Cuts of poset-valued functions in the framework of residuated maps, Importation lattices, $L$-fuzzy semiprime ideals of a poset, Convolution lattices, Characterizations of $L$-convex spaces via domain theory, Coherent choice functions, desirability and indifference, Canonical extensions and ultraproducts of polarities, A reinterpretation of the semilattice semantics with applications, $L$-fuzzy valued inclusion measure, $L$-fuzzy similarity and $L$-fuzzy distance, Using propositional logic to compute probabilities in multistate systems, A probabilistic approach to navigation in Hypertext, Equilogical spaces, A multi-level conceptual data reduction approach based on the Lukasiewicz implication, Pro-finite MV-spaces, Equational theories for automata, Posets that locally resemble distributive lattices. An extension of Stanley's theorem (with connections to buildings and diagram geometries), Information algebras in the theory of imprecise probabilities, an extension, Coding distributive lattices with Edge Firing Games., Updating awareness and information aggregation, Closures on CPOs form complete lattices, Relational interpretations of recursive types in an operational setting., Full abstraction for PCF, Concepts in fuzzy scaling theory: Order and granularity., Three dual ontologies, The Endomorphism Kernel Property in Finite Distributive Lattices and de Morgan Algebras, On square-increasing ordered monoids and idempotent semirings, Logic of temporal attribute implications, Partition-induced natural dualities for varieties of pseudo-complemented distributive lattices, $k$-additivity and $\mathcal C$-decomposability of bi-capacities and its integral, Infinitary rewriting: closure operators, equivalences and models, Symbolic Trajectory Evaluation, Networks with asymmetric inputs: lattice of synchrony subspaces, Finitely additive extensions of distribution functions and moment sequences: the coherent lower prevision approach, Extended dualization: application to maximal pattern mining, Extending relational algebra with similarities, Modeling, analyzing and slicing periodic distributed computations, ($\vartheta, T$)-fuzzy rough approximation operators and the $TL$-fuzzy rough ideals on a ring, Automated theorem proving by resolution in non-classical logics, Derivative of functions over lattices as a basis for the notion of interaction between attributes, The Galois lattice as a hierarchical structure for topological relations, Relational concept discovery in structured datasets, Dedekind-MacNeille completion of $n$-ordered sets, Markovian equilibrium in infinite horizon economies with incomplete markets and public policy, A concrete realization of the Hoare powerdomain, Tame parts of free summands in coproducts of Priestley spaces, Topos quantum theory on quantization-induced sheaves, Language-theoretic and finite relation models for the (full) Lambek calculus, Unnamed Item, Unnamed Item, Rough approximations via ideal on a complete completely distributive lattice, Congruence properties of pseudocomplemented De Morgan algebras, Semantics of Probabilistic Programs: A Weak Limit Approach, Interval-valued quintuple implication principle of fuzzy reasoning, Fast Detection of Stable and Count Predicates in Parallel Computations, Equational Properties of Fixed Point Operations in Cartesian Categories: An Overview, Strategy-proof aggregation rules and single peakedness in bounded distributive lattices, Overdetermined ODEs and rigid periodic states in network dynamics, Absolute retractness of automata on directed complete posets, Playing the wrong game: an experimental analysis of relational complexity and strategic misrepresentation, Complete Abstractions and Subclassical Modal Logics, Sufficient and necessary conditions of entanglement transformations between mixed states, Patterns of desynchronization and resynchronization in heteroclinic networks, Unnamed Item, On the closure properties of the class of full G-models of a deductive system, The intensional side of algebraic-topological representation theorems, On tools for completeness of Kleene algebra with hypotheses, Characterising E-projectives via Comonads, Countable locally 2-arc-transitive bipartite graphs, Cayley's and Holland's theorems for idempotent semirings and their applications to residuated lattices, Lattice and metric completions of the classical logic metric space and a comparison1, Classification based on L-fuzzy sets1, Robustness of interval-valued universal triple I algorithms1, An infinitary extension of Jankov's theorem, Cathoristic Logic, Galois Lattice as a Framework to Specify Building Class Hierarchies Algorithms, Border Algorithms for Computing Hasse Diagrams of Arbitrary Lattices, An extended Ockham algebra with endomorphism kernel property, The complexity space of partial functions: a connection between complexity analysis and denotational semantics, An optimal algorithm to generate tilings, Games on lattices, multichoice games and the Shapley value: a new approach, Stationary Markovian equilibrium in overlapping generation models with stochastic nonclassical production and Markov shocks, More on configurations in Priestley spaces, and some new problems, NECESSITY MEASURES AND NECESSITY INTEGRALS ON A COMPLETE LATTICE, Many-Sorted Coalgebraic Modal Logic: a Model-theoretic Study, Sublattices of product spaces: Hulls, representations and counting, Lattice-driven cellular automata implementing local semantics, Non-deterministic ideal operators: an adequate tool for formalization in data bases, Uncertain information: random variables in graded semilattices, THE STRUCTURE OF RESIDUATED LATTICES, A distributive lattice structure connecting Dyck paths, noncrossing partitions and 312-avoiding permutations, Embedded choices, On existence of $P$-valued fuzzy sets with a given collection of cuts, An algebra of human concept learning, Widening and narrowing operators for abstract interpretation, Algorithmic combinatorics based on slicing posets, Principles of biological organization: local--global negotiation based on ``material cause, Efficient incremental maintenance for distributive and non-distributive aggregate functions, The finite embeddability property for residuated groupoids., Positive Logic with Adjoint Modalities: Proof Theory, Semantics and Reasoning about Information, A methodology for analysis of concept lattice reduction, Constructions of triangular norms on lattices by means of irreducible elements, Poset valued convexities, On a lattice-like property of quasi-arithmetic means, Confluence by critical pair analysis revisited, A survey on the mathematical foundations of axiomatic entropy: representability and orderings, Regular synchrony lattices for product coupled cell networks, Isotone lattice-valued Boolean functions and cuts, The structures and the connections on four types of covering rough sets, On Some Extensions of Syntactic Concept Lattices: Completeness and Finiteness Results, On 0-complete partial metric spaces and quantitative fixed point techniques in denotational semantics, On the graded acceptability of arguments in abstract and instantiated argumentation, MS-algebras whose e-ideals are kernel ideals, Majority judgment and strategy-proofness: a characterization, Lattices of lattice paths, On fixed point theory in partially ordered sets and an application to asymptotic complexity of algorithms, A note on the congruences of the Nakano superlattice and some properties of the associated quotients, Unified mathematical framework for slicing and symmetry reduction over event structures, On modified soft rough sets on a complete atomic Boolean lattice, POSSIBILITY THEORY I: THE MEASURE- AND INTEGRAL-THEORETIC GROUNDWORK, Accept \& reject statement-based uncertainty models, Unnamed Item, Closing reciprocal relations w.r.t. stochastic transitivity, Type-2 operations on finite chains, Variable precision fuzzy hit-or-miss transformation models to object identification in grey-scale images, Combining Partial Specifications using Alternating Interface Automata, Concurrency-Preserving Minimal Process Representation, AN ALGEBRAIC APPROACH TO INQUISITIVE AND -LOGICS, SOME ORDER DUALITIES IN LOGIC, GAMES AND CHOICES, ON WEIGHTED BÜCHI AUTOMATA WITH ORDER-COMPLETE WEIGHTS, Quasi-injectivity of partially ordered acts, CONSTRUCTION OF LATTICES OF BALANCED EQUIVALENCE RELATIONS FOR REGULAR HOMOGENEOUS NETWORKS USING LATTICE GENERATORS AND LATTICE INDICES, THE EXISTENCE AND CLASSIFICATION OF SYNCHRONY-BREAKING BIFURCATIONS IN REGULAR HOMOGENEOUS NETWORKS USING LATTICE STRUCTURES, Unnamed Item, Unnamed Item, PC-lattices: A Class of Bounded BCK-algebras, The Relative Consistency of the Axiom of Choice Mechanized Using Isabelle⁄zf, Unnamed Item, On $L$-fuzzy semi-prime ideals of a poset and separation theorems, Algebraic semantics for modal and superintuitionistic non-monotonic logics, Measuring concurrency of regular distributed computations, Complete Lattices and Up-To Techniques, SYMMETRY AND SYNCHRONY IN COUPLED CELL NETWORKS 2: GROUP NETWORKS, Denotational semantics as a foundation for cost recurrence extraction for functional languages, Weighted limits in the category Dcpo-S, New fixed point results in partial quasi-metric spaces, Topological duality via maximal spectrum functor, Producing Short Counterexamples Using “Crucial Events”, Naturality and definability II, SYMMETRY AND SYNCHRONY IN COUPLED CELL NETWORKS 3, A POLYNOMIAL TIME ALGORITHM TO DETERMINE MAXIMAL BALANCED EQUIVALENCE RELATIONS, Two sided Sand Piles Model and unimodal sequences, ADJUSTING ANNOTATED TAXONOMIES, Unnamed Item, Unnamed Item, Equational properties of fixed-point operations in cartesian categories: An overview, Polymodal Lattices and Polymodal Logic, Knowledge representation as domain, Synchronous, asynchronous, and causally ordered communication, Finite Characterization of the Coarsest Balanced Coloring of a Network, Covering Energy of Some Classes of Posets, Formal Concept Analysis with Constraints by EM Operators, Congruence coherent distributive doublep-algebras, L-FUZZY CONVEXITY INDUCED BY L-CONVEX FUZZY SUBLATTICE DEGREE, Spectral spaces of countable Abelian lattice-ordered groups, Topologies on quantum topoi induced by quantization, Groups whose lattices of normal subgroups are factorial, The core of games on ordered structures and graphs, Building Certified Static Analysers by Modular Construction of Well-founded Lattices, Probabilistic Semantics and Program Analysis, Supermetrics over Apartness Lattice-Ordered Semigroup, Priestley's duality from Stone's, Principal congruences on distributive double p-algebras, Clusters, Concepts, and Pseudometrics, Refining and Compressing Abstract Model Checking1 1The work is partially supported by MURST project: Certificazione automatica di programmi mediante interpretazione astratta., Strengthened fixed point property and products in ordered sets, Long-run cost analysis by approximation of linear operators over dioids, Making abstract models complete, Quasi injectivity andθ-internal order sum in partially ordered acts, Integer Partitions, Tilings of2D-gons and Lattices, Sequential Classification on Partially Ordered Sets, Tractable constraints in finite semilattices, ZooM: a nested Galois lattices-based system for conceptual clustering, Bounded distributive lattices with strict implication, Ockham Congruences Whose Quotient Algebras Are Boolean, Closure Systems of Equivalence Relations and Their Labeled Class Geometries, Unnamed Item, A Compositional Semantics for CHR with Propagation Rules, Extensions of fuzzy connectives on ACDL, An Application of Generalized Complexity Spaces to Denotational Semantics via the Domain of Words, On the structure of the space of complexity partial functions, A fixedpoint approach to implementing (Co)inductive definitions, Free Double Ockham Algebras, UNIVERSAL CODOMAINS TO REPRESENT INTERVAL ORDERS, Per Se Modality and Natural Implication – an Account of Connexive Logic in Robert Kilwardby, Weaving Multiple Aspects in Sequence Diagrams, Optimal natural dualities. II: General theory, Remarks on affine complete distributive lattices, Orthomodular Lattices in Occurrence Nets, A Random Bag Preserving Product Operation, A Catalog ofWeak Many-Valued Modal Axioms and their Corresponding Frame Classes, Frame constructions, truth invariance and validity preservation in many-valued modal logic, Purely chromatic and hyper chromatic lattices, On Detecting Regular Predicates in Distributed Systems, CAPACITIES AND GAMES ON LATTICES: A SURVEY OF RESULTS, A study of the order dimension of a poset using matrices, Qualitative versus quantitative fixed point techniques in computer science, Multi-valued Verification of Strategic Ability, Design and comparison of lattices of topological relations for spatial representation and reasoning, Information Algebra, Supervisory Control with Complete Observations, Lattices in Social Networks with Influence, Cooperative Game as Non-Additive Measure, Unnamed Item, Approximation Schemes in Logic and Artificial Intelligence, Context Algebras, Context Frames, and Their Discrete Duality, Reduced Lattices of Synchrony Subspaces and Their Indices, Unnamed Item, Data Analytic Methods for Latent Partially Ordered Classification Models, Unnamed Item, Extremal elements of a sublattice of the majorization lattice and approximate majorization, Poset valued intuitionistic fuzzy sets, Injectivity of directed complete poset acts, Convex structures via convex $L$-subgroups of an $L$-ordered group, Termination analysis for offline partial evaluation of a higher order functional language, On the relation between the subadditivity cone and the quantum entropy cone, Order based on associative operations, Pervin spaces and Frith frames: bitopological aspects and completion, Lifting associative operations on subposets of a complete lattice, Omega-rings, A unified way to studies of t-seminorms, t-semiconorms and semi-uninorms on a complete lattice in terms of behaviour operations, Complete Q‐matrices in conjunctive models on general attribute structures, Covering energy of posets and its bounds, A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices, Continuation sheaves in dynamics: sheaf cohomology and bifurcation, A note on cuts of lattice-valued functions and concept lattices, Esakia duals of regular Heyting algebras, The 2-Additive Choquet Integral of Bi-capacities, Down closed-quasi-injectivity of partially ordered acts, Finite embeddability property for residuated lattices via regular languages, The duality between the anti-exchange closure operators and the path independent choice operators on a finite set, Ample fields as a basis for possibilistic processes, Possibility measures and possibility integrals defined on a complete lattice, Quantales, finite observations and strong bisimulation, Learning logic programs with structured background knowledge, $L$-fuzzy lattices: An introduction, Structure of some sand piles model, The structure of a linear chip firing game and related models