相关论文: On the Strength of Uniqueness Quantification in Pr…

This paper proposes an alternative to standard first-order logic that seeks greater naturalness, generality, and semantic self-containment. The system removes the first-order restriction, avoids type hierarchies, and dispenses with external…

A computational problem exhibits a "gap property" when there is no tractable boundary between two disjoint sets of instances. We establish a Gap Trichotomy Theorem for a family of constraint problem variants, completely classifying the…

This work presents a formalization of the theorem of existence of most general unifiers in first-order signatures in the higher-order proof assistant PVS. The distinguishing feature of this formalization is that it remains close to the…

Datalog is a popular logic programming language for deductive reasoning tasks in a wide array of applications, including business analytics, program analysis, and ontological reasoning. However, Datalog's restriction to flat facts over…

Motivated by quantum thermodynamics we first investigate the notion of strict positivity, that is, linear maps which map positive definite states to something positive definite again. We show that strict positivity is decided by the action…

Uniqueness and independence are two fundamental properties of data. Their enforcement in database systems can lead to higher quality data, faster data service response time, better data-driven decision making and knowledge discovery from…

Labeled examples (i.e., positive and negative examples) are an attractive medium for communicating complex concepts. They are useful for deriving concept expressions (such as in concept learning, interactive concept specification, and…

Existential fixed point logic (EFPL) is a natural fit for some applications, and the purpose of this talk is to attract attention to EFPL. The logic is also interesting in its own right as it has attractive properties. One of those…

The qualitative analysis of the initial value problem P related to a non linear third order parabolic equation typical of diffusive models is discussed. Some basic properties of the the fundamental solution of a related linear operator are…

We study first-order logic (FO) over the structure consisting of finite words over some alphabet $A$, together with the (non-contiguous) subword ordering. In terms of decidability of quantifier alternation fragments, this logic is…

We analyze the behaviour of declarations of independence between existential quantifiers in quantifier prefixes of IF sentences; we give a syntactical criterion for deciding whether a sentence beginning with such prefix exists such that its…

Many computational problems can be modelled as the class of all finite structures $\mathbb A$ that satisfy a fixed first-order sentence $\phi$ hereditarily, i.e., we require that every (induced) substructure of $\mathbb A$ satisfies $\phi$.…

Building on our previous work on enriched regular logic, we introduce an enriched version of positive logic and relate it to enriched cone-injectivity classes and enriched accessible categories. To do this, we need a factorization system on…

This paper investigates the relationship between the solvability of first-order differential equations and the topology of the underlying domain through the lens of de\,Rham cohomology. We analyze the conditions under which a closed 1-form…

We consider a class of finite Markov moment problems with arbitrary number of positive and negative branches. We show criteria for the existence and uniqueness of solutions, and we characterize in detail the non-unique solution families.…

The purpose of this review is to provide a brief overview of some recent conceptual developments about possible criteria to guarantee the uniqueness of the quantization in a variety of situations that are found in cosmological systems.…

Nominal terms extend first-order terms with binding. They lack some properties of first- and higher-order terms: Terms must be reasoned about in a context of 'freshness assumptions'; it is not always possible to 'choose a fresh variable…

Let \Gamma be a structure with a finite relational signature and a first-order definition in (R;*,+) with parameters from R, that is, a relational structure over the real numbers where all relations are semi-algebraic sets. In this article,…

By Fagin's Theorem, NP contains precisely those problems that can be described by formulas starting with an existential second-order quantifier, followed by only first-order quantifiers (ESO formulas). Subsequent research refined this…

Nominal algebra includes $\alpha$-equality and freshness constraints on nominal terms endowed with a nominal set semantics that facilitates reasoning about languages with binders. Nominal unification is decidable and unitary, however, its…