Embeddability of ptykes

DOI10.2307/2275298zbMATH Open0777.03015OpenAlexW2050662284MaRDI QIDQ4032649FDOQ4032649

Authors: Jean-Yves Girard, Dag Normann 

Publication date: 1 April 1993

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2275298

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

zbMATH Keywords

functorialitydefinabilityweak morphismdilatorsamalgamation of inductive systems of ptykesembeddings of ptykes

Mathematics Subject Classification ID

Recursive ordinals and ordinal notations (03F15)

Cites Work

• Π12-logic, Part 1: Dilators
• Ptykes in Gödels T und Definierbarkeit von Ordinalzahlen. (Ptykes in Gödel's T and definability of ordinal numbers)
• A strong boundedness theorem for dilators
• Boundedness theorems for dilators and ptykes
• Set recursion and \(\Pi ^ 1_ 2\)-logic
• Rekursion über Dilatoren und die Bachmann-Hierarchie. (Recursion over dilators and the Bachmann hierarchy)

Cited In (5)

• Boundedness theorems for flowers and sharps
• WELL ORDERING PRINCIPLES AND -STATEMENTS: A PILOT STUDY
• A strong boundedness theorem for dilators
• Title not available (Why is that?)
• Functoroids and ptykoids

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)