scientific article; zbMATH DE number 6943959

DOI10.23638/LMCS-14(3:21)2018MaRDI QIDQ4683860

Ramanathan S. Thinniyam

Publication date: 26 September 2018

Full work available at URL: https://arxiv.org/abs/1709.03060

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

posetgraph minorpartial orderinduced subgraphsubgraphcomputablefirst order logicrecursivegraph orderlogical theory

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Related Items (5)

The Subtrace Order and Counting First-Order Logic ⋮ 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 ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Definability in the substructure ordering of simple graphs
• Orderings for term-rewriting systems
• Finite model theory and its applications.
• Graph minors. XX: Wagner's conjecture
• Definability in substructure orderings. II: Finite ordered sets
• Definability in substructure orderings. I: Finite semilattices
• Definability in substructure orderings. IV: Finite lattices
• Definability in substructure orderings. III: Finite distributive lattices
• Fundamentals of generalized recursion theory
• Some simplified NP-complete graph problems
• The first-order theory of lexicographic path orderings is undecidable
• Definability in the embeddability ordering of finite directed graphs
• Random graphons and a weak Positivstellensatz for graphs
• Experimental Descriptive Complexity
• On 3-Hypergraphs with Forbidden 4-Vertex Configurations
• Theories of orders on the set of words
• A Gandy Theorem for Abstract Structures and Applications to First-Order Definability
• Definability in the Subword Order
• Definability of Recursive Predicates in the Induced Subgraph Order
• Definability in First Order Theories of Graph Orderings
• Undecidability of linear inequalities in graph homomorphism densities
• Concatenation as a basis for arithmetic

This page was built for publication: