- objects,
especially systems of
axioms or
semantics for them, are
called cryptomorphic if they are
equivalent but not
obviously equivalent. In particular,...
-
formalizing weak orderings, that are
different from each
other but
cryptomorphic (interconvertable with no loss of information): they may be axiomatized...
-
interpreted as
showing that the
objects in the two
isomorphic classes are
cryptomorphic to each other. For instance, the
triangulations of
regular polygons...
-
closed subset has a
unique generic point.
Sober spaces have a
variety of
cryptomorphic definitions,
which are do****ented in this
section . In each case below...
- {\displaystyle (E,C,D)} is a graphoid. Thus,
graphoids give a self-dual
cryptomorphic axiomatization of matroids. Let E {\displaystyle E} be a
finite set...
- and
relational programming. For instance, in 2019 he was
coauthor of "
Cryptomorphic topological structures: a com****tional
relation algebraic approach"...
-
structures that
possess multiple equivalent axiomatizations are
called cryptomorphic.) Let E {\displaystyle E} be any set. We
refer to E {\displaystyle E}...
