Related papers: Completeness for Flat Modal Fixpoint Logics
In 1997 Timothy J. Surendonk proved via algebraic semantics that all modal logics without iterative axioms are canonical and so strongly complete. In this paper, we continue the work done by Surendonk in this field. We use neighborhood…
The elementary affine lambda-calculus was introduced as a polyvalent setting for implicit computational complexity, allowing for characterizations of polynomial time and hyperexponential time predicates. But these results rely on type…
We find the model completion of the theory modules over $A$, where $A$ is a finitely generated commutative algebra over a field $K$. This is done in a context where the field $K$ and the module are represented by sorts in the theory, so…
We prove expressive completeness results for convex propositional and modal team logics, where a logic is convex if, for each formula, if it is true in two teams $t$ and $u$ and $t\subseteq s\subseteq u$, then it is also true in $s$. We…
In this paper, we investigate arithmetical completeness with respect to finite Kripke models of quantified modal logic. We adapt the finite-model embedding techniques of Artemov and Japaridze to two settings involving finite Kripke models.…
The modal mu-calculus, introduced by Dexter Kozen, is an extension of modal logic with fixpoint operators. Its axiomatization, Koz, was introduced at the same time and is an extension of the minimal modal logic K with the so-called Park…
The advancement of Large Language Models (LLMs) has greatly improved our ability to process complex language. However, accurately detecting logical fallacies remains a significant challenge. This study presents a novel and effective prompt…
We analyze the problem of defining well-founded semantics for ordered logic programs within a general framework based on alternating fixpoint theory. We start by showing that generalizations of existing answer set approaches to preference…
It is well known that, under certain conditions, it is possible to split logic programs under stable model semantics, i.e. to divide such a program into a number of different "levels", such that the models of the entire program can be…
There has been a significant interest in extending various modal logics with intersection, the most prominent examples being epistemic and doxastic logics with distributed knowledge. Completeness proofs for such logics tend to be…
Let $G$ be a topological group with finite Kazhdan set, let $\Omega$ be a standard Borel space and $\mu$ a finite measure on $\Omega$. We prove that for any $p\in [1, \infty)$, any affine isometric action $G \curvearrowright L_p(\Omega,…
We study the parameterized problem of satisfying ``almost all'' constraints of a given formula $F$ over a fixed, finite Boolean constraint language $\Gamma$, with or without weights. More precisely, for each finite Boolean constraint…
A classical result of Cherbonnier and Colmez says that all \'etale $(\varphi, \Gamma)$-modules are overconvergent. In this paper, we give another proof of this fact when the base field $K$ is a finite extension of $\mathbb Q_p$.…
We establish new, and surprisingly tight, connections between propositional proof complexity and finite model theory. Specifically, we show that the power of several propositional proof systems, such as Horn resolution, bounded-width…
Orthogonality is a notion based on the duality between programs and their environments used to determine when they can be safely combined. For instance, it is a powerful tool to establish termination properties in classical formal systems.…
Any satisfiability problem in conjunctive normal form can be solved in polynomial time by reducing it to a 3-sat formulation and transforming this to a Linear Complementarity problem (LCP) which is then solved as a linear program (LP). Any…
The first-order theory of MALL (multiplicative, additive linear logic) over only equalities is an interesting but weak logic since it cannot capture unbounded (infinite) behavior. Instead of accounting for unbounded behavior via the…
In S. 1 we deal with amalgamation bases, e.g., we define when an a.e.c. $k$ has $(\lambda,\kappa)$-amalgamation which means "many" M in $K^k_\lambda$ are amalgamation bases. We then consider what happens for the class of lf groups. In S. 2…
In this work, a functional variant of the polynomial analogue of the classical Gandy's fixed point theorem is obtained. Sufficient conditions have been found to ensure that the complexity of the recursive function does not go beyond the…
We prove that the torsion-free lamplighter group $\Gamma = \mathbb{Z}^n \wr \mathbb{Z}$ of any rank $n \in \mathbb{N}$ is profinitely rigid in the absolute sense: the finite quotients of $\Gamma$ determine its isomorphism type uniquely…