Similar Items: Definable isomorphism problem
- On the First-Order Complexity of Induced Subgraph Isomorphism
- Type Isomorphisms for Multiplicative-Additive Linear Logic
- A proof system for graph (non)-isomorphism verification
- Isomorphisms of types in the presence of higher-order references (extended version)
- Ellipses and Lambda Definability
- Deciding definability in FO2(