Defining recursive predicates in graph orders
From MaRDI portal
Recommendations
- Definability of recursive predicates in the induced subgraph order
- Definability in first order theories of graph orderings
- Definability in first-order theories of graph orderings
- Definability in the substructure ordering of simple graphs
- Definability in the embeddability ordering of finite directed graphs. II
Cites work
- A Gandy theorem for abstract structures and applications to first-order definability
- A mathematical introduction to logic.
- Concatenation as a basis for arithmetic
- Decidability in the logic of subsequences and supersequences
- Definability in first order theories of graph orderings
- Definability in substructure orderings. I: Finite semilattices
- Definability in substructure orderings. II: Finite ordered sets
- Definability in substructure orderings. III: Finite distributive lattices
- Definability in substructure orderings. IV: Finite lattices
- Definability in the embeddability ordering of finite directed graphs
- Definability in the substructure ordering of simple graphs
- Definability in the Subword Order
- Definability of recursive predicates in the induced subgraph order
- Experimental descriptive complexity
- Finite model theory and its applications.
- Fundamentals of generalized recursion theory
- Graph minors. XX: Wagner's conjecture
- scientific article; zbMATH DE number 2117181 (Why is no real title available?)
- scientific article; zbMATH DE number 1456949 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- On 3-hypergraphs with forbidden 4-vertex configurations
- Orderings for term-rewriting systems
- Random graphons and a weak positivstellensatz for graphs
- Some simplified NP-complete graph problems
- The first-order theory of lexicographic path orderings is undecidable
- Theories of orders on the set of words
- Undecidability of linear inequalities in graph homomorphism densities
Cited in
(8)- Definability in the substructure ordering of finite directed graphs
- Complexity in Young's lattice
- Alternating complexity of counting first-order logic for the subword order
- The subtrace order and counting first-order logic
- Complexity of counting first-order logic for the subword order
- Definability in first-order theories of graph orderings
- Definability of recursive predicates in the induced subgraph order
- Definability in first order theories of graph orderings
This page was built for publication: Defining recursive predicates in graph orders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4683860)
