English
Related papers

Related papers: Lofty Models of Peano Arithmetic

200 papers

Ali Enayat had asked whether there is a nonstandard model of Peano arithmetic (PA) that can be represented as $\langle\mathbb{Q},\oplus,\otimes\rangle$, where $\oplus$ and $\otimes$ are continuous functions on the rationals $\mathbb{Q}$. We…

Logic · Mathematics 2020-11-11 Ali Enayat , Joel David Hamkins , Bartosz Wcisło

A local system H on a complex manifold M can be viewed in two ways--either as a locally free sheaf, or as a union of covering spaces T = T(H). When M is an open set in a bigger manifold, the local system will generally not extend, because…

Algebraic Geometry · Mathematics 2007-10-16 Christian Schnell

We apply a modern axiomatic system of nonstandard analysis in metric fixed point theory. In particular, we formulate a nonstandard iteration scheme for nonexpansive mappings and present a nonstandard approach to fixed-point problems in…

Functional Analysis · Mathematics 2015-11-24 Andrzej Wiśnicki

A quadratic Lie algebra is a Lie algebra endowed with a symmetric, invariant and non degenerate bilinear form; such a bilinear form is called an invariant metric. The aim of this work is to describe the general structure of those central…

Rings and Algebras · Mathematics 2019-03-29 R. García-Delgado , G. Salgado , O. A. Sánchez-Valenzuela

We use fast-growing finite and infinite sequences of natural numbers and more complicated constructs to define models of hypercomputation and interpret non-arithmetic predicates, with the strongest extensions reaching full second order…

Logic · Mathematics 2017-07-19 Dmytro Taranovsky

We give a generalization of the geometric estimate used by Hart and the second author in their 2008 work on sums and products in finite fields. Their result concerned level sets of non-degenerate bilinear forms over finite fields, while in…

Number Theory · Mathematics 2021-12-03 Charlotte Aten , Alex Iosevich

Let No be Conway's class of surreal numbers. I will make explicit the notion of a function f on No recursively defined over some family of functions. Under some "tameness" and uniformity condition, f must satisfy some interesting…

Logic · Mathematics 2007-05-23 Antongiulio Fornasiero

Linear matrix Inequalities (LMIs) have had a major impact on control but formulating a problem as an LMI is an art. Recently there is the beginnings of a theory of which problems are in fact expressible as LMIs. For optimization purposes it…

Optimization and Control · Mathematics 2008-02-14 J. William Helton , Jiawang Nie

This paper focuses on greedy expansions, one possible representation of numbers, and on arithmetical operations with them. Performing addition or multiplication some additional digits can appear. We study bounds on the number of such digits…

Number Theory · Mathematics 2022-12-16 Magdaléna Tinková

We show that the values of entropies of multidimensional shifts of finite type (SFTs) are characterized by a certain computation-theoretic property: a real number $h\geq 0$ is the entropy of such an SFT if and only if it is right…

Dynamical Systems · Mathematics 2014-09-23 Michael Hochman , Tom Meyerovitch

In this paper we use finite vector spaces (finite dimension, over finite fields) as a non-standard computational model of linear logic. We first define a simple, finite PCF-like lambda-calculus with booleans, and then we discuss two finite…

Logic in Computer Science · Computer Science 2014-09-29 Benoît Valiron , Steve Zdancewic

We consider the non-deterministic extension of the call-by-value lambda calculus, which corresponds to the additive fragment of the linear-algebraic lambda-calculus. We define a fine-grained type system, capturing the right linearity…

Logic in Computer Science · Computer Science 2012-09-12 Alejandro Díaz-Caro , Barbara Petit

We give a simple construction of new, complete, finite volume manifolds $M$ of bounded, nonpositive curvature. These manifolds have ends that look like a mixture of locally symmetric ends of different ranks and their fundamental groups are…

Geometric Topology · Mathematics 2021-03-17 Grigori Avramidi , T. Tam Nguyen Phan

Learning of low-rank matrices is fundamental to many machine learning applications. A state-of-the-art algorithm is the rank-one matrix pursuit (R1MP). However, it can only be used in matrix completion problems with the square loss. In this…

Machine Learning · Computer Science 2016-07-28 Quanming Yao , James T. Kwok

We prove that if the multiplication group $Mult(L)$ of a connected $2$-dimensional topological loop is a Lie group, then $Mult(L)$ is an elementary filiform nilpotent Lie group of dimension at least $4$. Moreover, we describe loops having…

Group Theory · Mathematics 2015-07-02 Ágota Figula

For a field extension $L/K$ we consider maps that are quadratic over $L$ but whose polarisation is only bilinear over $K$. Our main result is that all such are automatically quadratic forms over $L$ in the usual sense if and only if $L/K$…

Commutative Algebra · Mathematics 2024-02-07 Fabian Hebestreit , Achim Krause , Maxime Ramzi

The bifactor model and its extensions are multidimensional latent variable models, under which each item measures up to one subdimension on top of the primary dimension(s). Despite their wide applications to educational and psychological…

Statistics Theory · Mathematics 2020-12-23 Guanhua Fang , Xin Xu , Jinxin Guo , Zhiliang Ying , Susu Zhang

Large language models (LLMs) demonstrate considerable potential in various natural language tasks but face significant challenges in mathematical reasoning, particularly in executing precise, multi-step logic. However, current evaluation…

Computation and Language · Computer Science 2025-05-22 Tiasa Singha Roy , Aditeya Baral , Ayush Rajesh Jhaveri , Yusuf Baig

Motivated by M-theory, we define a new type of non-associative algebra involving usual and cubic matrices at the same time. The resulting algebra can be regarded as a two-term truncated $L_\infty$ algebra giving rise to a fundamental…

High Energy Physics - Theory · Physics 2025-04-09 Ralph Blumenhagen , Antonia Paraskevopoulou , Thomas Raml

We study finitely generated models of countable theories, having at most countably many nonisomorphic finitely generated models. We intro- duce a notion of rank of finitely generated models and we prove, when T has at most countably many…

Logic · Mathematics 2008-04-21 Abderezak Ould Houcine