On universal positive graphs
From MaRDI portal
Publication:2687461
Recommendations
Cites work
- scientific article; zbMATH DE number 1194938 (Why is no real title available?)
- scientific article; zbMATH DE number 3068973 (Why is no real title available?)
- scientific article; zbMATH DE number 3093421 (Why is no real title available?)
- A survey on universal computably enumerable equivalence relations
- Classifying positive equivalence relations
- Computably enumerable equivalence relations
- Efficient Planarity Testing
- Fastplättbare Graphen
- Finitely axiomatizable quasivarieties of graphs
- Graph Coloring and Reverse Mathematics
- Joins and meets in the structure of ceers
- On dark computably enumerable equivalence relations
- On isomorphism classes of computably enumerable equivalence relations
- Positive equivalences
- Positive preorders
- Special classes of positive preorders
- Straight Line Representations of Infinite Planar Graphs
- The structure of computably enumerable preorder relations
- The theory of ceers computes true arithmetic
- Turing computability. Theory and applications
- Universal computably enumerable equivalence relations
- Universally axiomatizable subclasses of locally finite classes of models
- Weakly precomplete computably enumerable equivalence relations
This page was built for publication: On universal positive graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2687461)