We develop methods for coding with first-order formulas into the partial order E of enumerable sets under inclusion. First we use them to reprove and generalize the (unpublished) result of the first author that the elementary theory of E has the same computational complexity as the theory of the nat
ω-operations over partial enumerated sets
✍ Scribed by Andrzej Orlicki
- Publisher
- John Wiley and Sons
- Year
- 1993
- Tongue
- English
- Weight
- 445 KB
- Volume
- 39
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
In the present paper we concentrate on fundamental problems concerning ω‐operations over partial enumerated sets. The notion of “HOM‐lifts” seems to be an adequate tool for this kind of investigations. MSC: 03D45, 18A30.
📜 SIMILAR VOLUMES
In this paper we consider squarefree polynomials over finite fields whose gcd with their reciprocal and Frobenius conjugate polynomial is trivial, respectively. Our focus is on the enumeration of these special sets of polynomials, in particular, we give the number of squarefree palindromes. These in
## Abstract We prove the following inclusion where __WF__~\*~ denotes the non‐quasianalytic Beurling or Roumieu wave front set, Ω is an open subset of \documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}$\mathbb {R}^n$\end{document}, __P__ is a linear partial differential o