On embedding models of arithmetic of cardinality \aleph1into reduced powers

DOI10.4064/FM176-1-2zbMATH Open1017.03017arXivmath/0105134OpenAlexW2094095036MaRDI QIDQ4790201FDOQ4790201

Authors: Juliette Kennedy, S. Shelah 

Publication date: 28 January 2003

Published in: Fundamenta Mathematicae (Search for Journal in Brave)

Abstract: In the early 1970's S.Tennenbaum proved that all countable models of PA^- + forall_1-Th(N) are embeddable into the reduced product N^omega/F, where F is the cofinite filter. In this paper we show that if M is a model of PA^- + forall_1-Th(N), and |M|= aleph_1, then M is embeddable into N^omega/D, where D is any regular filter on omega.

Full work available at URL: https://arxiv.org/abs/math/0105134

Recommendations

• scientific article; zbMATH DE number 2208069
• Relatively diophantine correct models of arithmetic
• Every countable model of set theory embeds into its own constructible universe
• Tennenbaum's theorem and recursive reducts
• Fixed points of self-embeddings of models of arithmetic

zbMATH Keywords

reduced powerfragment of arithmeticDiophantine correct model

Mathematics Subject Classification ID

Models with special properties (saturated, rigid, etc.) (03C50) Ultraproducts and related constructions (03C20) Models of arithmetic and set theory (03C62)

Cited In (7)

• Relatively diophantine correct models of arithmetic
• On the number of strongly \(\aleph _{\epsilon}\)-saturated models of power \(\lambda\)
• On ℵ₁ many minimal models
• Algebraic combinatorics in bounded induction
• Title not available (Why is that?)
• Construction of models of bounded arithmetic by restricted reduced powers
• Every countable model of set theory embeds into its own constructible universe

This page was built for publication: On embedding models of arithmetic of cardinality \aleph₁into reduced powers

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