Models Without Indiscernibles

From MaRDI portal
Publication:4172050

DOI10.2307/2273534zbMath0391.03027OpenAlexW2084048686MaRDI QIDQ4172050

Fred G. Abramson, Leo Harrington

Publication date: 1978

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/4c320966eeb71c6c20fc9fab9c3dffdf9c0a5a4d




Related Items (54)

Partition properties of q-hypergraphsRamsey degrees, labeled and unlabeled partitionsThe Ramsey theory of Henson graphsDistance Preserving Ramsey GraphsInduced partition properties of combinatorial cubesOn induced Ramsey numbers fork-uniform hypergraphsGowers' Ramsey theorem with multiple operations and dynamics of the homeomorphism group of the Lelek fanAutomorphisms of countable recursively saturated models of PA: A surveyA dual Ramsey theorem for permutationsThe partite construction and Ramsey set systemsReducts of random hypergraphsA Ramsey class for Steiner systemsThe 42 reducts of the random ordered graphOn the dual Ramsey property for finite distributive latticesReducts of the random bipartite graphStatistics of orderingsUnary functionsAmenability and unique ergodicity of automorphism groups of countable homogeneous directed graphsCategorical view of the partite lemma in structural Ramsey theoryA short proof of the induced Ramsey theorem for hypergraphsSubrecursive Complexity of Identifying the Ramsey Structure of PosetsA Note on Induced Ramsey NumbersThe Ramsey theory of the universal homogeneous triangle-free graphA short proof of the restricted Ramsey theorem for finite set systemsBig Ramsey degrees in universal inverse limit structuresCanonizing structural Ramsey theoremsCharacterization of NIP theories by ordered graph-indiscerniblesRamsey transfer to semi-retractionsDirect Ramsey theorem for structures involving relations and functionsOn dual Ramsey theorems for relational structuresA new look at interpretability and saturationRamsey precompact expansions of homogeneous directed graphsA new proof of the Nešetřil-Rödl theoremPre-adjunctions and the Ramsey propertyRamsey properties and extending partial automorphisms forhbox classes of finite structuresDirected graphs and boron treesMinimal functions on the random graphRamsey degrees of bipartite graphs: a primitive recursive proofA Ramsey theorem for structures with both relations and functionsRamsey partial orders from acyclic graphsThe Ramsey and the ordering property for classes of lattices and semilatticesSchaefer's Theorem for GraphsAutomorphism groups of finite topological rankRamsey properties of finite posetsOn \(n\)-dependenceSymmetry and the Ramsey degrees of finite relational structuresFixed points in compactifications and combinatorial counterpartsA Ramsey theorem for multiposetsTwo proofs of the Ramsey property of the class of finite hypergraphsAll those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms)Induced partition theoremsUnnamed ItemCanonizing Ramsey theorems for finite graphs and hypergraphsKarp complexity and classes with the independence property




This page was built for publication: Models Without Indiscernibles