Q4683860 (Q4683860): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4954438 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The first-order theory of lexicographic path orderings is undecidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orderings for term-rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2703808 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of generalized recursion theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite model theory and its applications. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability of linear inequalities in graph homomorphism densities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental Descriptive Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definability in substructure orderings. I: Finite semilattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definability in substructure orderings. III: Finite distributive lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definability in substructure orderings. IV: Finite lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definability in substructure orderings. II: Finite ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5278312 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Gandy Theorem for Abstract Structures and Applications to First-Order Definability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definability in the Subword Order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definability in the embeddability ordering of finite directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theories of orders on the set of words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random graphons and a weak Positivstellensatz for graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concatenation as a basis for arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definability in First Order Theories of Graph Orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 3-Hypergraphs with Forbidden 4-Vertex Configurations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XX: Wagner's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definability of Recursive Predicates in the Induced Subgraph Order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definability in the substructure ordering of simple graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:07, 16 July 2024

scientific article; zbMATH DE number 6943959
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 6943959

    Statements

    26 September 2018
    0 references
    first order logic
    0 references
    logical theory
    0 references
    graph order
    0 references
    subgraph
    0 references
    graph minor
    0 references
    induced subgraph
    0 references
    recursive
    0 references
    computable
    0 references
    poset
    0 references
    partial order
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers