相关论文: An Intermediate Logic Contained in Medvedev's Logi…

Some implications of flavour unification in supersymmetric Grand Unified Theories are briefly reviewed. We argue that the gauge hierarchy phenomenon properly interpreted in terms of the natural missing VEV solution for the adjoint scalar in…

The stable model semantics had been recently generalized to non-Herbrand structures by several works, which provides a unified framework and solid logical foundations for answer set programming. This paper focuses on the expressiveness of…

First-order logic (FO) can express many algorithmic problems on graphs, such as the independent set and dominating set problem, parameterized by solution size. On the other hand, FO cannot express the very simple algorithmic question of…

Motivated by Arveson's conjecture, we introduce a notion of hyperrigidity for a partial order on the state space of a $C^*$-algebra $B$. We show how this property is equivalent to the existence of a boundary: a subset of the pure states…

Categorical Universal Logic is a theory of monad-relativised hyperdoctrines (or fibred universal algebras), which in particular encompasses categorical forms of both first-order and higher-order quantum logics as well as classical,…

Algebraic datatypes, and among them lists and trees, have attracted a lot of interest in automated reasoning and Satisfiability Modulo Theories (SMT). Since its latest stable version, the SMT-LIB standard defines a theory of algebraic…

Given an effective Q-divisor D on a smooth complex variety, one can associate to D its multiplier ideal sheaf J(D), which measures in a somewhat subtle way the singularities of D. Because of their strong vanishing properties, these ideals…

The concept of pseudo q-factorization graphs was recently introduced by the last two authors as a combinatorial language which is suited for capturing certain properties of Drinfeld polynomials. Using certain known representation theoretic…

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…

We provide two proofs of the compactness theorem for extensions of first-order logic based on team semantics. First, we build upon L\"uck's ultraproduct construction for team semantics and prove a suitable version of {\L}o\'s' Theorem.…

We generalize $N \leftrightarrow -N$ duality of dimension formulae of $SU(N)$ representations on a (class of) representations with $N$-dependent Young diagrams (which include the adjoint representation), and on eigenvalues of the Casimir…

Let p be an odd prime, n an odd positive integer and C the p-Sylow subgroup the class group of the p-cyclotomic extension of the rationals. When log(p) is bigger than n**(224n**4), we prove that the eigenspace on C attached to the (p-n)-th…

Supervenience is an important philosophical concept. In this paper, inspired by the supervenience-determined consequence relation and the semantics of agreement operator, we introduce a modal logic of supervenience, which has a dyadic…

Amalgamation SNP (ASNP) is a fragment of existential second-order logic that strictly contains binary connected MMSNP of Feder and Vardi and binary guarded monotone SNP of Bienvenu, ten Cate, Lutz, and Wolter; it is a promising candidate…

An important open question in AI is what simple and natural principle enables a machine to reason logically for meaningful abstraction with grounded symbols. This paper explores a conceptually new approach to combining probabilistic…

We propose a novel framework seamlessly providing key properties of both neural nets (learning) and symbolic logic (knowledge and reasoning). Every neuron has a meaning as a component of a formula in a weighted real-valued logic, yielding a…

One of the nice properties of the first-order logic is the compactness of satisfiability. It state that a finitely satisfiable theory is satisfiable. However, different degrees of satisfiability in many-valued logics, poses various kind of…

We study two extensions of FO2[<], first-order logic interpreted in finite words, in which formulas are restricted to use only two variables. We adjoin to this language two-variable atomic formulas that say, "the letter $a$ appears between…

In the realm of light logics deriving from linear logic, a number of variants of exponential rules have been investigated. The profusion of such proof systems induces the need for cut-elimination theorems for each logic, the proof of which…

We present a novel symbolic reasoning engine for SQL which can efficiently generate an input $I$ for $n$ queries $P_1, \cdots, P_n$, such that their outputs on $I$ satisfy a given property (expressed in SMT). This is useful in different…