FLOC 2018: FEDERATED LOGIC CONFERENCE 2018

This page contains an index consisting of author-provided keywords.

A
A-infinity-(co)algebras	Minimal models for monomial algebras
Adjunctions	Termination in linear (2,2)-categories with braidings and duals
Associative operad	Generalizations of the associative operad and convergent rewrite systems
B
Backus FP	Minimal Bacus FP is Turing Complete
bicategories	Merge-bicategories: towards semi-strictification of higher categories
Braidings	Termination in linear (2,2)-categories with braidings and duals
Buchberger algorithm	Generalizations of the associative operad and convergent rewrite systems
C
Cartesian Monoids	Minimal Bacus FP is Turing Complete
Categorification	Termination in linear (2,2)-categories with braidings and duals
Chinese monoids	String data structures for Chinese monoids
coherence	Merge-bicategories: towards semi-strictification of higher categories
coherent presentations	String data structures for Chinese monoids
Combinatorics	Generalizations of the associative operad and convergent rewrite systems
Confluence and Standardization	Minimal Bacus FP is Turing Complete
cross-section property	String data structures for Chinese monoids
E
Eckmann-Hilton morphism	Towards a fully formalized definition of syllepsis in weak higher categories
F
formalization	Towards a fully formalized definition of syllepsis in weak higher categories
H
Higher dimensional linear rewriting	Termination in linear (2,2)-categories with braidings and duals
Homological algebra	Minimal models for monomial algebras
Homotopical algebra	Minimal models for monomial algebras
I
isotopy	Normal forms for planar connected string diagrams
L
Linear categories	Termination in linear (2,2)-categories with braidings and duals
Linear polygraphs	Termination in linear (2,2)-categories with braidings and duals
M
Minimal models	Minimal models for monomial algebras
monoidal categories	Normal forms for planar connected string diagrams
multicategories	Merge-bicategories: towards semi-strictification of higher categories
multitope	The equivalence between opetopic sets and many-to-one polygraphs
N
normal forms	Normal forms for planar connected string diagrams
O
Operad	Generalizations of the associative operad and convergent rewrite systems
opetope	The equivalence between opetopic sets and many-to-one polygraphs
P
polycategories	Merge-bicategories: towards semi-strictification of higher categories
polygraph	The equivalence between opetopic sets and many-to-one polygraphs
polygraphs	Merge-bicategories: towards semi-strictification of higher categories
R
Rewrite system	Generalizations of the associative operad and convergent rewrite systems
rewriting	Normal forms for planar connected string diagrams
S
Simulation of Turing Machines	Minimal Bacus FP is Turing Complete
strictification	Merge-bicategories: towards semi-strictification of higher categories
string data structures	String data structures for Chinese monoids
string diagram	Normal forms for planar connected string diagrams
Sylleptic categories	Towards a fully formalized definition of syllepsis in weak higher categories
T
termination	Termination in linear (2,2)-categories with braidings and duals
Tree	Generalizations of the associative operad and convergent rewrite systems
W
Weak omega category theory	Towards a fully formalized definition of syllepsis in weak higher categories
weak units	Merge-bicategories: towards semi-strictification of higher categories

Disclaimer | Powered by EasyChair Smart Program