\documentclass[12pt,titlepage]{article}

\usepackage{amsmath}
\usepackage{mathrsfs}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsthm}
\usepackage{mathtools}
\usepackage{graphicx}
\usepackage{color}
\usepackage{ucs}
\usepackage[utf8x]{inputenc}
\usepackage{xparse}
\usepackage{hyperref}

%----Macros----------
%
% Unresolved issues:
%
%  \righttoleftarrow
%  \lefttorightarrow
%
%  \color{} with HTML colorspec
%  \bgcolor
%  \array with options (without options, it's equivalent to the matrix environment)

% Of the standard HTML named colors, white, black, red, green, blue and yellow
% are predefined in the color package. Here are the rest.
\definecolor{aqua}{rgb}{0, 1.0, 1.0}
\definecolor{fuschia}{rgb}{1.0, 0, 1.0}
\definecolor{gray}{rgb}{0.502, 0.502, 0.502}
\definecolor{lime}{rgb}{0, 1.0, 0}
\definecolor{maroon}{rgb}{0.502, 0, 0}
\definecolor{navy}{rgb}{0, 0, 0.502}
\definecolor{olive}{rgb}{0.502, 0.502, 0}
\definecolor{purple}{rgb}{0.502, 0, 0.502}
\definecolor{silver}{rgb}{0.753, 0.753, 0.753}
\definecolor{teal}{rgb}{0, 0.502, 0.502}

% Because of conflicts, \space and \mathop are converted to
% \itexspace and \operatorname during preprocessing.

% itex: \space{ht}{dp}{wd}
%
% Height and baseline depth measurements are in units of tenths of an ex while
% the width is measured in tenths of an em.
\makeatletter
\newdimen\itex@wd%
\newdimen\itex@dp%
\newdimen\itex@thd%
\def\itexspace#1#2#3{\itex@wd=#3em%
\itex@wd=0.1\itex@wd%
\itex@dp=#2ex%
\itex@dp=0.1\itex@dp%
\itex@thd=#1ex%
\itex@thd=0.1\itex@thd%
\advance\itex@thd\the\itex@dp%
\makebox[\the\itex@wd]{\rule[-\the\itex@dp]{0cm}{\the\itex@thd}}}
\makeatother

% \tensor and \multiscript
\makeatletter
\newif\if@sup
\newtoks\@sups
\def\append@sup#1{\edef\act{\noexpand\@sups={\the\@sups #1}}\act}%
\def\reset@sup{\@supfalse\@sups={}}%
\def\mk@scripts#1#2{\if #2/ \if@sup ^{\the\@sups}\fi \else%
  \ifx #1_ \if@sup ^{\the\@sups}\reset@sup \fi {}_{#2}%
  \else \append@sup#2 \@suptrue \fi%
  \expandafter\mk@scripts\fi}
\def\tensor#1#2{\reset@sup#1\mk@scripts#2_/}
\def\multiscripts#1#2#3{\reset@sup{}\mk@scripts#1_/#2%
  \reset@sup\mk@scripts#3_/}
\makeatother

% \slash
\makeatletter
\newbox\slashbox \setbox\slashbox=\hbox{$/$}
\def\itex@pslash#1{\setbox\@tempboxa=\hbox{$#1$}
  \@tempdima=0.5\wd\slashbox \advance\@tempdima 0.5\wd\@tempboxa
  \copy\slashbox \kern-\@tempdima \box\@tempboxa}
\def\slash{\protect\itex@pslash}
\makeatother

% math-mode versions of \rlap, etc
% from Alexander Perlis, "A complement to \smash, \llap, and lap"
%   http://math.arizona.edu/~aprl/publications/mathclap/
\def\clap#1{\hbox to 0pt{\hss#1\hss}}
\def\mathllap{\mathpalette\mathllapinternal}
\def\mathrlap{\mathpalette\mathrlapinternal}
\def\mathclap{\mathpalette\mathclapinternal}
\def\mathllapinternal#1#2{\llap{$\mathsurround=0pt#1{#2}$}}
\def\mathrlapinternal#1#2{\rlap{$\mathsurround=0pt#1{#2}$}}
\def\mathclapinternal#1#2{\clap{$\mathsurround=0pt#1{#2}$}}

