The following pages link to (Q4190106):
Displaying 8 items.
- A family of Gödel hybrid logics (Q631082) (← links)
- Semantics of algorithmic languages (Q760200) (← links)
- A structure to decide reachability in Petri nets (Q1193891) (← links)
- On deciding confluence of finite string-rewriting systems modulo partial commutativity (Q1262758) (← links)
- Rewriting modulo isotopies in pivotal linear \((2,2)\)-categories (Q2122211) (← links)
- Focused proof-search in the logic of bunched implications (Q2233409) (← links)
- Mechanizable inductive proofs for a class of ∀ ∃ formulas (Q5210766) (← links)
- A rewriting coherence theorem with applications in homotopy type theory (Q5879270) (← links)