Embeddability of ptykes
Dilators are categories whose objects are functors from the category ON to ON and whose morphisms are the natural transformations of such functors. Ptykes are generalizations of dilators. If a type structure is defined inductively containing the type 0 and with \(\sigma\) and \(\tau\) the type \(\sigma\rightarrow\tau\), then dilators are ptykes of type 0 and if \(\text{PTYX}_ \sigma\) and \(\text{PTYX}_ \tau\) are categories of type \(\sigma\) and \(\tau\), then the functors from \(\text{PTYX}_ \sigma\) to \(\text{PTYX}_ \tau\), commuting with pullbacks and direct limits, are the objects of the category \(\text{PTYX}_{\sigma\rightarrow\tau}\) and the natural transformations of these functors are the morphisms. The paper under review treats questions about embeddings of ptykes, which are the morphisms in the considered cases. It is concerned with conditions for the existence of such embeddings, the existence of, in a certain sense, least embeddings, and the possibility of embedding families of ptykes which are described by formulae of certain complexity, into a recursive ptyx. As tools the amalgamation of inductive systems of ptykes, the concept of weak morphism and the representation of ptykes \(A\) of type \(\tau\rightarrow 0\) by (generalized) trees \(T_ A\) are introduced and used. Amalgamations serve to establish the connection of definability and functoriality. The weak morphisms are used to construct the embeddings. Some results generalize results of \textit{A. S. Kechris} [Ann. Pure Appl. Logic 52, No. 1/2, 79-92 (1991; Zbl 0735.03020)] and \textit{A. S. Kechris} and \textit{W. H. Woodin} [ibid. 93-97 (1991; Zbl 0735.03019)]; some are also formulated and specialized for dilators. Finally, a question of Kechris [loc. cit.] is settled.
- Functoroids and ptykoids
- A proof-theoretical analysis of ptykes
- Inductive families
- Some properties of the syntactic p-recursion categories generated by consistent, recursively enumerable extensions of Peano arithmetic.
- Model Complete Generic Structures
- scientific article; zbMATH DE number 1499107
- Normalization and the Yoneda embedding
- Proof principles for datatypes with iterated recursion
- Ptykes in Gödels T und Definierbarkeit von Ordinalzahlen. (Ptykes in Gödel's T and definability of ordinal numbers)
- Positive inductive-recursive definitions
- A strong boundedness theorem for dilators
- Boundedness theorems for dilators and ptykes
- Ptykes in Gödels T und Definierbarkeit von Ordinalzahlen. (Ptykes in Gödel's T and definability of ordinal numbers)
- Rekursion über Dilatoren und die Bachmann-Hierarchie. (Recursion over dilators and the Bachmann hierarchy)
- Set recursion and \(\Pi ^ 1_ 2\)-logic
- Π12-logic, Part 1: Dilators
This page was built for publication: Embeddability of ptykes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4032649)
