Definability of Recursive Predicates in the Induced Subgraph Order

DOI10.1007/978-3-662-54069-5_16zbMath1485.03083OpenAlexW2557506139MaRDI QIDQ5224502

Ramanathan S. Thinniyam

Publication date: 24 July 2019

Published in: Logic and Its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-54069-5_16

zbMATH Keywords

Turing machineorder theorycardinality constraintconnectivity constraintlabel graph

Mathematics Subject Classification ID

Model theory of finite structures (03C13) Interpolation, preservation, definability (03C40) Models of other mathematical theories (03C65)

Related Items (5)

Unnamed Item ⋮ Definability in the substructure ordering of finite directed graphs ⋮ Alternating complexity of counting first-order logic for the subword order ⋮ Unnamed Item ⋮ Definability in the embeddability ordering of finite directed graphs. II

Cites Work

• Definability in the substructure ordering of simple graphs
• 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
• Definability in the embeddability ordering of finite directed graphs
• Theories of orders on the set of words
• Definability in First Order Theories of Graph Orderings
• Logical Foundations of Proof Complexity
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Definability of Recursive Predicates in the Induced Subgraph Order