English
Related papers

Related papers: Finiteness classes arising from Ramsey-theoretic s…

200 papers

One way of studying a relational structure is to investigate functions which are related to that structure and which leave certain aspects of the structure invariant. Examples are the automorphism group, the self-embedding monoid, the…

Logic · Mathematics 2011-05-31 Manuel Bodirsky , Michael Pinsker

In the course of classifying the homogeneous permutations, Cameron introduced the viewpoint of permutations as structures in a language of two linear orders, and this structural viewpoint is taken up here. The majority of this thesis is…

Logic · Mathematics 2018-05-14 Samuel Braunfeld

We show that the problem `whether a finite set of regular-linear axioms defines a rigid theory' is undecidable.

Logic · Mathematics 2019-02-20 Mikołaj Bojanczyk , Stanisław Szawiel , Marek Zawadowski

We present a new fragment of axiomatic set theory for pure sets and for the iteration of power sets within given transitive sets. It turns out that this formal system admits an interesting hierarchy of models with true membership relation…

Logic · Mathematics 2026-02-27 Matthias Kunik

In the classical literature on infinite series there are various tests to determine if a given infinite series converges, diverges, or oscillates. But unfortunately, for very many infinite series all the existing tests can fail to provide…

Statistics Theory · Mathematics 2018-04-13 Sucharita Roy , Sourabh Bhattacharya

By operations on models we show how to relate completeness with respect to permissive-nominal models to completeness with respect to nominal models with finite support. Models with finite support are a special case of permissive-nominal…

Logic in Computer Science · Computer Science 2013-05-28 Murdoch J. Gabbay

It has become obvious in the recent development that the structural Ramsey property is a categorical property: it depends not only on the choice of objects, but also on the choice of morphisms involved. In this paper we explicitely put the…

Category Theory · Mathematics 2015-11-25 Dragan Masulovic , Lynn Scow

It is well known that in Zermelo-Fraenkel (ZF) set theory any finite set is decidable. In this paper we discuss an extension of ZF where this result is no longer valid. Such an extension is quasi-set theory and it has its origin on problems…

Quantum Physics · Physics 2007-05-23 Adonai S. Sant'Anna

We study a well-known technique of using absoluteness for giving choice-free proofs to some statements which are known to be provable with the axiom of choice. The idea is to reduce the problem to an inner model where the axiom of choice…

Logic · Mathematics 2014-02-20 Asaf Karagila

A finite set $X$ in some Euclidean space $R^n$ is called Ramsey if for any $k$ there is a $d$ such that whenever $R^d$ is $k$-coloured it contains a monochromatic set congruent to $X$. This notion was introduced by Erdos, Graham,…

Combinatorics · Mathematics 2010-12-08 Imre Leader , Paul A. Russell , Mark Walters

We give a definition of a class of Dedekind domains which includes the rings of integers of global fields and give a proof that all rings in this class have finite ideal class group. We also prove that this class coincides with the class of…

Commutative Algebra · Mathematics 2020-06-29 Alexander Stasinski

We study the reverse mathematics of the principle stating that, for every property of finite character, every set has a maximal subset satisfying the property. In the context of set theory, this variant of Tukey's lemma is equivalent to the…

Logic · Mathematics 2012-01-25 Damir D. Dzhafarov , Carl Mummert

We prove the existence of infinite dense free sets (in the usual topology) for set mappings on the reals, under reasonable assumptions.

Logic · Mathematics 2016-11-15 Shimon Garti

Axiomatizing mathematical structures and theories is an objective of Mathematical Logic. Some axiomatic systems are nowadays mere definitions, such as the axioms of Group Theory; but some systems are much deeper, such as the axioms of…

Logic · Mathematics 2023-05-18 Saeed Salehi

We look at spaces of infinite-by-infinite matrices, and consider closed subsets that are stable under simultaneous row and column operations. We prove that up to symmetry, any of these closed subsets is defined by finitely many equations.

Algebraic Geometry · Mathematics 2016-02-26 Rob Eggermont

Multi-class systems having possibly both finite and infinite classes are investigated under a natural partial exchangeability assumption. It is proved that the conditional law of such a system, given the vector of the empirical measures of…

Probability · Mathematics 2009-02-04 Carl Graham

In this article we aim to develop from first principles a theory of sum sets and partial sum sets, which are defined analogously to difference sets and partial difference sets. We obtain non-existence results and characterisations. In…

Combinatorics · Mathematics 2012-06-26 Robert S. Coulter , Todd Gutekunst

The topic of this paper is the Finiteness Conjecture for minimally unsatisfiable clause-sets (MUs), stating that for each fixed deficiency (number of clauses minus number of variables) there are only finitely many patterns, given a certain…

Discrete Mathematics · Computer Science 2016-04-06 Oliver Kullmann , Xishun Zhao

Classical Ramsey theory has successfully extended to relational structures, yielding a wealth of results that have profoundly influenced other areas of mathematics. Interestingly, the same development has not occurred in the case of dual…

Combinatorics · Mathematics 2025-07-02 Aleksa Džuklevski , Dragan Mašulović

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