On first-order expressibility of satisfiability in submodels

Abstract

Let ,λ be regular cardinals, λ, let be a sentence of the language L,λ in a given signature, and let () express the fact that holds in a submodel, i.e., any model A in the signature satisfies () if and only if some submodel B of A satisfies . It was shown in [1] that, whenever is in L,ω in the signature having less than functional symbols (and arbitrarily many predicate symbols), then () is equivalent to a monadic existential sentence in the second-order language L2,ω, and that for any signature having at least one binary predicate symbol there exists in Lω,ω such that () is not equivalent to any (first-order) sentence in L∞,ω. Nevertheless, in certain cases () are first-order expressible. In this note, we provide several (syntactical and semantical) characterizations of the case when () is in L, and is ω or a certain large cardinal.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…