Spectra with only unary function symbols
The authors show that the spectra of first-order sentences over the vocabulary of one unary function symbol are precisely the eventually periodic sets (the spectrum of a sentence \(\varphi\) is the set of cardinalities of finite models of \(\varphi)\). Thus, the class of these spectra is closed under complements (the so-called spectrum problem asks whether the class of spectra of arbitrary first-order sentences is closed under complements). The proof uses the Ehrenfeucht-Fraïssé method and a number-theoretic argument. For the entire collection see [Zbl 0891.00021].
- First-order spectra with one binary predicate
- The Specker-Blatter theorem does not hold for quaternary relations
- One unary function says less than two in existential second order logic
- scientific article; zbMATH DE number 4019038 (Why is no real title available?)
- The ultra-weak Ash conjecture and some particular cases
- scientific article; zbMATH DE number 3926889 (Why is no real title available?)
- scientific article; zbMATH DE number 2079026 (Why is no real title available?)
- A note on first-order spectra with binary relations
- scientific article; zbMATH DE number 2113458 (Why is no real title available?)
- scientific article; zbMATH DE number 2121574 (Why is no real title available?)
- Spectra and satisfiability for logics with successor and a unary function
- Regular graphs and the spectra of two-variable logic with counting
- First-order spectra with one variable
This page was built for publication: Spectra with only unary function symbols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4218932)