English
Related papers

Related papers: Lofty Models of Peano Arithmetic

200 papers

Fix a countable nonstandard model $\mathcal M$ of Peano Arithmetic. Even with some rather severe restrictions placed on the types of minimal cofinal extensions $\mathcal N \succ \mathcal M$ that are allowed, we still find that there are…

Logic · Mathematics 2021-09-17 James H. Schmerl

This is a survey of results on definability and undefinability in models of arithmetic. The goal is to present a stark difference between undefinability results in the standard model and much stronger versions about expansions of…

Logic · Mathematics 2023-04-17 Roman Kossak

Wilke proved in 1977 that every countable model ${\mathcal M}$ of Peano Arithmetic has an elementary end extension ${\mathcal N}$ such that the interstructure lattice Lt(${\mathcal N} / {\mathcal M}$) is the pentagon lattice ${\mathbf…

Logic · Mathematics 2025-09-17 James H. Schmerl

Linear arithmetics are extensions of Presburger arithmetic (Pr) by one or more unary functions, each intended as multiplication by a fixed element (scalar), and containing the full induction schemes for their respective languages. In this…

Logic · Mathematics 2017-01-10 Petr Glivický , Pavel Pudlák

Let M be a model of Peano Arithmetic that is countably generated over an exponentially closed cut I. We characterize those sets X of subsets of I for which there is a finitely (or countably) generated cofinal extension N of M such that I is…

Logic · Mathematics 2017-08-04 James H. Schmerl

We investigate the theory PAI (Peano Arithmetic with Indiscernibles). Models of PAI are of the form (M, I), where M is a model of PA, I is an unbounded set of order indiscernibles over M, and (M, I) satisfies the extended induction scheme…

Logic · Mathematics 2022-12-19 Ali Enayat

By affine arithmetic is meant the set of affine consequences of Peano arithmetic. This is a continuous theory which is studied in the framework of affine logic, a sublogic of continuous logic. Affine arithmetic is undecidable. Also, its…

Logic · Mathematics 2025-11-19 Seyed-Mohammad Bagheri

Throughout the course of mathematical history, generalizations of previously understood concepts and structures have led to the fruitful development of the hierarchy of number systems, non-euclidean geometry, and many other epochal phases…

Logic · Mathematics 2013-11-26 Samuel Reid

We prove in ZFC the existence of a definable, countably saturated elementary extension of the reals. It seems that it has been taken for granted that there is no distinguished, definable nonstandard model of the reals. (This means a…

Logic · Mathematics 2018-08-16 Vladimir Kanovei , Saharon Shelah

A real arithmetic function f is multiplicatively monotonous if f (mn) -- f (m) has constant sign for m, n positive integers. Properties and examples of such functions are discussed, with applications to positive hermitian…

Number Theory · Mathematics 2018-09-25 Michel Balazard

We deal with models of Peano arithmetic (specifically with a question of Ali Enayat). The methods are from creature forcing. We find an expansion of N such that its theory has models with no (elementary) end extensions. In fact there is a…

Logic · Mathematics 2010-06-08 Saharon Shelah

In 1975 Barwise and Schlipf published a landmark paper whose main theorem asserts that a nonstandard model $\mathcal{M}$ of PA (Peano arithmetic) is recursively saturated iff $\mathcal{M}$ has an expansion that satisfies the subsystem…

Logic · Mathematics 2020-06-09 Ali Enayat , James H. Schmerl

It is well-known that the first order Peano axioms PA have a continuum of non-isomorphic countable models. The question, how close to being isomorphic such countable models can be, seems to be less investigated. A measure of closeness to…

Logic · Mathematics 2022-08-30 Tapani Hyttinen , Jouko Väänänen

We calculate the possible Scott ranks of countable models of Peano arithmetic. We show that no non-standard model can have Scott rank less than $\omega$ and that non-standard models of true arithmetic must have Scott rank greater than…

Logic · Mathematics 2022-08-04 Antonio Montalbán , Dino Rossegger

A countable structure is said to be extendible if it has the same Scott sentence as some uncountable structure. Rigid structures are not extendible. We give an example of an extendible model with a rigid elementary extension.

Logic · Mathematics 2017-11-29 Paul B. Larson , Saharon Shelah

A semi-Peano algebra is an algebra for which each operation is injective, and the images of the operations are pairwise disjoint. The most straightforward non-trivial kind of finitely presented semi-Peano algebra are algebras with a single…

Rings and Algebras · Mathematics 2023-06-23 Carles Cardó

Inspired by a mathematical riddle involving fuses, we define the "fusible numbers" as follows: $0$ is fusible, and whenever $x,y$ are fusible with $|y-x|<1$, the number $(x+y+1)/2$ is also fusible. We prove that the set of fusible numbers,…

Logic in Computer Science · Computer Science 2023-06-22 Jeff Erickson , Gabriel Nivasch , Junyan Xu

According to the math tea argument, there must be real numbers that we cannot describe or define, because there are uncountably many real numbers, but only countably many definitions. And yet, the existence of pointwise-definable models of…

Logic · Mathematics 2024-04-09 Joel David Hamkins

The problem is considered as to whether a monotone function defined on a subset P of a Euclidean space can be strictly monotonically extended to the whole space. It is proved that this is the case if and only if the function is {\em…

Optimization and Control · Mathematics 2022-10-21 Pavel Chebotarev

Let $A$ be a tubular algebra and let $r$ be a positive irrational. Let ${\mathcal D}_r$ be the definable subcategory of $A$-modules of slope $r$. Then the width of the lattice of pp formulas for ${\mathcal D}_r$ is $\infty$. It follows that…

Representation Theory · Mathematics 2015-06-12 Richard Harland , Mike Prest
‹ Prev 1 2 3 10 Next ›