Related papers: Model-theoretic dividing lines via posets
We analyze the question of which motivic homotopy types admit smooth schemes as representatives. We show that given a pointed smooth affine scheme $X$ and an embedding into affine space, the affine deformation space of the embedding gives a…
We present a logic that extends CTL (Computation Tree Logic) with operators that express synchronization properties. A property is synchronized in a system if it holds in all paths of a certain length. The new logic is obtained by using the…
We generalize a theory of Shelah for continuous logic, namely a continuous theory has OP if and only if it has IP or SOP.
Theorem. There are general position points A, B, C, P on the projective plane. Let A_P be the intersection point of lines AP and BC. Analogously define B_P and C_P. Take any points A_1, B_1, C_1 on AP, BP, CP, respectively. Let W_C be the…
Motivated by the theory of proof complexity generators we consider the following $\Sigma^p_2$ search problem $\mbox{DD}_P$ determined by a propositional proof system $P$: given a $P$-proof $\pi$ of a disjunction $\bigvee_i {\alpha}_i$, no…
A (control) network over a finite ring is proposed. Using semi-tensor product (STP) of matrices, a set of algebraic equations are provided to verify whether a finite set with two binary operators is a ring. It is then shown that the…
The aim of the present paper is to show that the concept of intuitionistic logic based on a Heyting algebra can be generalized in such a way that it is formalized by means of a bounded poset. In this case it is not assumed that the poset is…
This paper examines the structure of poset matrices by formulating a set of new construction rules for this purpose. In this direction, the technique of partial composition operation will be introduced as the basis for the construction of…
Probabilistic relational models such as parametric factor graphs enable efficient (lifted) inference by exploiting the indistinguishability of objects. In lifted inference, a representative of indistinguishable objects is used for…
The first part of the paper is a survey of recent results about the cohomology of $(\phi,\Gamma)$-modules and its applications to the theory of Selmer complexes. In the second part we formulate a version of the Main Conjecture for $p$-adic…
We identify two key conditions that a subset $A$ of a poset $P$ may satisfy to guarantee the transfer of continuity properties from $P$ to $A$. We then highlight practical cases where these key conditions are fulfilled. Along the way we are…
Neural networks often pack many unrelated concepts into a single neuron - a puzzling phenomenon known as 'polysemanticity' which makes interpretability much more challenging. This paper provides a toy model where polysemanticity can be…
This article belongs to a series on geometric complexity theory (GCT), an approach to the P vs. NP and related problems through algebraic geometry and representation theory. The basic principle behind this approach is called the flip. In…
This paper investigates spaces equipped with a family of metric-like functions satisfying certain axioms. These functions provide a unified framework for defining topology, uniformity, and diffeology. The framework is based on a family of…
We provide a framework for which one can approach showing the integer decomposition property for symmetric polytopes. We utilize this framework to prove a special case which we refer to as $2$-partition maximal polytopes in the case where…
This paper makes a first attempt to bring the Shape from Polarization (SfP) problem to the realm of deep learning. The previous state-of-the-art methods for SfP have been purely physics-based. We see value in these principled models, and…
It is known previously that the operator product expansion (OPE) between the first ${\cal N}=3 $ multiplet and itself contains the second ${\cal N}=3$ multiplet in the supersymmetric coset model. In this paper, by using their realizations…
In this paper, we tailor-make new approximation operators inspired by rough set theory and specially suited for domain theory. Our approximation operators offer a fresh perspective to existing concepts and results in domain theory, but also…
A relevant thesis is that for the family of complete first order theories with NIP (i.e. without the independence property) there is a substantial theory, like the family of stable (and the family of simple) first order theories. We examine…
It is well-known that relatively pseudocomplemented lattices can serve as an algebraic semantics of intuitionistic logic. To extend the concept of relative pseudocomplementation to non-distributive lattices, the first author introduced…