相关论文: On \Sigma^1_1-complete Equivalence Relations on th…
We prove several results of the following type: given finite dimensional normed space V there exists another space X with log (dim X) = O(log (dim V)) and such that every subspace (or quotient) of X, whose dimension is not "too small,"…
Let $v(F)$ denote the number of vertices in a fixed connected pattern graph $F$. We show an infinite family of patterns $F$ such that the existence of a subgraph isomorphic to $F$ is expressible by a first-order sentence of quantifier depth…
Given a non-negative weight $v$, not necessarily bounded or strictly positive, defined on a domain $G$ in the complex plane, we consider the weighted space $H_v^\infty(G)$ of all holomorphic functions on $G$ such that the product $v|f|$ is…
The classical concept of bounded completeness and its relation to sufficiency and ancillarity play a fundamental role in unbiased estimation, unbiased testing, and the validity of inference in the presence of nuisance parameters. In this…
We associate to any Riemannian symmetric space (of finite or infinite dimension) a L$^*$-algebra, under the assumption that the curvature operator has a fixed sign. L$^*$-algebras are Lie algebras with a pleasant Hilbert space structure.…
This article explores \Z_2-graded L_\infinity algebra structures on a 2|1-dimensional vector space. The reader should note that our convention on the parities is the opposite of the usual one, because we define our structures on the…
We study $\Sigma^1_2$ definable counterparts for some algebraic equivalent forms of the Continuum Hypothesis. All turn out to be equivalent to "all reals are constructible".
Higher-order unification has been shown to be undecidable. Miller discovered the pattern fragment and subsequently showed that higher-order pattern unification is decidable and has most general unifiers. We extend the algorithm to…
We study the model theory of vector spaces with a bilinear form over a fixed field. For finite fields this can be, and has been, done in the classical framework of full first-order logic. For infinite fields we need different logical…
Louveau and Rosendal [5] have shown that the relation of bi-embeddability for countable graphs as well as for many other natural classes of countable structures is complete under Borel reducibility for analytic equivalence relations. This…
In this article, we study "questionable representations" of (partial or total) orders, introduced in our previous article "A class of orders with linear? time sorting algorithm". (Later, we consider arbitrary binary functional/relational…
We give a new proof of the fact that finite bipartite graphs cannot be axiomatized by finitely many first-order sentences among FINITE graphs. (This fact is a consequence of a general theorem proved by L. Ham and M. Jackson, and the…
We show that including degrees of a particular kind of provability in the search target for any theorem-prover in sufficiently powerful formal systems over finite-sized statements preserves well-definition and a sufficient consistency while…
We develop topological dynamics for the group of automorphisms of a monster model of any given theory. In particular, we find strong relationships between objects from topological dynamics (such as the generalized Bohr compactification…
A finite relational structure A is called compact if for any infinite relational structure B of the same type, the existence of a homomorphism from B to A is equivalent to the existence of homomorphisms from all finite substructures of B to…
By studying the group of self homotopy equivalences of the localization (at a prime $p$ and/or zero) of some aspherical complexes, we show that, contrary to the case when the considered space is a nilpotent complex, $\mathcal{E}_{\#}^m…
We explore new interactions between finite model theory and classical streams of universal algebra and semigroup theory. A key result is an example of finite algebras whose variety is not finitely axiomatisable in first order logic, but…
If L is an order polynomially complete lattice, (that is: every monotone function from L^n to L is induced by a lattice-theoretic polynomial) then the cardinality of L is a strongly inaccessible cardinal. In particular, the existence of…
We show that certain families of sets in $\mathbb{R}^2$ (or $\mathbb{R}^n$) which are neither definable nor have bounded VC-dimension are nonetheless uniformly approximately definable in the real field, an o-minimal structure.
In this article, we propose a new classification of $\Sigma^0_2$ formulas under the realizability interpretation of many-one reducibility (i.e., Levin reducibility). For example, ${\sf Fin}$, the decision of being eventually zero for…