English
Related papers

Related papers: Enayat Models of Peano Arithmetic

200 papers

It is known that, among all the monotone decompositions of a planar compact set K with Peano hyperspaces, there exists a unique one that is finer than all the others. We call it the "core decomposition" of K with Peano hyperspace. The…

Dynamical Systems · Mathematics 2018-03-28 Jun Luo , Yi Yang , Xiao-Ting Yao

Induction is typically formalized as a rule or axiom extension of the LK-calculus. While this extension of the sequent calculus is simple and elegant, proof transformation and analysis can be quite difficult. Theories with an induction…

Logic · Mathematics 2018-04-03 David M. Cerna , Anela Lolic

The Monniaux Problem in abstract interpretation asks, roughly speaking, whether the following question is decidable: given a program $P$, a safety (\emph{e.g.}, non-reachability) specification $\varphi$, and an abstract domain of invariants…

Logic in Computer Science · Computer Science 2020-11-19 Nathanaël Fijalkow , Engel Lefaucheux , Pierre Ohlmann , Joël Ouaknine , Amaury Pouly , James Worrell

For which (first-order complete, usually countable) $T$ do there exist non-isomorphic models of $T$ which become isomorphic after forcing with a forcing notion $\mathbb{P}$? Necessarily, $\mathbb{P}$ is non-trivial; i.e.~it adds some new…

Logic · Mathematics 2025-07-03 Saharon Shelah

We show that the set of augmentations of the Chekanov-Eliashberg algebra of a Legendrian link underlies the structure of a unital A-infinity category. This differs from the non-unital category constructed in [BC], but is related to it in…

Symplectic Geometry · Mathematics 2021-01-01 Lenhard Ng , Dan Rutherford , Vivek Shende , Steven Sivek , Eric Zaslow

We first prove that if $\mathcal{Z}$ is a dp-minimal expansion of $\left(\mathbb{Z},+,0,1\right)$ which is not interdefinable with $\left(\mathbb{Z},+,0,1,<\right)$, then every infinite subset of $\mathbb{Z}$ definable in $\mathcal{Z}$ is…

Logic · Mathematics 2024-02-20 Eran Alouf

We extend de Finetti's (1937) notion of exchangeability to finite and countable sequences of variables, when a subject's beliefs about them are modelled using coherent lower previsions rather than (linear) previsions. We prove…

Probability · Mathematics 2008-01-09 Gert de Cooman , Erik Quaeghebeur , Enrique Miranda

We study Fermat's Last Theorem and Catalan's conjecture in the context of weak arithmetics with exponentiation. We deal with expansions (B,e) of models of arithmetical theories (in the language L=(0,1,+,x,<)) by a binary (partial or total)…

Logic · Mathematics 2018-12-17 Petr Glivický , Vítězslav Kala

Using methods developed by Robinson, we find a complete theory suitable for a first order description of infintesimal neighborhoods. We use this to construct a specialisation having universal properties and to find a recursively enumerable…

Logic · Mathematics 2007-05-23 Tristram de Piro

We study expansions of the Weak Monadic Second Order theory of (N,<) by cardinality relations, which are predicates R(X1,...,Xn) whose truth value depends only on the cardinality of the sets X1, ...,Xn. We first provide a (definable)…

Logic in Computer Science · Computer Science 2015-07-01 Alexis Bès

We develop the Scott model of the programming language PCF in univalent type theory. Moreover, we work constructively and predicatively. To account for the non-termination in PCF, we use the lifting monad (also known as the partial map…

Logic · Mathematics 2021-06-24 Tom de Jong

We review and analyse techniques from the literature for extending a normed algebra, A to a normed algebra, B, so that B has interesting or desirable properties which A may lack. For example, B might include roots of monic polynomials over…

Functional Analysis · Mathematics 2007-05-23 Thomas William Dawson

We consider expansions of Presburger arithmetic with families of monadic polynomial predicates. (Examples of such predicates are the set of perfect squares, or the set of integers of the form $2n^3-5n+3$, etc.) Although the full attendant…

Logic in Computer Science · Computer Science 2026-05-19 Piotr Bacik , Joris Nieuwveld , Joël Ouaknine , Mihir Vahanwala , Madhavan Venkatesh , Emil Rugaard Wieser

It is shown that for every $k\in\mathbb{N}$ and every spreading sequence $\{e_n\}_{n\in\mathbb{N}}$ that generates a uniformly convex Banach space $E$, there exists a uniformly convex Banach space $X_{k+1}$ admitting…

Functional Analysis · Mathematics 2016-03-09 Spiros A. Argyros , Pavlos Motakis

We introduce the notions of definable amenability and extreme definable amenability for groups in continuous structures and conduct an extensive analysis of them, drawing parallels with the classical first-order case. We characterize both…

Logic · Mathematics 2025-04-03 Juan Felipe Carmona , Alf Onshuus

We prove existence and uniqueness of absolutely continuous invariant measures for generalizations of Viana maps admitting a higher order critical point introduced in arXiv:2312.00906. As a consequence of our approach, we obtain…

Dynamical Systems · Mathematics 2025-02-19 Ricardo Chicalé , Vanderlei Horita

Let $\mathcal{T}$ be any of the three canonical truth theories $\textsf{CT}^-$ (Compositional truth without extra induction), $\textsf{FS}^-$ (Friedman--Sheard truth without extra induction), and $\textsf{KF}^-$ (Kripke--Feferman truth…

Logic · Mathematics 2020-04-22 Ali Enayat , Mateusz Łełyk , Bartosz Wcisło

This paper is a mathematical investigation on Epstein semantics. One of the main tools of the present paper is the model-theoretic S-set construction introduced in (Krawczyk 2022). We use it to prove several results: 1) that each Epstein…

Logic · Mathematics 2025-06-09 Krzysztof A. Krawczyk

We prove that a countable dimensional associative algebra (resp. a countable semigroup) of locally subexponential growth is $M_\infty$-embeddable as a left ideal in a finitely generated algebra (resp. semigroup) of subexponential growth.…

Rings and Algebras · Mathematics 2017-03-28 Adel Alahmadi , Hamed Alsulami , S. K. Jain , Efim Zelmanov

It is well-known that Abstract State Machines (ASMs) can simulate "step-by-step" any type of machines (Turing machines, RAMs, etc.). We aim to overcome two facts: 1) simulation is not identification, 2) the ASMs simulating machines of some…

Formal Languages and Automata Theory · Computer Science 2010-03-26 Serge Grigorieff , Pierre Valarcher