Degrees of Indiscernibles in Decidable Models

DOI10.2307/1999687zbMath0579.03008OpenAlexW4237232538MaRDI QIDQ3701394

Henry A. Kierstead, Jeffery B. Remmel

Publication date: 1985

Full work available at URL: https://doi.org/10.2307/1999687

zbMATH Keywords

infinite pathdecidable modelrecursive treesfirst order theoryinfinite set of indiscerniblesdegrees of indiscerniblesdegrees of pathsomega-categorical theoryrecursive binary treerecursive omega-branching tree

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25)

Related Items

Nonpresentability of some structures of analysis in hereditarily finite superstructures, \(\mathsf{WKL}_0\) and induction principles in model theory

Cites Work

• Model theory
• Degrees of members of \(\Pi_ 1^ 0\) classes
• Models of axiomatic theories admitting automorphisms
• Indiscernibles and decidable models
• A decidable $ℵ_0$-categorical theory with a non-recursive Ryll-Nardzewski function
• A Basis Result for ∑ 0 3 Sets of Reals with an Application to Minimal Covers
• ∏ 0 1 Classes and Degrees of Theories