Models Without Indiscernibles

DOI10.2307/2273534zbMath0391.03027MaRDI QIDQ4172050

Leo Harrington, Fred G. Abramson

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

zbMATH Keywords

Ramsey Theorem; Completion of Peano Arithmetic; End-Extension; Hanf Numbers; Indiscernible Sequences of Ordinals; Omitting Types; Standard Model of Peano Arithmetic

Mathematics Subject Classification ID

03H15: Nonstandard models of arithmetic

03E05: Other combinatorial set theory

03C55: Set-theoretic model theory

Related Items

Characterization of NIP theories by ordered graph-indiscernibles, Direct Ramsey theorem for structures involving relations and functions, Ramsey properties of finite posets, Induced partition theorems, A short proof of the restricted Ramsey theorem for finite set systems, A Ramsey theorem for structures with both relations and functions, Canonizing Ramsey theorems for finite graphs and hypergraphs, Partition properties of q-hypergraphs, Induced partition properties of combinatorial cubes, The partite construction and Ramsey set systems, Symmetry and the Ramsey degrees of finite relational structures, Ramsey degrees of bipartite graphs: a primitive recursive proof, Two proofs of the Ramsey property of the class of finite hypergraphs, Karp complexity and classes with the independence property, Automorphisms of countable recursively saturated models of PA: A survey, Reducts of random hypergraphs, Reducts of the random bipartite graph, Distance Preserving Ramsey Graphs, Subrecursive Complexity of Identifying the Ramsey Structure of Posets