2000 character limit reached
Variations on the Feferman-Vaught Theorem, with applications to $\prod_p \mathbb{F}_p$
Published 7 Dec 2018 in math.LO | (1812.02905v1)
Abstract: Using the Feferman-Vaught Theorem, we prove that a definable subset of a product structure must be a Boolean combination of open sets, in the product topology induced by giving each factor structure the discrete topology. We prove a converse of the Feferman-Vaught theorem for families of structures with certain properties, including families of integral domains. We use these results to obtain characterizations of the definable subsets of $\prod_p \mathbb{F}_p$ -- in particular, every formula is equivalent to a Boolean combination of $\exists \forall \exists$ formulae.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.