English
Related papers

Related papers: Uniform Guarded Fragments

200 papers

We have recently presented evidence that in configurations dominating the regularized pure-glue QCD path integral, the topological charge density constructed from overlap Dirac operator organizes into an ordered space-time structure. It was…

High Energy Physics - Lattice · Physics 2008-11-26 I. Horvath , A. Alexandru , J. B. Zhang , Y. Chen , S. J. Dong , T. Draper , F. X. Lee , K. F. Liu , N. Mathur , S. Tamhankar , H. B. Thacker

Uniform interpolation is the property that, for any formula and set of atoms, there exists the strongest consequence omitting those atoms. It plays a central role in knowledge representation and reasoning tasks such as knowledge update and…

Logic in Computer Science · Computer Science 2026-03-31 Kexu Wang , Liangda Fang

Craig's interpolation theorem (Craig 1957) is an important theorem known for propositional logic and first-order logic. It says that if a logical formula $\beta$ logically follows from a formula $\alpha$, then there is a formula $\gamma$,…

Artificial Intelligence · Computer Science 2007-05-23 Eyal Amir

Using a recently introduced algebraic framework for the classification of fragments of first-order logic, we study the complexity of the satisfiability problem for several ordered fragments of first-order logic, which are obtained from the…

Logic in Computer Science · Computer Science 2021-03-16 Reijo Jaakkola

In this paper, we shall give an explicit proof that constacyclic codes over finite commutative rings can be realized as ideals in some twisted group rings. Also, we shall study isometries between those codes and, finally, we shall study…

Information Theory · Computer Science 2023-07-26 Samir Assuena

The Uniform convergence of double Fourier-Legendre series of function of bounded Harmonic variation and bounded partial $\Lambda $-variation are investigated.

Analysis of PDEs · Mathematics 2012-10-10 Ushangi Goginava

We show that Propositional Dynamic Logic (PDL) has the Craig Interpolation Property. This question has been open for many years. Three proof attempts were published, but later criticized in the literature or retracted. Our proof is based on…

Logic in Computer Science · Computer Science 2025-03-18 Manfred Borzechowski , Malvin Gattinger , Helle Hvid Hansen , Revantha Ramanayake , Valentina Trucco Dalmas , Yde Venema

We consider the following properties of compact oriented irreducible graph-manifolds: to contain a $\pi_1$-injective surface (immersed, virtually embedded or embedded), be (virtually) fibered over $S^1$, and to carry a metric of nonpositive…

Geometric Topology · Mathematics 2007-05-23 P. Svetlov

Let $G$ denote a $Q$-polynomial distance-regular graph with diameter $D$ at least 4. Assume that the intersection numbers of $G$ satisfy $a_i=0$ for $0 \leq i \leq D-1$ and $a_D\neq 0$. We show that $G$ is a polygon, a folded cube, or an…

Combinatorics · Mathematics 2016-09-07 Michael S. Lang , Paul M. Terwilliger

A theory has been presented previously in which the geometrical structure of a real four-dimensional space time manifold is expressed by a real orthonormal tetrad, and the group of diffeomorphisms is replaced by a larger group. The group…

General Relativity and Quantum Cosmology · Physics 2012-08-27 Dave Pandres, , Edward L. Green

In this chapter, we present six different proofs of Craig interpolation for the modal logic K, each using a different set of techniques (model-theoretic, proof-theoretic, syntactic, automata-theoretic, using quasi-models, and algebraic). We…

Logic in Computer Science · Computer Science 2025-11-25 Nick Bezhanishvili , Balder ten Cate , Rosalie Iemhoff

In some applications of matching, the structural or hierarchical properties of the two graphs being aligned must be maintained. The hierarchical properties are induced by the direction of the edges in the two directed graphs. These…

Data Structures and Algorithms · Computer Science 2009-09-29 Sean M. Falconer , Dmitri Maslov

Let $U$ be a unipotent group which is graded in the sense that it has an extension $H$ by the multiplicative group of the complex numbers such that all the weights of the adjoint action on the Lie algebra of $U$ are strictly positive. We…

Algebraic Geometry · Mathematics 2015-11-24 Gergely Bérczi , Frances Kirwan

In this work, we study the parallel complexity of the Euclidean minimum-weight perfect matching (EWPM) problem. Here our graph is the complete bipartite graph $G$ on two sets of points $A$ and $B$ in $\mathbb{R}^2$ and the weight of each…

Computational Geometry · Computer Science 2024-05-30 Sujoy Bhore , Sarfaraz Equbal , Rohit Gurjar

We study uniform interpolation and forgetting in the description logic ALC. Our main results are model-theoretic characterizations of uniform inter- polants and their existence in terms of bisimula- tions, tight complexity bounds for…

Logic in Computer Science · Computer Science 2011-04-15 Carsten Lutz , Frank Wolter

We present a discrete Morse-theoretic method for proving that a regular CW complex is homeomorphic to a sphere. We use this method to define bisimplices, the cells of a class of regular CW complexes we call bisimplicial complexes. The…

Group Theory · Mathematics 2019-04-16 Nima Hoda

We investigate some properties of topological groups related to disconnectedness or Archimedeanness. We prove or disprove the preservation of those under operations as subgroups, quotients, products, etc. Characterizations of…

General Topology · Mathematics 2007-05-23 Masasi Higasikawa

We develop a doubly-exponential decision procedure for the satisfiability problem of guarded separation logic -- a novel fragment of separation logic featuring user-supplied inductive predicates, Boolean connectives, and separating…

Logic in Computer Science · Computer Science 2021-04-21 Jens Pagel , Christoph Matheja , Florian Zuleger

Let $F$ be a non-Archimedian local field of characteristic zero and $E/F$ a quadratic extension. The aim of the present article is to study the multiplicity of an irreducible admissible representation of ${\rm GL}_2(F)$ occurring in an…

Representation Theory · Mathematics 2018-03-16 Shiv Prakash Patel

This paper is motivated by the question whether there exists a logic capturing polynomial time computation over unordered structures. We consider several algorithmic problems near the border of the known, logically defined complexity…

Logic · Mathematics 2007-05-23 Andreas Blass , Yuri Gurevich , Saharon Shelah