% Renames \sqrt as \oldsqrt and redefine root to result in \sqrt[#1]{#2}
\let\oldroot\root
\def\root#1#2{\oldroot #1 \of{#2}}
\renewcommand{\sqrt}[2][]{\oldroot #1 \of{#2}}

% Manually declare the txfonts symbolsC font
\DeclareSymbolFont{symbolsC}{U}{txsyc}{m}{n}
\SetSymbolFont{symbolsC}{bold}{U}{txsyc}{bx}{n}
\DeclareFontSubstitution{U}{txsyc}{m}{n}

% Manually declare the stmaryrd font
\DeclareSymbolFont{stmry}{U}{stmry}{m}{n}
\SetSymbolFont{stmry}{bold}{U}{stmry}{b}{n}

% Manually declare the MnSymbolE font
\DeclareFontFamily{OMX}{MnSymbolE}{}
\DeclareSymbolFont{mnomx}{OMX}{MnSymbolE}{m}{n}
\SetSymbolFont{mnomx}{bold}{OMX}{MnSymbolE}{b}{n}
\DeclareFontShape{OMX}{MnSymbolE}{m}{n}{
    <-6>  MnSymbolE5
   <6-7>  MnSymbolE6
   <7-8>  MnSymbolE7
   <8-9>  MnSymbolE8
   <9-10> MnSymbolE9
  <10-12> MnSymbolE10
  <12->   MnSymbolE12}{}

% Declare specific arrows from txfonts without loading the full package
\makeatletter
\def\re@DeclareMathSymbol#1#2#3#4{%
    \let#1=\undefined
    \DeclareMathSymbol{#1}{#2}{#3}{#4}}
\re@DeclareMathSymbol{\neArrow}{\mathrel}{symbolsC}{116}
\re@DeclareMathSymbol{\neArr}{\mathrel}{symbolsC}{116}
\re@DeclareMathSymbol{\seArrow}{\mathrel}{symbolsC}{117}
\re@DeclareMathSymbol{\seArr}{\mathrel}{symbolsC}{117}
\re@DeclareMathSymbol{\nwArrow}{\mathrel}{symbolsC}{118}
\re@DeclareMathSymbol{\nwArr}{\mathrel}{symbolsC}{118}
\re@DeclareMathSymbol{\swArrow}{\mathrel}{symbolsC}{119}
\re@DeclareMathSymbol{\swArr}{\mathrel}{symbolsC}{119}
\re@DeclareMathSymbol{\nequiv}{\mathrel}{symbolsC}{46}
\re@DeclareMathSymbol{\Perp}{\mathrel}{symbolsC}{121}
\re@DeclareMathSymbol{\Vbar}{\mathrel}{symbolsC}{121}
\re@DeclareMathSymbol{\sslash}{\mathrel}{stmry}{12}
\re@DeclareMathSymbol{\bigsqcap}{\mathop}{stmry}{"64}
\re@DeclareMathSymbol{\biginterleave}{\mathop}{stmry}{"6}
\re@DeclareMathSymbol{\invamp}{\mathrel}{symbolsC}{77}
\re@DeclareMathSymbol{\parr}{\mathrel}{symbolsC}{77}
\makeatother

% \llangle, \rrangle, \lmoustache and \rmoustache from MnSymbolE
\makeatletter
\def\Decl@Mn@Delim#1#2#3#4{%
  \if\relax\noexpand#1%
    \let#1\undefined
  \fi
  \DeclareMathDelimiter{#1}{#2}{#3}{#4}{#3}{#4}}
\def\Decl@Mn@Open#1#2#3{\Decl@Mn@Delim{#1}{\mathopen}{#2}{#3}}
\def\Decl@Mn@Close#1#2#3{\Decl@Mn@Delim{#1}{\mathclose}{#2}{#3}}
\Decl@Mn@Open{\llangle}{mnomx}{'164}
\Decl@Mn@Close{\rrangle}{mnomx}{'171}
\Decl@Mn@Open{\lmoustache}{mnomx}{'245}
\Decl@Mn@Close{\rmoustache}{mnomx}{'244}
\makeatother

% Widecheck
\makeatletter
\DeclareRobustCommand\widecheck[1]{{\mathpalette\@widecheck{#1}}}
\def\@widecheck#1#2{%
    \setbox\z@\hbox{\m@th$#1#2$}%
    \setbox\tw@\hbox{\m@th$#1%
       \widehat{%
          \vrule\@width\z@\@height\ht\z@
          \vrule\@height\z@\@width\wd\z@}$}%
    \dp\tw@-\ht\z@
    \@tempdima\ht\z@ \advance\@tempdima2\ht\tw@ \divide\@tempdima\thr@@
    \setbox\tw@\hbox{%
       \raise\@tempdima\hbox{\scalebox{1}[-1]{\lower\@tempdima\box
\tw@}}}%
    {\ooalign{\box\tw@ \cr \box\z@}}}
\makeatother

% \mathraisebox{voffset}[height][depth]{something}
\makeatletter
\NewDocumentCommand\mathraisebox{moom}{%
\IfNoValueTF{#2}{\def\@temp##1##2{\raisebox{#1}{$\m@th##1##2$}}}{%
\IfNoValueTF{#3}{\def\@temp##1##2{\raisebox{#1}[#2]{$\m@th##1##2$}}%
}{\def\@temp##1##2{\raisebox{#1}[#2][#3]{$\m@th##1##2$}}}}%
\mathpalette\@temp{#4}}
\makeatletter

% udots (taken from yhmath)
\makeatletter
\def\udots{\mathinner{\mkern2mu\raise\p@\hbox{.}
\mkern2mu\raise4\p@\hbox{.}\mkern1mu
\raise7\p@\vbox{\kern7\p@\hbox{.}}\mkern1mu}}
\makeatother

%% Fix array
\newcommand{\itexarray}[1]{\begin{matrix}#1\end{matrix}}
%% \itexnum is a noop
\newcommand{\itexnum}[1]{#1}

%% Renaming existing commands
\newcommand{\underoverset}[3]{\underset{#1}{\overset{#2}{#3}}}
\newcommand{\widevec}{\overrightarrow}
\newcommand{\darr}{\downarrow}
\newcommand{\nearr}{\nearrow}
\newcommand{\nwarr}{\nwarrow}
\newcommand{\searr}{\searrow}
\newcommand{\swarr}{\swarrow}
\newcommand{\curvearrowbotright}{\curvearrowright}
\newcommand{\uparr}{\uparrow}
\newcommand{\downuparrow}{\updownarrow}
\newcommand{\duparr}{\updownarrow}
\newcommand{\updarr}{\updownarrow}
\newcommand{\gt}{>}
\newcommand{\lt}{<}
\newcommand{\map}{\mapsto}
\newcommand{\embedsin}{\hookrightarrow}
\newcommand{\Alpha}{A}
\newcommand{\Beta}{B}
\newcommand{\Zeta}{Z}
\newcommand{\Eta}{H}
\newcommand{\Iota}{I}
\newcommand{\Kappa}{K}
\newcommand{\Mu}{M}
\newcommand{\Nu}{N}
\newcommand{\Rho}{P}
\newcommand{\Tau}{T}
\newcommand{\Upsi}{\Upsilon}
\newcommand{\omicron}{o}
\newcommand{\lang}{\langle}
\newcommand{\rang}{\rangle}
\newcommand{\Union}{\bigcup}
\newcommand{\Intersection}{\bigcap}
\newcommand{\Oplus}{\bigoplus}
\newcommand{\Otimes}{\bigotimes}
\newcommand{\Wedge}{\bigwedge}
\newcommand{\Vee}{\bigvee}
\newcommand{\coproduct}{\coprod}
\newcommand{\product}{\prod}
\newcommand{\closure}{\overline}
\newcommand{\integral}{\int}
\newcommand{\doubleintegral}{\iint}
\newcommand{\tripleintegral}{\iiint}
\newcommand{\quadrupleintegral}{\iiiint}
\newcommand{\conint}{\oint}
\newcommand{\contourintegral}{\oint}
\newcommand{\infinity}{\infty}
\newcommand{\bottom}{\bot}
\newcommand{\minusb}{\boxminus}
\newcommand{\plusb}{\boxplus}
\newcommand{\timesb}{\boxtimes}
\newcommand{\intersection}{\cap}
\newcommand{\union}{\cup}
\newcommand{\Del}{\nabla}
\newcommand{\odash}{\circleddash}
\newcommand{\negspace}{\!}
\newcommand{\widebar}{\overline}
\newcommand{\textsize}{\normalsize}
\renewcommand{\scriptsize}{\scriptstyle}
\newcommand{\scriptscriptsize}{\scriptscriptstyle}
\newcommand{\mathfr}{\mathfrak}
\newcommand{\statusline}[2]{#2}
\newcommand{\tooltip}[2]{#2}
\newcommand{\toggle}[2]{#2}

% Theorem Environments
\theoremstyle{plain}
\newtheorem{theorem}{Theorem}
\newtheorem{lemma}{Lemma}
\newtheorem{prop}{Proposition}
\newtheorem{cor}{Corollary}
\newtheorem*{utheorem}{Theorem}
\newtheorem*{ulemma}{Lemma}
\newtheorem*{uprop}{Proposition}
\newtheorem*{ucor}{Corollary}
\theoremstyle{definition}
\newtheorem{defn}{Definition}
\newtheorem{example}{Example}
\newtheorem*{udefn}{Definition}
\newtheorem*{uexample}{Example}
\theoremstyle{remark}
\newtheorem{remark}{Remark}
\newtheorem{note}{Note}
\newtheorem*{uremark}{Remark}
\newtheorem*{unote}{Note}

%-------------------------------------------------------------------

\begin{document}

%-------------------------------------------------------------------


\section*{(n,r)-category}

\hypertarget{context}{}\subsubsection*{{Context}}\label{context}

\hypertarget{higher_category_theory}{}\paragraph*{{Higher category theory}}\label{higher_category_theory}

[[!include higher category theory - contents]]

\hypertarget{contents}{}\section*{{Contents}}\label{contents}

\noindent\hyperlink{idea}{Idea}\dotfill \pageref*{idea} \linebreak
\noindent\hyperlink{Definition}{Definition}\dotfill \pageref*{Definition} \linebreak
\noindent\hyperlink{HomtopyTheory}{Homotopy-theoretic relation}\dotfill \pageref*{HomtopyTheory} \linebreak
\noindent\hyperlink{special_cases}{Special cases}\dotfill \pageref*{special_cases} \linebreak
\noindent\hyperlink{topos_cases}{Topos cases}\dotfill \pageref*{topos_cases} \linebreak
\noindent\hyperlink{the_periodic_table}{The periodic table}\dotfill \pageref*{the_periodic_table} \linebreak
\noindent\hyperlink{models_for_weak_nrcategories}{Models for weak (n,r)-categories}\dotfill \pageref*{models_for_weak_nrcategories} \linebreak
\noindent\hyperlink{related_concepts}{Related concepts}\dotfill \pageref*{related_concepts} \linebreak
\noindent\hyperlink{references}{References}\dotfill \pageref*{references} \linebreak


\hypertarget{idea}{}\subsection*{{Idea}}\label{idea}

An $(n,r)$-category is a [[higher category theory|higher category]] such that, essentially:

\begin{itemize}%
\item all [[k-morphisms]] for $k \gt n$ are trivial.


\item all [[k-morphisms]] for $k \gt r$ are reversible.



\end{itemize}
Put another way: given a sequence of (higher) categories $C_0, C_1, ..., C_n$ in which each $C_{i+1}$ is of the form $Hom(A, B)$ for some $0$-cells $A$ and $B$ from $C_i$, let us say that $C_n$ is a depth-$n$ Hom-category of $C_0$. (We can also cleanly extend this notion to depth-$\infty$ Hom-categories, by taking the position that there are none). An $(n, r)$-category, then, is one in which every depth-$r$ Hom-category is an $\infty$-groupoid, and, furthermore, every depth-$(n+2)$ Hom-category is a [[point]]. (The appearance of $n+2$ here rather than $n$ allows us to make sense of this definition even when $n$ is as low as $-2$, and suggests that perhaps, had history gone differently, the conventions would be to number these differently.)

So $(n,r)$-categories are a generalisation of both $n$-[[n-category|categories]] and $n$-[[n-groupoid|groupoids]], covering all of the ground in between (and a bit beyond). As $n$ increases, there are many more possibilities, until there are infinitely many kinds of $(\infty,r)$-[[(infinity,n)-category|categories]].

[[Eric]]: What is the category of all (small) $(n,r)$-categories? An $(n+1,r+1)$-category?

[[Urs Schreiber]]: yes, that should be right. Roughly the argument is that a $(k+1)$-morphism of $(n,r)Cat$ is a [[(n,k)-transformation]]:

\begin{itemize}%
\item a 1-morphism in $(n,r)Cat$ is an $n$-functor $C \stackrel{F}{\to} D$ , hence an ``$(n,0)$-transformation''


\item a 2-morphism is a transformation between $n$-functors, hence a ``(n,1)-transformation''.


\item and so on


\item finally an $(n+1)$-morphism is an $(n,n)$-transformation.



\end{itemize}
So $(n,r)Cat$ is an $(n+1)$-category.

The invertibiliy of the $(n,k)$-transformations is that of their components which are $(\ell \geq k)$-morphisms in the target $n$-category $D$. So if all $(\ell \gt r)$-morphisms in $D$ are invertible, then so are all $(n,\ell \gt r)$-transformations between $C$ and $D$ hence all $(\ell \gt r+1)$-morphisms in $(n,r)Cat$. So $(n,r)Cat$ is an $(n+1,r+1)$-category.

\hypertarget{Definition}{}\subsection*{{Definition}}\label{Definition}

Given a notion of $\infty$-[[infinity-category|category]] (as weak or strict as you like), then an \textbf{$(n,r)$-category} can be defined to be an $\infty$-category such that

\begin{itemize}%
\item any $j$-morphism is an [[equivalence]], for $j \gt r$;
\item any two [[parallel morphisms|parallel]] $j$-morphisms are equivalent, for $j \gt n$.

\end{itemize}
As explained below, we may assume that $n \geq -2$ and $0 \leq r \leq n + 1$ (but still allowing $r = 0$ for $n = - 2$).

For finite $r$, we can also define this inductively in terms of [[(∞,r)-categories]] as follows:

\begin{defn}
\label{}\hypertarget{}{}
For $-2 \leq n \leq \infty$, an \textbf{[[(n,0)-category]]} is an [[∞-groupoid]] that is [[n-truncated]]: an [[n-groupoid]].

For $0 \lt r \lt \infty$, an \textbf{(n,r)-category} is an [[(∞,r)-category]] $C$ such that for all [[object]]s $X,Y \in C$ the $(\infty,r-1)$-categorical [[hom-object]] $C(X,Y)$ is an $(n-1,r-1)$-category.

\end{defn}
(Even for $r = \infty$, this definition makes sense, taking $\infty - 1$ to be $\infty$, as long as we know that an $(-1,\infty)$-category is the same thing as a $(-1,0)$-category. But this may be overkill.)

You can also start with a notion of $n$-[[n-poset|poset]], then define an $(n,r)$-category to be an $(n+1)$-poset such that any $j$-morphism is an [[equivalence]] for $j \gt r$. Or, for $r \leq n$, you can start with a notion of $n$-[[n-category|category]], then define an $(n,r)$-category to be an $n$-category such that any $j$-morphism in an [[equivalence]] for $j \gt r$.

To interpret this correctly for low values of $j$, we must assume that all objects ($0$-morphisms) in a given $\infty$-category are parallel, which leads us to speak of the two $(-1)$-morphisms that serve as their common source and target and to accept any object as an equivalence between these. In particular, any $j$-morphism is an equivalence for $j \lt 1$, so if $r = 0$, then the condition is satisfied for any smaller value of $r$. Thus, we assume that $r \geq 0$.

To say that parallel $(-1)$-morphisms must be equivalent is meaningful; it requires that there be an object. One can continue to $(-2)$-morphisms and so on, but there is nothing to vary about these; so we assume that $n \geq -2$. In other words, a $(-2)$-[[(-2)-category|category]] will automatically be an $n$-category for any smaller value of $n$.

If any two parallel $j$-morphisms are equivalent, then any $j$-morphism between equivalent $(j-1)$-morphisms is an equivalence (being parallel to an identity for $j \gt 0$ and automatically for $j \lt 1$). Accordingly, any $(n,r)$-category for $r \gt n + 1$ is also an $(n,n+1)$-category. Thus, we assume that $r \leq n + 1$. However, when $n = -2$, this contradicts the assumption that $r \geq 0$, so we allow $r = 0$ in that case just to talk about $n = -2$.

\hypertarget{HomtopyTheory}{}\subsection*{{Homotopy-theoretic relation}}\label{HomtopyTheory}

From the point of view of [[homotopy theory]], the notion of $(n,r)$-categories may be understood as a combination of the notion of [[homotopy n-type]] and that of [[directed space]].

Recall that an [[(∞,0)-category]] is an [[∞-groupoid]]. In light of the [[homotopy hypothesis]] -- that identifies $\infty$-groupoids with (nice) [[topological spaces]] and [[n-groupoids]] with [[homotopy n-types]] -- and in view of the notion of [[directed space]], the following terminology is suggestive:

An $(n,r)$-category is an $r$-directed homotopy $n$-type.

Here we read

\begin{itemize}%
\item \emph{$0$-directed} as \emph{undirected}

\end{itemize}
and

\begin{itemize}%
\item \emph{$1$-directed} as \emph{directed} .

\end{itemize}
Then, indeed, we have for instance that

\begin{itemize}%
\item a [[(1,0)-category]] is an undirected 1-type: a 1-[[groupoid]],


\item a [[(n,r)-category|(2,0)-category]] is an undirected 2-type: a [[2-groupoid]],


\item etc.


\item a [[(n,n)-category|(1,1)-category]] is \textbf{directed 1-type} : a [[category]],


\item an [[(n,n)-category]] is an $n$-directed $n$-type: an [[n-category]],


\item etc.


\item an [[(∞,0)-category]] is an undirected space: an [[∞-groupoid]],


\item an [[(∞,1)-category]] is a [[directed space]]: a [[quasi-category]],


\item an [[(∞,n)-category]] is an $n$-directed space


\item etc.



\end{itemize}
[[Mike Shulman]]: I am not convinced that the homotopy hypothesis applies to anything directed. I'll believe that maybe an $r$-directed $n$-type (whatever that means) should \emph{have} a fundamental $(n,r)$-category, and that this operation has a left adjoint that geometrically realizes an $(n,r)$-category as an $r$-directed $n$-type. But I don't see why to expect this adjunction to be an equivalence in the directed world, unless all of your $r$-directed $n$-types come equipped with a chosen CW-complex-like $n$-skeleton which you restrict your fundamental categories to.

More concretely: take the [[interval category]]. Realize it as a directed space; presumably you get a directed topological interval $[0,1]$. Now take the fundamental category of this space: you get the ordered set $[0,1]$ considered as a category---quite different from the interval category! In order to get back the interval category, you need to do something like remember the endpoints of the directed topological interval, and only use these chosen points as the objects of your fundamental category. Perhaps everyone talking about identifying directed homotopy types with higher categories has some fix like this in mind, but if so I think it should be stressed. (Alternately, maybe someone can tell me why I'm completely wrong.)

[[David Roberts]]: Perhaps one could take a leaf out of Ronnie Brown's book and consider filtered/stratified directed spaces. The relative fundamental category is, as you point out, the 'correct' answer.

[[Urs Schreiber]]: right. I didn't mean to imply that there is an established theory of directed spaces that yields a directed homotopy hypothesis-theorem yet. Instead the idea was that ``in view of the homotopy hypothesis'' we should be entitled to think of an $(n,r)$-category as an $r$-directed $n$-type. Over at [[directed space]] I say more explicitly that one option is to \emph{defined} what a (nice) $r$-directed $n$-type is this way. I have very little online time today, otherwise I would now add a paragraph along these lines to the above. Maybe one of you feels like doing it. I still think that th slogan ``An $(n,r)$-category is an $r$-directed $n$-type.'' is a very useful guiding principle, and be it for the right \emph{definition} of directed space. My impression is that the theory of directed spaces is at the time still tentative and not set in stonee. But if that's wrong, then I'd still keep the above slogan but put an explicit caveat that this uses the notion ``diected space'' differently to that established in the literature.

[[David Corfield]]: During a discussion on fundamental categories with duals of statified spaces, we had this \href{http://golem.ph.utexas.edu/category/2006/11/this_weeks_finds_in_mathematic_2.html#c006316}{description} of a project to provide a geometric picture of directed homtopy. Speaking of categories with duals, couldn't nLab do with some more pages on them?

[[Mike Shulman]]: Your definition at [[directed space]] (``a directed space is a topological space in which not every cell is traversable in all directions'') doesn't say anything about a stratification, so I think it's misleading to then say that they could be defined as $(n,r)$-categories without making a point that this would change the notion. My impression from the very little I've read about directed spaces is that they don't necessarily come with any sort of stratification. Do we have any reason to want to define ``$r$-directed $n$-type'' to mean ``$(n,r)$-category'', other than that it would be cute if the homotopy hypothesis could be generalized? We like $(n,r)$-categories for lots of reasons---but would calling them $r$-directed $n$-types really be useful to us or anyone else?

\emph{Toby}: I don't think that it helps our understanding of $(n,r)$-categories, at least not yet, which is why I moved this section down here. But I think that it may help us to understand directed spaces, particularly to suggest the idea that spaces might be $r$-directed.

[[Urs Schreiber]]: I agree with Mike that the statements may currently be too misleading, and with Toby about what they should still achieve for us. Will try to improve on the state of the two entries a bit tomorrow -- unless someone beats me to it.

[[David Roberts]]: Going back to Mike's original comment, having read a little about fundamental categories (fingers automatically started typing `groupoid' there :), the concept of equivalence of categories has to be expanded so as to capture `directed homotopy equivalence'. In particular, there is the notions of [[past retract]] and [[future retract]] - these should be considered as equivalences, but are not equivalences of categories in the usual sense. From memory they are more like (co)relexive subcategories.

\hypertarget{special_cases}{}\subsection*{{Special cases}}\label{special_cases}

An [[(n,n)-category]] is simply an $n$-[[n-category|category]]. An $(n,n+1)$-category is an $(n+1)$-[[n-poset|poset]]. Note that an $\infty$-category and an $\infty$-poset are the same thing. An $(n,0)$-category is an $n$-[[n-groupoid|groupoid]]. Even though they have no special name, $(n,1)$-[[(n,1)-category|categories]] are widely studied.

For low values of $n$, many of these notions coincide. For instance, a $0$-[[0-groupoid|groupoid]] is the same as a $0$-[[0-category|category]], namely a [[set]]. And $(-1)$-[[(-1)-groupoid|groupoid]], $(-1)$-[[(-1)-category|category]], and $0$-[[0-poset|poset]] all mean the same thing (namely, a [[truth value]]) while $(-2)$-[[(-2)-groupoid|groupoid]], $(-2)$-[[(-2)-category|category]], and $(-1)$-[[(-1)-poset|poset]] likewise all mean the same thing (namely, the [[point]]).

Of particular importance is the case where $n = \infty$. See

\begin{itemize}%
\item [[(∞,n)-category]] .

\end{itemize}
\hypertarget{topos_cases}{}\subsubsection*{{Topos cases}}\label{topos_cases}

An analogous systematics exists for $(n,r)$-categories that in additions have the property of being a [[topos]] or [[higher topos theory|higher topos]].

\begin{itemize}%
\item a [[(0,1)-topos]] is a [[Heyting algebra]]

\begin{itemize}%
\item in particular, a $(0,1)$-[[Grothendieck topos]] is a [[locale]]

\end{itemize}

\item a $(1,1)$-topos is a [[topos]]


\item an [[(∞,1)-topos]] is what [[Higher Topos Theory]] calls an $\infty$-topos



\end{itemize}
\hypertarget{the_periodic_table}{}\subsection*{{The periodic table}}\label{the_periodic_table}

There is a [[periodic table]] of $(n,r)$-categories:

\hypertarget{models_for_weak_nrcategories}{}\subsection*{{Models for weak (n,r)-categories}}\label{models_for_weak_nrcategories}

There are various [[model category]] models for collections of $(n,r)$-categories.

\begin{itemize}%
\item The standard [[model structure on simplicial sets]] models [[∞-groupoid|(∞,0)-categories]].


\item The Joyal-[[model structure on simplicial sets]] models [[(∞,1)-category|(∞,1)-categories]].


\item The [[Charles Rezk]]-model structure for [[Theta space]]s models general $(n,r)$-categories.



\end{itemize}
\hypertarget{related_concepts}{}\subsection*{{Related concepts}}\label{related_concepts}

\begin{itemize}%
\item [[(n,r)-site]]


\item [[0-category]], [[(0,1)-category]]


\item [[category]]


\item [[2-category]]


\item [[3-category]]


\item [[n-category]]


\item [[(∞,0)-category]]


\item [[(n,1)-category]]


\item [[(∞,1)-category]]


\item [[(∞,2)-category]]


\item [[(∞,n)-category]]


\item \textbf{(n,r)-category}


\item [[(n × k)-category]], [[n-fold category]]



\end{itemize}
\hypertarget{references}{}\subsection*{{References}}\label{references}

\begin{itemize}%
\item [[John Baez]], [[Michael Shulman]], \emph{Lectures on n-Categories and Cohomology}, (\href{https://arxiv.org/abs/math/0608420}{arXiv:math/0608420}), in particular pp. 34-36.

\end{itemize}
[[!redirects (n,r) categories]] [[!redirects (n,r) category]] [[!redirects (n,r)-categories]] [[!redirects (n,r)-category]] [[!redirects (n, r)-category]] [[!redirects (n, r)-categories]]



\end{document}