English
Related papers

Related papers: The Kaufmann--Clote question on end extensions of …

200 papers

Let $\mathsf{KP}$ denote Kripke-Platek Set Theory and let $\mathsf{M}$ be the weak set theory obtained from $\mathsf{ZF}$ by removing the collection scheme, restricting separation to $\Delta_0$-formulae and adding an axiom asserting that…

Logic · Mathematics 2025-08-28 Zachiri McKenzie

Let $\mathsf{M}$ be the set theory obtained from $\mathsf{ZF}$ by removing the collection scheme, restricting separation to $\Delta_0$-formulae and adding an axiom asserting that every set is contained in a transitive set. Let…

Logic · Mathematics 2025-07-18 Zachiri McKenzie

Given a first-order theory $T$ formulated in the usual language of first-order arithmetic, we say that $T$ is of *restricted complexity* if there is some natural number $n$ and some set $\mathcal A$ of $\Sigma_n$-sentences such that $T$ can…

Logic · Mathematics 2025-10-01 Ali Enayat , Mateusz Łełyk , Albert Visser

A result of Kaufmann shows that if $L_\alpha$ is countable, admissible and satisfies $\Pi_n\textsf{-Collection}$, then $\langle L_\alpha, \in \rangle$ has a proper $\Sigma_{n+1}$-elementary end extension. This paper investigates to what…

Logic · Mathematics 2022-01-14 Zachiri McKenzie

We prove that if the linear-time and polynomial-time hierarchies coincide, then every model of $\Pi_1(\mathbb{N}) + \neg \Omega_1$ has a proper end-extension to a model of $\Pi_1(\mathbb{N})$, and so $\Pi_1(\mathbb{N}) + \neg \Omega_1…

Logic · Mathematics 2014-11-26 Leszek Aleksander Kołodziejczyk

Keisler proved that if $\theta$ is a strong limit cardinal and $\lambda$ is a singular cardinal, then the transfer relation $\theta\longrightarrow\lambda$ holds. In a previous paper, we studied initial elementary submodels of the…

Logic · Mathematics 2015-09-22 Shahram Mohsenipour

Every mathematical structure has an elementary extension to a pseudo-countable structure, one that is seen as countable inside a suitable class model of set theory, even though it may actually be uncountable. This observation, proved easily…

Logic · Mathematics 2022-10-11 Joel David Hamkins

The formulation of the non-linear sigma model in terms of flat connection allows the construction of a perturbative solution of a local functional equation encoding the underlying gauge symmetry. In this paper we discuss some properties of…

High Energy Physics - Theory · Physics 2009-11-11 Ruggero Ferrari , Andrea Quadri

We show that an arithmetic function which satisfies some weak multiplicativity properties and in addition has a non-decreasing or $\log$-uniformly continuous normal order is close to a function of the form $n\mapsto n^c$. As an application…

Number Theory · Mathematics 2019-12-03 Jan-Christoph Schlage-Puchta

In this paper (propositional) probability logic ($PL$) is investigated from model theoretic point of view. First of all, the ultraproduct construction is adapted for $\sigma$-additive probability models, and subsequently when this class of…

Logic · Mathematics 2018-10-18 Massoud Pourmahdian , Reihane Zoghifard

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

In this paper we study the modulus of continuity of weak solutions to a singular elliptic equation in the plane under very weak assumption on the integrability of the elliptic coefficients. Our investigation reveals that the modulus of…

Analysis of PDEs · Mathematics 2023-10-30 Xiangsheng Xu

We extend some of our earlier results on the interconnection between ultrafilter extensions, and ultrapowers. Throughout we restrict ourselves to relational structures with one binary relation. Recently it was shown that for bounded…

Logic · Mathematics 2025-02-25 Zalán Molnár

In this paper, we show how a construction of an implicit complexity model can be implemented using concepts coming from the core of von Neumann algebras. Namely, our aim is to gain an understanding of classical computation in terms of the…

Computational Complexity · Computer Science 2009-12-31 Marco Pedicini , Mario Piazza

In this article we deal with different forms of the unique continuation property for second order elliptic equations with nonlinear potentials of sublinear growth. Under suitable regularity assumptions, we prove the weak and the strong…

Analysis of PDEs · Mathematics 2018-01-18 Angkana Rüland

Szemeredi's regularity lemma can be viewed as a rough structure theorem for arbitrary dense graphs, decomposing such graphs into a structured piece (a partition into cells with edge densities), a small error (corresponding to irregular…

Combinatorics · Mathematics 2020-11-26 Ben Green , Terence Tao

I shall describe a general model-theoretic task to construct expansions of pseudofinite structures and discuss several examples of particular relevance to computational complexity. Then I will present one specific situation where finding a…

Logic · Mathematics 2017-02-10 Jan Krajicek

Motivated by problems involving end extensions of models of set theory, we develop the rudiments of the power admissible cover construction (over ill-founded models of set theory), an extension of the machinery of admissible covers invented…

Logic · Mathematics 2022-03-28 Zachiri McKenzie , Ali Enayat

In this paper we will show that for every cut $ I $ of any countable nonstandard model $ \mathcal{M} $ of $ \mathrm{I}\Sigma_{1} $, each $ I $-small $ \Sigma_{1} $-elementary submodel of $ \mathcal{M}$ is of the form of the set of fixed…

Logic · Mathematics 2024-11-20 Saeideh Bahrami

A $\Sigma^*$-algebra is a concrete $C^*$-algebra that is sequentially closed in the weak operator topology. We study an appropriate class of $C^*$-modules over $\Sigma^*$-algebras analogous to the class of $W^*$-modules (selfdual…

Operator Algebras · Mathematics 2016-09-13 Clifford A. Bearden
‹ Prev 1 2 3 10 Next ›