{"title":"费弗曼-沃特定理的变式,以及在(\\prod _p \\mathbb {F}_p\\ )中的应用","authors":"Alice Medvedev, Alexander Van Abel","doi":"10.1007/s00153-024-00954-1","DOIUrl":null,"url":null,"abstract":"<div><p>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 that for families of structures with certain properties, including families of integral domains, the pure Boolean generalized product is definable in the direct product structure. We use these results to obtain characterizations of the definable subsets of <span>\\(\\prod _p \\mathbb {F}_p\\)</span>—in particular, every formula is equivalent to a Boolean combination of <span>\\(\\exists \\forall \\exists \\)</span> formulae.</p></div>","PeriodicalId":48853,"journal":{"name":"Archive for Mathematical Logic","volume":"64 3-4","pages":"529 - 546"},"PeriodicalIF":0.3000,"publicationDate":"2024-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Variations on the Feferman-Vaught theorem, with applications to \\\\(\\\\prod _p \\\\mathbb {F}_p\\\\)\",\"authors\":\"Alice Medvedev, Alexander Van Abel\",\"doi\":\"10.1007/s00153-024-00954-1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>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 that for families of structures with certain properties, including families of integral domains, the pure Boolean generalized product is definable in the direct product structure. We use these results to obtain characterizations of the definable subsets of <span>\\\\(\\\\prod _p \\\\mathbb {F}_p\\\\)</span>—in particular, every formula is equivalent to a Boolean combination of <span>\\\\(\\\\exists \\\\forall \\\\exists \\\\)</span> formulae.</p></div>\",\"PeriodicalId\":48853,\"journal\":{\"name\":\"Archive for Mathematical Logic\",\"volume\":\"64 3-4\",\"pages\":\"529 - 546\"},\"PeriodicalIF\":0.3000,\"publicationDate\":\"2024-12-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Archive for Mathematical Logic\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s00153-024-00954-1\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"Arts and Humanities\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Archive for Mathematical Logic","FirstCategoryId":"100","ListUrlMain":"https://link.springer.com/article/10.1007/s00153-024-00954-1","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"Arts and Humanities","Score":null,"Total":0}
Variations on the Feferman-Vaught theorem, with applications to \(\prod _p \mathbb {F}_p\)
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 that for families of structures with certain properties, including families of integral domains, the pure Boolean generalized product is definable in the direct product structure. 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.
期刊介绍:
The journal publishes research papers and occasionally surveys or expositions on mathematical logic. Contributions are also welcomed from other related areas, such as theoretical computer science or philosophy, as long as the methods of mathematical logic play a significant role. The journal therefore addresses logicians and mathematicians, computer scientists, and philosophers who are interested in the applications of mathematical logic in their own field, as well as its interactions with other areas of research.