Related papers: Quine's Fluted Fragment Revisited
We consider an evolution equation involving the fractional powers, of order $s \in (0,1)$, of a symmetric and uniformly elliptic second order operator and Caputo fractional time derivative of order $\gamma \in (1,2]$. Since it has been…
Let L be some extension of classical propositional logic. The non-iterated probabilistic logic over L, is the logic PL that is defined by adding non-nested probabilistic operators in the language of L. For example in PL we can express a…
It is shown that order-invariance of two-variable first-logic is decidable in the finite. This is an immediate consequence of a decision procedure obtained for the finite satisfiability problem for existential second-order logic with two…
In this paper, we determine the complexity of the satisfiability problem for various logics obtained by adding numerical quantifiers, and other constructions, to the traditional syllogistic. In addition, we demonstrate the incompleteness of…
Many problems can be specified by patterns of propositional formulae depending on a parameter, e.g. the specification of a circuit usually depends on the number of bits of its input. We define a logic whose formulae, called "iterated…
We consider a class of nonlinear fractional equations having the Caputo fractional derivative of the time variable $t$, the fractional order of the self-adjoint positive definite unbounded operator in a Hilbert space and a singular…
Modal dependence logic was introduced recently by V\"a\"an\"anen. It enhances the basic modal language by an operator =(). For propositional variables p_1,...,p_n, =(p_1,...,p_(n-1);p_n) intuitively states that the value of p_n is…
Goldmann and Russell (2002) initiated the study of the complexity of the equation satisfiability problem in finite groups by showing that it is in P for nilpotent groups while it is NP-complete for non-solvable groups. Since then, several…
Phase transitions in combinatorial problems have recently been shown to be useful in locating "hard" instances of combinatorial problems. The connection between computational complexity and the existence of phase transitions has been…
The coalgebraic $\mu$-calculus provides a generic semantic framework for fixpoint logics with branching types beyond the standard relational setup, e.g. probabilistic, weighted, or game-based. Previous work on the coalgebraic $\mu$-calculus…
In this paper, we study the sampling problem for first-order logic proposed recently by Wang et al. -- how to efficiently sample a model of a given first-order sentence on a finite domain? We extend their result for the…
The reliable fraction of information is an attractive score for quantifying (functional) dependencies in high-dimensional data. In this paper, we systematically explore the algorithmic implications of using this measure for optimization. We…
We study two generalizations of fractional variational problems by considering higher-order derivatives and a state time delay. We prove a higher-order integration by parts formula involving a Caputo fractional derivative of variable order…
It is known that first-order logic with some counting extensions can be efficiently evaluated on graph classes with bounded expansion, where depth-$r$ minors have constant density. More precisely, the formulas are $\exists x_1 ... x_k \#y…
Given the emergent reasoning abilities of large language models, information retrieval is becoming more complex. Rather than just retrieve a document, modern information retrieval systems advertise that they can synthesize an answer based…
We revisit a classical crossword filling puzzle which already appeared in Garey\&Jonhson's book. We are given a grid with $n$ vertical and horizontal slots and a dictionary with $m$ words and are asked to place words from the dictionary in…
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…
In 1934, Whitney raised the question of how to recognize whether a function f defined on a closed subset X of Euclidean space is the restriction of a function that is continuously differentiable to order p. A necessary and sufficient…
We compute the fluctuation moments $\alpha_{m_1,\dots,m_r}$ of a Complex Wigner Matrix $X_N$ given by the limit $\lim_{N\rightarrow\infty}N^{r-2}k_r(Tr(X_N^{m_1}),\dots,Tr(X_N^{m_r}))$. We prove the limit exists and characterize the leading…
We establish a quenched functional central limit theorem for the total number of components of random partitions induced by Chinese restaurant process with parameters $(\alpha,\theta), \alpha\in(0,1), \theta>-\alpha$. With $P_j$ denoting…