Infinite substructure lattices of models of Peano Arithmetic

Journal of Symbolic Logic 75 (4):1366-1382 (2010)
  Copy   BIBTEX

Abstract

Bounded lattices (that is lattices that are both lower bounded and upper bounded) form a large class of lattices that include all distributive lattices, many nondistributive finite lattices such as the pentagon lattice N₅, and all lattices in any variety generated by a finite bounded lattice. Extending a theorem of Paris for distributive lattices, we prove that if L is an ℵ₀-algebraic bounded lattice, then every countable nonstandard model ������ of Peano Arithmetic has a cofinal elementary extension ������ such that the interstructure lattice Lt(������ / ������) is isomorphic to L

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,297

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2010-09-12

Downloads
32 (#710,849)

6 months
9 (#500,261)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Arithmetically Saturated Models of Arithmetic.Roman Kossak & James H. Schmerl - 1995 - Notre Dame Journal of Formal Logic 36 (4):531-546.
Four Problems Concerning Recursively Saturated Models of Arithmetic.Roman Kossak - 1995 - Notre Dame Journal of Formal Logic 36 (4):519-530.

Add more citations

References found in this work

Substructure lattices of models of arithmetic.George Mills - 1979 - Annals of Mathematical Logic 16 (2):145.

Add more references