scientific article; zbMATH DE number 3534482

MaRDI QIDQ4110995zbMATH OpenFDO

Authors Jon Barwise, John S. Schlipf

Publication date 1975

Mathematics Subject Classification ID

Model-theoretic algebra (03C60) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Consistency and independence results (03E35) Nonstandard models (03H99)

Cited in

(19)

• Definable sets and expansions of models of Peano arithmetic
• On expandability of models of Peano arithmetic. I
• On expandability of models of Peano arithmetic. II
• On the consistency of the \(\Delta_1^1\)-CA fragment of Frege's Grundgesetze
• Saturated models of universal theories
• Automorphisms of countable recursively saturated models of PA: A survey
• Set theoretical analogues of the Barwise-Schlipf theorem
• Characterizations of ordinal analysis
• Term extraction and Ramsey's theorem for pairs
• On Relating Theories: Proof-Theoretical Reduction
• Recursively Saturated Models of Set Theory
• A Generalized Kleene-Moschovakis Theorem
• A Rather Classless Model
• Comparing Peano arithmetic, Basic Law V, and Hume's Principle
• Having a Look Again at Some Theories ofProof-Theoretic Strengths around $$ \varGamma_{0} $$
• The Barwise-Schlipf theorem
• Self-embeddings of models of arithmetic; fixed points, small submodels, and extendability
• Saturation and simple extensions of models of Peano arithmetic
• Automorphisms of models of arithmetic: a unified view

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4110995)