相关论文: Linearization of analytic order relations

We will investigate proof-theoretic and linguistic aspects of first-order linear logic. We will show that adding partial order constraints in such a way that each sequent defines a unique linear order on the antecedent formulas of a sequent…

Given an analytic equivalence relation, we tend to wonder whether it is Borel. When it is non Borel, there is always the hope it will be Borel on a "large" set -- nonmeager or of positive measure. That has led Kanovei, Sabok and Zapletal to…

Consider a linear ordering equipped with a finite sequence of monadic predicates. If the ordering contains an interval of order type \omega or -\omega, and the monadic second-order theory of the combined structure is decidable, there exists…

We prove in this paper that there exists some infinitary rational relations which are analytic but non Borel sets, giving an answer to a question of Simonnet [Automates et Th\'eorie Descriptive, Ph. D. Thesis, Universit\'e Paris 7, March…

We study the coarse classification of partial orderings using chain conditions in the context of descriptive combinatorics. We show that (unlike the Borel counterpart of many other combinatorics), we have a distinct hierarchy of different…

We address some fundamental problems concerning the structure of idealistic equivalence relations. In particular, we show that, under analytic determinacy, there are continuum many idealistic analytic equivalence relations that are not…

We study algorithmic learning of algebraic structures. In our framework, a learner receives larger and larger pieces of an arbitrary copy of a computable structure and, at each stage, is required to output a conjecture about the isomorphism…

A linear-interval order is the intersection of a linear order and an interval order. For this class of orders, several structural results have been known. This paper introduces a new subclass of linear-interval orders. We call a partial…

An alternative proof of the completeness of relational algebra with respect to allowed formulas of first-order logic is presented. The proof relies on the well-known embedding of relational algebra into cylindric algebra, which makes it…

We investigate sigma-entangled linear orders and narrowness of Boolean algebras. We show existence of sigma-entangled linear orders in many cardinals, and we build Boolean algebras with neither large chains nor large pies. We study the…

We prove that in some cases definable chains of Borel partial orderings are necessarily countably cofinal. This includes the following cases: analytic chains, ROD chains in the Solovay model, and $\Sigma^1_2$ chains in the assumption that…

Let $f(x)$ be a monic polynomial over $\mathbb{Q}$ with complex roots $\alpha_1,\dots,\alpha_n$. Linear relations among them and $1$ over $\mathbb{Q}$ play an important role when we study the distribution of roots modulo a prime. We study…

In the 1970s M. Laczkovich posed the following problem: Let $\mathcal{B}_1(X)$ denote the set of Baire class $1$ functions defined on an uncountable Polish space $X$ equipped with the pointwise ordering. \[\text{Characterize the order types…

Let G be an abelian group acting on a set X, and suppose that no element of G has any finite orbit of size greater than one. We show that every partial order on X invariant under $G$ extends to a linear order on X also invariant under G. We…

We generalize the notion of saturated order to infinite partial orders and give both a set-theoretic and an algebraic characterization of such orders. We then study the proof theoretic strength of the equivalence of these characterizations…

Linearizing two partial orders to maximize the number of adjacencies and minimize the number of breakpoints is APX-hard. This holds even if one of the two partial orders is already a linear order and the other is an interval order, or if…

In this paper, we study the well extension of strict(irreflective) partial well orderings. We first prove that any partially well-ordered structure <A, R> can be extended to a well-ordered one. Then we prove that every linear extension of…

In this paper, we show that, for each $p>1$, there are continuum many Borel equivalence relations between $\Bbb R^\omega/\ell_1$ and $\Bbb R^\omega/\ell_p$ ordered by $\le_B$ which are pairwise Borel incomparable.

Tasks that model the relation between pairs of tokens in a string are a vital part of understanding natural language. Such tasks, in general, require exhaustive pair-wise comparisons of tokens, thus having a quadratic runtime complexity in…

We construct a monadic second-order sentence that characterizes the ternary relations that are the betweenness relations of finite or infinite partial orders. We prove that no first-order sentence can do that. We characterize the partial…