English
Related papers

Related papers: Pointwise Definable Models of Set Theory

200 papers

We show pro-definability of spaces of definable types in various classical complete first order theories, including complete o-minimal theories, Presburger arithmetic, $p$-adically closed fields, real closed and algebraically closed valued…

Logic · Mathematics 2022-08-09 Pablo Cubides Kovacsics , Jinhe Ye

In a series of papers, M.Talagrand, the second author and others investigated at length the properties and structure of pointwise compact sets of measurable functions. A number of problems, interesting in themselves and important for the…

Logic · Mathematics 2016-09-06 David H. Fremlin , Saharon Shelah

In this paper, we deal with the notions of naturality from category theory and definablity from model theory and their interactions. In this regard, we present three results. First, we show, under some mild conditions, that naturality…

Logic · Mathematics 2025-10-02 Mohsen Asgharzadeh , Mohammad Golshani , Saharon Shelah

Definability is a key notion in the theory of Grothendieck fibrations that characterises when an external property of objects can be accessed from within the internal logic of the base of a fibration. In this paper we consider a…

Logic · Mathematics 2022-06-29 Andrew W. Swan

Descriptive set theory is mainly concerned with studying subsets of the space of all countable binary sequences. In this paper we study the generalization where countable is replaced by uncountable. We explore properties of generalized…

Logic · Mathematics 2025-11-25 Sy-David Friedman , Tapani Hyttinen , Vadim Kulikov

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

Soft set theory provides a direct framework for parameterized decision modeling by assigning to each attribute (parameter) a subset of a given universe, thereby representing uncertainty in a structured way [1, 2]. Over the past decades, the…

Artificial Intelligence · Computer Science 2026-03-17 Takaaki Fujita , Florentin Smarandache

Let $K$ be a field. The \'etale open topology on the $K$-points $V(K)$ of a $K$-variety $V$ was introduced in our previous work. The \'etale open topology is non-discrete if and only if $K$ is large. If $K$ is separably, real, $p$-adically…

Logic · Mathematics 2022-11-22 Erik Walsberg , Jinhe Ye

We give characterizations for the (in ZFC unprovable) sentences ``Every $\Sb{1}{2}$--set is measurable" and ``Every $\Db{1}{2}$--set is measurable" for various notions of measurability derived from well--known forcing partial orderings.

Logic · Mathematics 2016-09-07 Jörg Brendle , Benedikt Loewe

We define the continuous modeling property for first-order structures and show that a first-order structure has the continuous modelling property if and only if its age has the embedding Ramsey property. We use generalized indiscernible…

Logic · Mathematics 2024-05-31 Adrián Portillo Fernández

The motivation for this paper is to extend the known model theoretic treatment of differential Galois theory to the case of linear difference equations (where the derivative is replaced by an automorphism.) The model theoretic difficulties…

Logic · Mathematics 2009-03-15 Moshe Kamensky

We reformulate Hrushovski's definability patterns from the setting of first order logic to the setting of positive logic. Given an h-universal theory T we put two structures on the type spaces of models of T in two languages, \mathcal{L}…

Logic · Mathematics 2022-07-28 Ori Segel

Recently, symbolic structures were proposed as finite representations of potentially infinite first-order structures, where Linear Integer Arithmetic terms and formulas define the domain and interpretations of a structure. We generalize…

Logic in Computer Science · Computer Science 2026-05-14 Neta Elad , Sharon Shoham

In this expository paper aimed at a general mathematical audience, we discuss how to combine certain classic theorems of set-theoretic inner model theory and effective descriptive set theory with work on Hilbert's tenth problem and…

Logic · Mathematics 2025-08-07 James E. Hanson

We study the implications of model completeness of a theory for the effectiveness of presentations of models of that theory. It is immediate that for a computable model $\mathcal A$ of a computably enumerable, model complete theory, the…

Logic · Mathematics 2019-03-05 Jennifer Chubb , Russell Miller , Reed Solomon

We construct a fully faithful functor from the category of graphs to the category of fields. Using this functor, we resolve a longstanding open problem in computable model theory, by showing that for every nontrivial countable structure S,…

Logic · Mathematics 2015-10-27 Russell Miller , Bjorn Poonen , Hans Schoutens , Alexandra Shlapentokh

We examine what happens if we replace ZFC with a localistic/relativistic system, LZFC, whose central new axiom, denoted by $Loc({\rm ZFC})$, says that every set belongs to a transitive model of ZFC. LZFC consists of $Loc({\rm ZFC})$ plus…

Logic · Mathematics 2023-03-28 Athanassios Tzouvaras

We consider the question of when sets definable in first-order expansions of groups contain the product of two infinite sets (we refer to this as the "productset property"). We first show that the productset property holds for any definable…

Logic · Mathematics 2023-11-03 Uri Andrews , Gabriel Conant , Isaac Goldbring

We propose a new constructive model of the real continuum based on the notion of fractal definability. Rather than assuming the continuum as a completed uncountable totality, we view it as the cumulative result of a vast space of stratified…

General Mathematics · Mathematics 2025-05-28 Stanislav Semenov

We propose FC, a new logic on words that combines finite model theory with the theory of concatenation - a first-order logic that is based on word equations. Like the theory of concatenation, FC is built around word equations; in contrast…

Logic in Computer Science · Computer Science 2021-05-14 Dominik D. Freydenberger , Liat Peterfreund
‹ Prev 1 3 4 5 6 7 10 Next ›