English
Related papers

Related papers: Bqo is Pi^1_2-complete

200 papers

A set is introreducible if it can be computed by every infinite subset of itself. Such a set can be thought of as coding information very robustly. We investigate introreducible sets and related notions. Our two main results are that the…

Logic · Mathematics 2020-11-09 Noam Greenberg , Matthew Harrison-Trainor , Ludovic Patey , Dan Turetsky

A Cantor set is a non-empty, compact set that has neither interior nor isolated points. In this paper a Cantor set $K\subseteq \mathbb{R}$ is constructed such that every set definable in $(\mathbb{R},<,+,\cdot,K)$ is Borel. In addition, we…

Logic · Mathematics 2016-05-04 Philipp Hieronymi

A quasi-order is a binary, reflexive and transitive relation. In the Journal of Pure and Applied Algebra 45 (1987), S.M. Fakhruddin introduced the notion of (totally) quasi-ordered fields and showed that each such field is either an ordered…

Commutative Algebra · Mathematics 2018-07-18 Simon Müller

We prove that continuous reducibility is a well-quasi-order on the class of continuous functions between separable metrizable spaces with analytic zero-dimensional domain. To achieve this, we define scattered functions, which generalize…

Logic · Mathematics 2024-10-18 Raphaël Carroy , Yann Pequignot

Given a countable mathematical structure, its Scott sentence is a sentence of the infinitary logic $\mathcal{L}_{\omega_1 \omega}$ that characterizes it among all countable structures. We can measure the complexity of a structure by the…

Logic · Mathematics 2025-11-07 Rachael Alvir , Barbara Csima , Matthew Harrison-Trainor

In 1895, Cantor showed that between every two countable dense real sets, there is an order isomorphism. In fact, there is always such an order isomorphism, which is the restriction of a universal entire function.

Complex Variables · Mathematics 2018-12-27 Paul M. Gauthier

We describe the Dedekind cuts explicitly in terms of non-standard rational numbers. This leads to another construction of a Dedekind complete totally ordered field or, equivalently, to another proof of the consistency of the axioms of the…

Logic · Mathematics 2011-01-21 James F. Hall , Todor D. Todorov

In this paper, we first briefly survey automated termination proof methods for higher-order calculi. We then concentrate on the higher-order recursive path ordering, for which we provide an improved definition, the Computability Path…

Logic in Computer Science · Computer Science 2008-12-18 Frédéric Blanqui , Jean-Pierre Jouannaud , Albert Rubio

A `whole-part' theory is developed for a set of finite quantum systems $\Sigma (n)$ with variables in ${\mathbb Z}(n)$. The partial order `subsystem' is defined, by embedding various attributes of the system $\Sigma (m)$ (quantum states,…

Quantum Physics · Physics 2015-06-04 A. Vourdas

The embracing of actual infinity in mathematics leads naturally to the question of comparing the sizes of infinite collections. The basic dilemma is that the Cantor Principle (CP), according to which two sets have the same size if there is…

General Mathematics · Mathematics 2019-09-13 Kateřina Trlifajová

We study the logic obtained by endowing the language of first-order arithmetic with second-order measure quantifiers. This new kind of quantification allows us to express that the argument formula is true in a certain portion of all…

Logic in Computer Science · Computer Science 2021-04-27 Melissa Antonelli , Ugo Dal Lago , Paolo Pistone

This paper is a contribution to the study of hereditary classes of relational structures, these classes being quasi-ordered by embeddability. It deals with the specific case of ordered sets of width two and the corresponding bichains and…

Combinatorics · Mathematics 2022-08-30 Maurice Pouzet , Imed Zaguia

This study describes such a situation that a Cantor set emerges as a result of the exploration of sufficient conditions for the property which is generalized from fundamental chaotic maps, and the Cantor set even guarantees infinitely many…

Chaotic Dynamics · Physics 2015-03-18 Yoshihito Ogasawara , Shin'ichi Oishi

The fundamental aim of this paper is to introduce and investigate a new property of quasi 2-normed space based on a question given by C. Park (2006) [2] for the completion quasi 2-normed space. Finally, we also find an answer for a question…

Combinatorics · Mathematics 2019-07-04 Mehmet Kir , Mehmet Acikgoz

We prove that the existence of finite combinatorial objects such as affine planes, mutually orthogonal Latin squares, and resolvable balanced incomplete block designs can be reformulated as the existence of certain algorithmic reductions…

Combinatorics · Mathematics 2026-04-21 Damir D. Dzhafarov , Jun le Goh

We introduce a flexible class of well-quasi-orderings (WQOs) on words that generalizes the ordering of (not necessarily contiguous) subwords. Each such WQO induces a class of piecewise testable languages (PTLs) as Boolean combinations of…

Formal Languages and Automata Theory · Computer Science 2018-02-22 Georg Zetzsche

We consider a family U of finite universes. The second order quantifier Q_R, means for each u in U quantifying over a set of n(R)-place relations isomorphic to a given relation. We define a natural partial order on such quantifiers called…

Logic · Mathematics 2007-05-23 Mor Doron , Saharon Shelah

The notion of better quasi order ($\mathsf{BQO}$), due to Nash-Williams, is very fruitful mathematically and intriguing from the standpoint of logic, due to several long-standing open problems. In the present paper, we make a significant…

Logic · Mathematics 2022-08-11 Anton Freund

For every finitary set functor F we demonstrate that free algebras carry a canonical partial order. In case F is bicontinuous, we prove that the cpo obtained as the conservative completion of the free algebra is the free completely…

Logic in Computer Science · Computer Science 2019-06-28 Jiri Adamek

In our work we investigate quotient structures and quotient spaces of a space of orderings arising from subgroups of index two. We provide necessary and sufficient conditions for a quotient structure to be a quotient space that, among other…

Rings and Algebras · Mathematics 2016-04-26 Pawel Gladki , Murray Marshall