English
Related papers

Related papers: Capturing the polynomial hierarchy by second-order…

200 papers

In this paper we analyze k-ary inclusion-exclusion logic, INEX[k], which is obtained by extending first order logic with k-ary inclusion and exclusion atoms. We show that every formula of INEX[k] can be expressed with a formula of k-ary…

Logic · Mathematics 2018-06-19 Raine Rönnholm

The paper considers the representation of k-valued logical functions in the class of disjunctive normal forms. Various classes of monotone functions of k-valued logic are investigated. Theorems are proved on the coincidence of reduced and…

Logic · Mathematics 2024-02-01 Anvar Kabulov , Abdussattar Baizhumanov , Mansur Berdimurodov

This paper is devoted to the construction of finite elements on grids that consist of general quadrilaterals not limited in parallelograms. Two finite elements defined as Ciarlet's triple are established for the $H^1$ and $H(\rm rot)$…

Numerical Analysis · Mathematics 2020-06-25 Qimeng Quan , Xia Ji , Shuo Zhang

We give reconstruction algorithms for subclasses of depth-3 arithmetic circuits. In particular, we obtain the first efficient algorithm for finding tensor rank, and an optimal tensor decomposition as a sum of rank-one tensors, when given…

Computational Complexity · Computer Science 2022-09-12 Shir Peleg , Amir Shpilka , Ben Lee Volk

For each sequence of polynomials, P=(p_1(t),p_2(t),...), we define a characteristic series of groups, called the derived series localized at P. Given a knot K in S^3, such a sequence of polynomials arises naturally as the orders of certain…

Geometric Topology · Mathematics 2011-10-18 Tim D. Cochran , Shelly Harvey , Constance Leidy

Using recent results in topos theory, two systems of higher-order logic are shown to be complete with respect to sheaf models over topological spaces---so-called ``topological semantics''. The first is classical higher-order logic, with…

Logic · Mathematics 2023-03-31 Steve Awodey , Carsten Butz

We give explicit, uniform formulas for the graded characters and total ranks of the Lie algebra homology of finite-dimensional representations in all classical types. In many cases, these compute the Tor groups of finite length modules over…

Representation Theory · Mathematics 2025-10-03 Steven V Sam , Keller VandeBogert , Jerzy Weyman

We give a characterisation of fragmentable, compact linearly order spaces. In particular, we show that if $K$ is a compact, fragmentable, linearly ordered space then $K$ is a Radon-Nikod\'{y}m compact. In addition, we obtain some…

Functional Analysis · Mathematics 2008-11-14 R. J. Smith

Each degree $n+k$ polynomial of the form $(x+1)^k(x^n+c_1x^{n-1}+\cdots +c_n)$, $k\in \mathbb{N}$, is representable as Schur-Szeg\H{o} composition of $n$ polynomials of the form $(x+1)^{n+k-1}(x+a_j)$. We study properties of the affine…

Classical Analysis and ODEs · Mathematics 2015-04-09 Vladimir Petrov Kostov

We continue to develop the tensor-algebra approach to knot polynomials with the goal to present the story in elementary and comprehensible form. The previously reviewed description of Khovanov cohomologies for the gauge group of rank N-1=1…

High Energy Physics - Theory · Physics 2015-06-17 V. Dolotin , A. Morozov

There are familiar examples of computable structures having various computable Scott ranks. There are also familiar structures, such as the Harrison ordering, which have Scott rank $\omega_1^{CK}+1$. Makkai produced a structure of Scott…

Logic · Mathematics 2008-03-25 Wesley Calvert , Sergey S. Goncharov , Julia F. Knight

We introduce trace definability, a weak notion of interpretability, and trace equivalence, a weak notion of equivalence for first order structures and theories. In particular we get an interesting weak equivalence notion for $\mathrm{NIP}$…

Logic · Mathematics 2022-04-07 Erik Walsberg

We prove that for each sufficiently complicated orientable surface $S$, there exists an infinite image linear representation $\rho$ of $\pi_1(S)$ such that if $\gamma\in\pi_1(S)$ is freely homotopic to a simple closed curve on $S$, then…

Geometric Topology · Mathematics 2016-12-21 Thomas Koberda , Ramanujan Santharoubane

We study the Sierpinski object $\Sigma$ in the realizability topos based on Scott's graph model of the $\lambda$-calculus. Our starting observation is that the object of realizers in this topos is the exponential $\Sigma ^N$, where $N$ is…

Logic in Computer Science · Computer Science 2023-06-22 Tom de Jong , Jaap van Oosten

Recent work introduced Generalized First Order Decision Diagrams (GFODD) as a knowledge representation that is useful in mechanizing decision theoretic planning in relational domains. GFODDs generalize function-free first order logic and…

Artificial Intelligence · Computer Science 2015-02-23 Benjamin J. Hescott , Roni Khardon

In previous work, Abramsky, Dawar and Wang (LiCS 2017) and Abramsky and Shah (CSL 2018) have shown how a range of model comparison games which play a central role in finite model theory, including Ehrenfeucht-Fraisse, pebbling, and…

Logic in Computer Science · Computer Science 2021-05-14 Samson Abramsky , Dan Marsden

We define a new variety of loops we call $\Gamma$-loops. After showing $\Gamma$-loops are power associative, our main goal will be showing a categorical isomorphism between Bruck loops of odd order and $\Gamma$-loops of odd order. Once this…

Group Theory · Mathematics 2013-02-12 Mark Greer

We examine the conformal property of the second Hamiltonian structure of constrained KP hierarchy derived by Oevel and Strampp. We find that it naturallygives a family of nonlocal extended conformal algebras. We give two examples of such…

High Energy Physics - Theory · Physics 2009-10-28 Wen-Jui Huang , J. C. Shaw , H. C. Yen

Le Stum and Quir\'os proved the formal Poincar\'e lemma in crystalline cohomology of higher level using the jet complex, and applied it to give a de Rham interpretation of this cohomology. In this article, we prove the logarithmic version…

Algebraic Geometry · Mathematics 2016-10-14 Kazuaki Miyatani

Korten and Pitassi (FOCS, 2024) defined a new complexity class $L_2^P$ as the polynomial-time Turing closure of the Linear Ordering Principle. They put it between $MA$ (Merlin--Arthur protocols) and $S_2^P$ (the second symmetric level of…

Computational Complexity · Computer Science 2026-03-31 Edward A. Hirsch , Ilya Volkovich