English
Related papers

Related papers: Universal theories and compactly expandable models

200 papers

We sketch recent interactions between model theory and a roughly 150-year old study of analytic functions involving complex analysis, algebraic topology, and number theory, centered in canonicity of universal covers. Towards this goal we…

Logic · Mathematics 2024-07-24 John T. Baldwin , Andrés Villaveces

We study the topological $\mu$-calculus, based on both Cantor derivative and closure modalities, proving completeness, decidability and FMP over general topological spaces, as well as over $T_0$ and $T_D$ spaces. We also investigate…

Logic in Computer Science · Computer Science 2021-05-19 Alexandru Baltag , Nick Bezhanishvili , David Fernández-Duque

What is computable with limited resources? How can we verify the correctness of computations? How to measure computational power with precision? Despite the immense scientific and engineering progress in computing, we still have only…

Other Computer Science · Computer Science 2016-10-20 Attila Egri-Nagy

The general/finite PCTL satisfiability problem asks whether a given PCTL formula has a general/finite model. We show that the finite PCTL satisfiability problem is undecidable, and the general PCTL satisfiability problem is even highly…

Logic in Computer Science · Computer Science 2024-04-17 Miroslav Chodil , Antonín Kučera

Based on an analysis of the inference rules used, we provide a characterization of the situations in which classical provability entails intuitionistic provability. We then examine the relationship of these derivability notions to uniform…

Logic in Computer Science · Computer Science 2016-08-31 Gopalan Nadathur

We use Shelah's theory of possible cofinalities in order to solve a problem about ultrafilters. THEOREM. Suppose that $ \lambda $ is a singular cardinal, $ \lambda ' < \lambda $, and the ultrafilter $D$ is $ \kappa $-decomposable for all…

Logic · Mathematics 2009-04-05 Paolo Lipparini

We study compressible types in the context of (local and global) NIP. By extending a result in machine learning theory (the existence of a bound on the recursive teaching dimension), we prove density of compressible types. Using this, we…

Logic · Mathematics 2026-04-02 Martin Bays , Itay Kaplan , Pierre Simon

We prove two completeness results, one for the extension of dependence logic by a monotone generalized quantifier Q with weak interpretation, weak in the meaning that the interpretation of Q varies with the structures. The second result…

Logic · Mathematics 2013-04-03 Fredrik Engström , Juha Kontinen , Jouko Väänänen

We study the model theory of covers of groups definable in o-minimal structures. This includes the case of covers of compact real Lie groups. In particular we study categoricity questions, pointing out some notable differences with the case…

Logic · Mathematics 2010-09-28 Alessandro Berarducci , Ya'acov Peterzil , Anand Pillay

Unimodularity is localized to a complete stationary type, and its properties are analysed. Some variants of unimodularity for definable and type-definable sets are introduced, and the relationship between these different notions is studied.…

Logic · Mathematics 2016-10-06 Darío García , Frank Olaf Wagner

We discuss various universality aspects of numerical computations using standard algorithms. These aspects include empirical observations and rigorous results. We also make various speculations about computation in a broader sense.

Probability · Mathematics 2017-03-24 Percy Deift , Thomas Trogdon

We characterize ultrafilter convergence and ultrafilter compactness in linearly ordered and generalized ordered topological spaces. In such spaces, and for every ultrafilter $D$, the notions of $D$-compactness and of $D$-pseudocompactness…

General Topology · Mathematics 2016-08-30 Paolo Lipparini

We study knowable informational dependence between empirical questions, modeled as continuous functional dependence between variables in a topological setting. We also investigate epistemic independence in topological terms and show that it…

Logic · Mathematics 2024-01-17 Alexandru Baltag , Johan van Benthem

Effective bounds for the finite number of surjective holomorphic maps between canonically polarized compact complex manifolds of any dimension with fixed domain are proven. Both the case of a fixed target and the case of varying targets are…

Algebraic Geometry · Mathematics 2007-05-23 Gordon Heier

Many economic theory models incorporate finiteness assumptions that, while introduced for simplicity, play a real role in the analysis. We provide a principled framework for scaling results from such models by removing these finiteness…

Computer Science and Game Theory · Computer Science 2023-04-11 Yannai A. Gonczarowski , Scott Duke Kominers , Ran I. Shorrer

(1) There is a finitely presented group with a word problem which is a uniformly effectively inseparable equivalence relation. (2) There is a finitely generated group of computable permutations with a word problem which is a universal…

Logic · Mathematics 2016-09-13 André Nies , Andrea Sorbi

In this paper we look at normed spaces of differentiable functions on compact plane sets, including the spaces of infinitely differentiable functions originally considered by Dales and Davie. For many compact plane sets the classical…

Functional Analysis · Mathematics 2007-05-23 W. J. Bland , J. F. Feinstein

We prove that there exist rational but not uniformly rational smooth algebraic varieties. The proof is based on computing a certain numerical obstruction developed in the case of compactifications of affine spaces. We show that for some…

Algebraic Geometry · Mathematics 2019-11-07 Ilya Karzhemanov

A generalized topology in a set $X$ is a collection $\text{Cov}_X$ of families of subsets of $X$ such that the triple $(X,\bigcup \text{Cov}_X,\text{Cov}_X)$ is a generalized topological space in the sense of Delfs and Knebusch. In this…

General Topology · Mathematics 2020-09-09 Artur Piȩkosz , Eliza Wajch

We introduce infinite time computable model theory, the computable model theory arising with infinite time Turing machines, which provide infinitary notions of computability for structures built on the reals R. Much of the finite time…

Logic · Mathematics 2007-05-23 Joel David Hamkins , Russell Miller , Daniel Seabold , Steve Warner
‹ Prev 1 4 5 6 7 8 10 Next ›