Related papers: (Non-)well-founded derivations in the provability …
We prove global existence, uniqueness and regularity of the mild, Lp and classical solution of a non-linear Fokker-Planck equation arising in an adaptive importance sampling method for molecular dynamics calculations. The non- linear term…
Motivated by the problem of finding finite versions of classical incompleteness theorems, we present some conjectures that go beyond ${\bf NP\neq co NP}$. These conjectures formally connect computational complexity with the difficulty of…
This paper investigates the expressiveness of a fragment of first-order sentences in Gaifman normal form, namely the positive Boolean combinations of basic local sentences. We show that they match exactly the first-order sentences preserved…
We study first-order logic over unordered structures whose elements carry a finite number of data values from an infinite domain which can be compared wrt. equality. As the satisfiability problem for this logic is undecidable in general, in…
Applying dynamic logics to program verifications is a challenge, because their axiomatic rules for regular expressions can be difficult to be adapted to different program models. We present a novel dynamic logic, called DLp, which supports…
How can we reason around logical paradoxes without falling into them? This paper introduces grounded deduction or GD, a Kripke-inspired approach to first-order logic and arithmetic that is neither classical nor intuitionistic, but…
This paper explores relational syllogistic logics, a family of logical systems related to reasoning about relations in extensions of the classical syllogistic. These are all decidable logical systems. We prove completeness theorems and…
We develop foundational aspects of stability theory in affine logic. On the one hand, we prove appropriate affine versions of many classical results, including definability of types, existence of non-forking extensions, and other…
Long quasi-cyclic codes of any fixed index $>1$ have been shown to be asymptotically good, depending on Artin primitive root conjecture in (A. Alahmadi, C. G\"uneri, H. Shoaib, P. Sol\'e, 2017). We use this recent result to construct good…
We study the notion of conservative translation between logics introduced by Feitosa and D'Ottaviano. We show that classical propositional logic (CPC) is universal in the sense that every finitary consequence relation over a countable set…
All known structural extensions of the substructural logic $\mathsf{FL_e}$, Full Lambek calculus with exchange/commutativity, (corresponding to subvarieties of commutative residuated lattices axiomatized by $\{\vee, \cdot, 1\}$-equations)…
Logical relations are one of the most powerful techniques in the theory of programming languages, and have been used extensively for proving properties of a variety of higher-order calculi. However, there are properties that cannot be…
Probabilistic circuits compute multilinear polynomials that represent multivariate probability distributions. They are tractable models that support efficient marginal inference. However, various polynomial semantics have been considered in…
Belnap-Dunn logic, also knows as the logic of First-Degree Entailment, is a logic that can serve as the underlying logic of theories that are inconsistent or incomplete. For various reasons, different expansions of Belnap-Dunn logic with…
We prove that every local derivation on a complex semisimple finite-dimensional Leibniz algebra is a derivation.
Non-classical negations may fail to be contradictory-forming operators in more than one way, and they often fail also to respect fundamental meta-logical properties such as the replacement property. Such drawbacks are witnessed by intricate…
Non-well-founded trees are used in mathematics and computer science, for modelling non-well-founded sets, as well as non-terminating processes or infinite data-structures. Categorically, they arise as final coalgebras for polynomial…
Using Galois representations attached to elliptic curves, we construct Galois extensions of $\mathbb{Q}$ with group $GL_2(p)$ in which all decomposition groups are cyclic. This is the first such realization for all primes $p$.
This paper is devoted to the study of local and 2-local derivations of nullfiliform, filiform and naturally graded quasi-filiform associative algebras. We prove that these algebras as a rule admit local derivations which are not…
Possibilistic logic, an extension of first-order logic, deals with uncertainty that can be estimated in terms of possibility and necessity measures. Syntactically, this means that a first-order formula is equipped with a possibility degree…