Embeddability of ptykes
From MaRDI portal
Recommendations
- 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
- scientific article; zbMATH DE number 1086721
- Ptykes in Gödels T und Definierbarkeit von Ordinalzahlen. (Ptykes in Gödel's T and definability of ordinal numbers)
- Positive inductive-recursive definitions
Cites work
- 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
Cited in
(6)
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)