nLab r-reversible n-poset

Contents

Context

Higher category theory

higher category theory

Basic concepts

Basic theorems

Applications

Models

Morphisms

Functors

Universal constructions

Extra properties and structure

1-categorical presentations

Contents

Idea

Just as an ( , r ) (\infinity,r) -category could be nn-connected, orthogonal to nn-truncated (,r)(\infinity,r)-categories, which are just (n,r)(n,r)-categories, an (n,)(n,\infty)-category, or ( n + 1 ) (n+1) -poset, could be rr-reversible, which are orthogonal to rr-directed (n+1)(n+1)-posets, which are just ( n , r ) (n,r) -categories.

Definition

An nn-poset is rr-reversible if any kk-morphism for krk \leq r is reversible. You may interpret this definition as weakly or strictly as you like, by starting with weak or strict notions of nn-poset.

Examples

  • A 00-reversible nn-poset is just a nn-poset.

  • A nn-reversible (n+1)(n+1)-poset is a nn-groupoid.

See also

Created on March 2, 2021 at 20:24:41. See the history of this page for a list of all contributions to it.