English
Related papers

Related papers: Bqo is Pi^1_2-complete

200 papers

Full binary trees naturally represent commutative non-associative products. There are many important examples of these products: finite-precision floating-point addition and NAND gates, among others. Balance in such a tree is highly…

Discrete Mathematics · Computer Science 2021-08-27 Laura Monroe

We introduce a certain class of so-called perfectoid rings and spaces, which give a natural framework for Faltings' almost purity theorem, and for which there is a natural tilting operation which exchanges characteristic 0 and…

Algebraic Geometry · Mathematics 2011-11-22 Peter Scholze

We introduce a first-order theory of finite full binary trees and then identify decidable and undecidable fragments of this theory. We show that the analogue of Hilbert`s 10th Problem is undecidable by constructing a many-to-one reduction…

Logic · Mathematics 2021-11-02 Juvenal Murwanashyaka

The present article is devoted to some examples of functions whose arguments represented in terms of certain series of the Cantor type.

Classical Analysis and ODEs · Mathematics 2021-01-05 Symon Serbenyuk

This paper introduces a novel method for finding integer sets that satisfy the Pythagorean theorem by leveraging the Higher-Order Binary Optimization (HOBO) formulation. Unlike the Quadratic Unconstrained Binary Optimization (QUBO)…

Optimization and Control · Mathematics 2024-08-22 Shoya Yasuda , Naoaki Mochida , Shunsuke Sotobayashi , Devanshu Garg , Yuichiro Minato

Chordal clutters in the sense of [14] and [3] are defined via simplicial orders. Their circuit ideal has a linear resolution, independent of the characteristic of the base field. We show that any Betti sequence of an ideal with linear…

Commutative Algebra · Mathematics 2016-02-09 Mina Bigdeli , Jürgen Herzog , Ali Akbar Yazdan Pour , Rashid Zaare-Nahandi

A binary matrix satisfies the consecutive ones property (COP) if its columns can be permuted such that the ones in each row of the resulting matrix are consecutive. Equivalently, a family of sets F = {Q_1,..,Q_m}, where Q_i is subset of R…

Data Structures and Algorithms · Computer Science 2015-03-18 Giovanni Battaglia , Roberto Grossi , Noemi Scutellà

In this paper, the class of all linearly ordered topological spaces (LOTS) quasi-ordered by the embeddability relation is investigated. In ZFC it is proved that for countable LOTS this quasi-order has both a maximal (universal) element and…

Logic · Mathematics 2011-02-11 Alex Primavesi , Katherine Thompson

We give a combinatorial description of shape theory using finite topological $T_0$-spaces (finite partially ordered sets). This description may lead to a sort of computational shape theory. Then we introduce the notion of core for inverse…

General Topology · Mathematics 2022-05-09 Pedro J. Chocano , Manuel A. Morón , Francisco R. Ruiz del Portal

We present a general method for introducing finitely axiomatizable "minimal" two-sorted theories for various subclasses of P (problems solvable in polynomial time). The two sorts are natural numbers and finite sets of natural numbers. The…

Logic in Computer Science · Computer Science 2017-01-11 Phuong Nguyen , Stephen Cook

This is a study of S. Kripke's notion of fulfilment. Motivated by Paris-Harrington statement, Kripke was looking for a proof of G\"odel's Incompleteness Theorem which was model-theoretic, natural (without self-reference), and easy.…

Logic · Mathematics 2019-04-25 J. E. Quinsey

It is proved that the class of separable Rosenthal compacta on the Cantor set having a uniformly bounded dense sequence of continuous functions, is strongly bounded.

Logic · Mathematics 2008-05-15 Pandelis Dodos

The purpose of these notes is to collect in one place some facts on the category of finite totally ordered sets and some related categories. More specifically, we collect some results on them which will be useful for the study of iteratedly…

Category Theory · Mathematics 2025-12-29 Takuo Matsuoka

We have previously established that $\Pi^1_1$-comprehension is equivalent to the statement that every dilator has a well-founded Bachmann-Howard fixed point, over $\mathbf{ATR_0}$. In the present paper we show that the base theory can be…

Logic · Mathematics 2020-08-06 Anton Freund

We consider two orthogonal points of view on finite permutations, seen as pairs of linear orders (corresponding to the usual one line representation of permutations as words) or seen as bijections (corresponding to the algebraic point of…

Combinatorics · Mathematics 2019-09-20 Michael Albert , Mathilde Bouvel , Valentin Féray

In this paper, the existence of perfect and quasi-perfect splitter sets in finite abelian groups is studied, motivated by their application in coding theory for flash memory storage. For perfect splitter sets we view them as splittings of…

Information Theory · Computer Science 2025-07-10 Zhiyu Yuan , Rongquan Feng , Gennian Ge

We give a new completion for the quasi-uniform spaces. We call the whole procedure {\it $\tau$-completion} and the new space {\it $\tau$-complement of the given}. The basic result is that every $T_{_0}$ quasi-uniform space has a…

General Topology · Mathematics 2010-08-10 Athanasios Andrikopoulos , John Stabakis

The goal of this paper is to announce there is a single orbit of the c.e. sets with inclusion, $\E$, such that the question of membership in this orbit is $\Sigma^1_1$-complete. This result and proof have a number of nice corollaries: the…

Logic · Mathematics 2015-05-13 Peter A. Cholak , Rod Downey , Leo Harrington

In this paper we construct the category of birational spaces as the category in which Temkin's relative Riemann-Zariski spaces are naturally included. Furthermore we develop an analogue of Raynaud's theory. We prove that the category of…

Algebraic Geometry · Mathematics 2013-12-02 Uri Brezner

We show that every countable cograph has either one or infinitely many siblings. This answers, very partially, a conjecture of Thomass\'e. The main tools are the notion of well quasi ordering and the correspondence between cographs and some…

Combinatorics · Mathematics 2020-04-28 Gena Hahn , Maurice Pouzet , Robert Woodrow