English
Related papers

Related papers: Pseudo-countable models

200 papers

We work with the structure consisting of all computably enumerable (c.e.) sets ordered by set inclusion. The question we will partially address is which c.e.\ sets are autormorphic to low (or low$_2$ sets. Using work of Miller, we can see…

Logic · Mathematics 2015-12-29 Peter Cholak , Rachel Epstein

We give an almost entirely model-theoretic account of both Ramsey classes of finite structures and of generalized indiscernibles as studied in special cases in (for example) [7], [9]. We understand "theories of indiscernibles" to be special…

Logic · Mathematics 2012-10-30 Cameron Donnay Hill

Given a structure $M$ we introduce infinitary logic expansions, which generalise the Morleyisation. We show that these expansions are tame, in the sense that they preserve and reflect both the Embedding Ramsey Property (ERP) and the…

Logic · Mathematics 2023-06-29 Nadav Meir , Aris Papadopoulos

In this paper we prove three theorems about the theory of Borel sets in models of ZF without any form of the axiom of choice. We prove that if B is a G-delta-sigma set, then either B is countable or B contains a perfect subset. Second, we…

Logic · Mathematics 2008-06-13 Arnold W. Miller

For any first order theory T we construct a Boolean valued model M, in which precisely the T--provable formulas hold, and in which every (Boolean valued) subset which is invariant under all automorphisms of M is definable by a first order…

Logic · Mathematics 2016-09-07 Carsten Butz , Ieke Moerdijk

The Axiom of Choice (AC for short) is the most (in)famous axiom of the usual foundations of mathematics, ZFC set theory. The (non-)essential use of AC in mathematics has been well-studied and thoroughly classified. Now, fragments of…

Logic · Mathematics 2020-11-04 Dag Normann , Sam Sanders

We explore the properties of non-piecewise syndetic sets with positive upper density, which we call "discordant", in countably infinite amenable (semi)groups. Sets of this kind are involved in many questions of Ramsey theory and manifest…

Combinatorics · Mathematics 2022-04-12 Vitaly Bergelson , Jake Huryn , Rushil Raghavan

Quasiminimal structures play an important role in non-elementary categoricity. In this paper we explore possibilities of constructing quasiminimal models of a given first-order theory. We present several constructions with increasing…

Logic · Mathematics 2015-10-21 Levon Haykazyan

The mathematical model of orthodox quantum mechanics has been critically examined and some deficiencies have been summarized. The model based on the extended Hilbert space and free of these shortages has been proposed; parameters being…

Quantum Physics · Physics 2016-08-16 Miloš V. Lokajíček

Upper asymptotic density induces a pseudometric on the power set of the natural numbers, with respect to which $P(\mathbb{N})$ is complete. The collection $D$ of sets with asymptotic density is closed in this pseudometric, and closed…

General Topology · Mathematics 2024-10-10 Jonathan M. Keith

We prove that for an arbitrary subtree $T$ of $2^{<\omega}$ with each element extendable to a path, a given countable class $\mathcal{M}$ closed under disjoint union, and any set $A$, if none of the members of $\mathcal{M}$ strongly…

Logic · Mathematics 2016-02-12 Lu Liu

A reconstruction problem is formulated for Sperner systems, and infinite families of nonreconstructible Sperner systems are presented. This has an application to a reconstruction problem for functions of several arguments and identification…

Combinatorics · Mathematics 2016-11-22 Miguel Couceiro , Erkko Lehtonen , Karsten Schölzel

We develop an untyped framework for the multiverse of set theory. $\mathsf{ZF}$ is extended with semantically motivated axioms utilizing the new symbols $\mathsf{Uni}(\mathcal{U})$ and $\mathsf{Mod}(\mathcal{U, \sigma})$, expressing that…

Logic · Mathematics 2021-07-01 Paul K. Gorbow , Graham E. Leigh

We consider the canonical pseudodistributive law between various free limit completion pseudomonads and the free coproduct completion pseudomonad. When the class of limits includes pullbacks, we show that this consideration leads to notions…

Category Theory · Mathematics 2024-06-13 Fernando Lucatelli Nunes , Rui Prezado , Matthijs Vákár

Hindman's celebrated Finite Sums Theorem, and its high-dimensional version due to Milliken and Taylor, are extended from covers of countable sets to covers of arbitrary topological spaces with Menger's classic covering property. The methods…

General Topology · Mathematics 2017-11-09 Boaz Tsaban

This thesis presents an alternative to Cantor's theory of cardinality, insofar as that is understood as a theory of set size. The alternative is based on a general theory, ClassSize. ClassSize contains all sentences in the first order…

Logic · Mathematics 2007-05-23 Fred M. Katz

In this paper, we provide a general framework for counting geometric structures in pseudo-random graphs. As applications, our theorems recover and improve several results on the finite field analog of questions originally raised in the…

Combinatorics · Mathematics 2025-04-30 Thang Pham , Steven Senger , Michael Tait , Vu Thi Huong Thu

Minimal models of a Boolean formula play a pivotal role in various reasoning tasks. While previous research has primarily focused on qualitative analysis over minimal models; our study concentrates on the quantitative aspect, specifically…

Logic in Computer Science · Computer Science 2024-07-17 Mohimenul Kabir , Kuldeep S Meel

In this paper, among other things, we prove that any subset of $\overline{\mathbb{Q}}^m$ (closed under complex conjugation and which contains the origin) is the exceptional set of uncountable many transcendental entire functions over…

Number Theory · Mathematics 2024-11-20 Diego Alves , Jean Lelis , Diego Marques , Pavel Trojovský

Counterfactual explanations for machine learning models are used to find minimal interventions to the feature values such that the model changes the prediction to a different output or a target output. A valid counterfactual explanation…

Machine Learning · Computer Science 2023-03-23 Shravan Kumar Sajja , Sumanta Mukherjee , Satyam Dwivedi