相关论文: Coding with ladders a well-ordering of the reals

General error locator polynomials are polynomials able to decode any correctable syndrome for a given linear code. Such polynomials are known to exist for all cyclic codes and for a large class of linear codes. We provide some decoding…

We enumerate total cyclic orders on $\left\{1,\ldots,n\right\}$ where we prescribe the relative cyclic order of consecutive triples $(i,{i+1},{i+2})$, these integers being taken modulo $n$. In some cases, the problem reduces to the…

We show that if $cf(2^{\aleph_0})=\aleph_1,$ then any non-trivial $\aleph_1$-closed forcing notion of size $\leq 2^{\aleph_0}$ is forcing equivalent to $Add(\aleph_1, 1),$ the Cohen forcing for adding a new Cohen subset of $\omega_1.$ We…

We study the model-checking problem for first- and monadic second-order logic on finite relational structures. The problem of verifying whether a formula of these logics is true on a given structure is considered intractable in general, but…

Tractability results for the model checking problem of logics yield powerful algorithmic meta theorems of the form: Every computational problem expressible in a logic $L$ can be solved efficiently on every class $\mathscr{C}$ of structures…

Given any collection F of computable functions over the reals, we show that there exists an algorithm that, given any L_F-sentence \varphi containing only bounded quantifiers, and any positive rational number \delta, decides either "\varphi…

Denote by $\continuum=2^{\aleph_0}$ the cardinal of continuum. We construct an intriguing family $(P_\alpha: \alpha\in\continuum)$ of prime $z$-ideals in $\C_0(\reals)$ with the following properties: If $f\in P_{i_0}$ for some…

We contribute to the study of $\aleph_1$-dense sets of reals, a mainstay in set theoretic research since Baumgartner's seminal work in the 70s. In particular, we show that it is consistent with $\textsf{MA}$ that there exists an…

We present two different types of models where, for certain singular cardinals lambda of uncountable cofinality, lambda -> (lambda, omega+1)^2, although lambda is not a strong limit cardinal. We announce, here, and will present in a…

In this paper we consider well-posedness properties of vector optimization problems with objective function $f: X \to Y$ where $X$ and $Y$ are Banach spaces and $Y$ is partially ordered by a closed convex pointed cone with nonempty…

It is consistent that there is a partial order (P,<) of size aleph_1 such that every monotone (unary) function from P to P is first order definable in (P,<). The partial order is constructed in an extension obtained by finite support…

Well-partial orders, and the ordinal invariants used to measure them, are relevant in set theory, program verification, proof theory and many other areas of computer science and mathematics. In this article we focus on one of the most…

We mainly investigate model of set theory with restricted choice, e.g., ZF + DC + "the family of countable subsets of lambda is well ordered for every lambda" (really local version for a given lambda). In this frame much of pcf theory can…

In various subjects including mathematics, one can hope to use mathematical thinking well when the right kinds of algebraic structure to consider can be discovered or spotted. Therefore, it would help to understand kinds of algebraic…

In this work we use a notion of rank first introduced by James Baumgartner and Peter Dordal and later developed independently by the third author to show that adding a Hechler real has strong combinatorial consequences. We prove: 1)…

This work deals with defect structures in models described by scalar fields. The investigations focus on generalized models, with the kinetic term modified to allow for a diversity of possibilities. We develop a new framework, in which we…

Metric embedding has become a common technique in the design of algorithms. Its applicability is often dependent on how high the embedding's distortion is. For example, embedding finite metric space into trees may require linear distortion…

Let $U_0,U_1$ be two normal measures on $\kappa .$ We say that $U_0$ is in the Mitchell ordering less then $U_1,$ $U_0\vartriangleleft U_1,$ if $U_0 \in Ult(V,U_1) .$ The ordering is well-known to be transitive and well-founded. It has been…

The experimental study of two kinds of electrical circuits, a domino ladder and a nested ladder, is presented. While the domino ladder is known and already appeared in the theory of fractional-order systems, the nested ladder circuit is…

We prove a higher order generalization of Glaeser inequality, according to which one can estimate the first derivative of a function in terms of the function itself, and the Holder constant of its k-th derivative. We apply these…