Related papers: (Non-)well-founded derivations in the provability …
We consider fractional wave equations with exponential or arbitrary polynomial nonlinearities. We prove the global well-posedness on the support of the corresponding Gibbs measures. We provide ill-posedness constructions showing that the…
In this paper, we introduce a proof system $\mathsf{NQGL}$ for a Kripke complete predicate extension of the logic $\mathbf{GL}$, that is, the logic of provability, which is defned by $\mathbf{K}$ and the L\"{o}b formula $\Box(\Box p\supset…
Cyclic and non-wellfounded proofs are now increasingly employed to establish metalogical results in a variety of settings, in particular for type systems with forms of (co)induction. Under the Curry-Howard correspondence, a cyclic proof can…
This paper studies fundamental questions concerning category-theoretic models of induction and recursion. We are concerned with the relationship between well-founded and recursive coalgebras for an endofunctor. For monomorphism preserving…
Let $P$ be a partially ordered set, $R$ a commutative ring with identity and $FI(P,R)$ the finitary incidence algebra of $P$ over $R$. In this note we prove that each $R$-linear local derivation of $FI(P,R)$ is a derivation, which partially…
Belief Propagation (BP) is one of the most popular methods for inference in probabilistic graphical models. BP is guaranteed to return the correct answer for tree structures, but can be incorrect or non-convergent for loopy graphical…
Over the past two decades, several consistent procedures have been designed to infer causal conclusions from observational data. We prove that if the true causal network might be an arbitrary, linear Gaussian network or a discrete Bayes…
Generalized Probabilistic Logic (GPL) is a temporal logic, based on the modal mu-calculus, for specifying properties of reactive probabilistic systems. We explore XPL, an extension to GPL allowing the semantics of nondeterminism present in…
This paper investigates neighborhood and algebraic models for predicate modal logics with $\omega$-rules, including non-normal cases. We establish sufficient conditions under which such logics have neighborhood models with constant domains…
We present a sequent-style proof system for provability logic GL that admits so-called circular proofs. For these proofs, the graph underlying a proof is not a finite tree but is allowed to contain cycles. As an application, we establish…
We live in a world full of complex systems which we need to improve our understanding of. To accomplish this, purely probabilistic investigations are often not enough. They are only the first step and must be followed by learning the…
We investigate infinitary wellfounded systems for linear logic with fixed points, with transfinite branching rules indexed by some closure ordinal $\alpha$ for fixed points. Our main result is that provability in the system for some…
We study provability predicates $\mathrm{Pr}_T(x)$ satisfying the following condition $\mathbf{E}$ from a modal logical perspective: $\mathbf{E}:$ if $ T \vdash \varphi \leftrightarrow \psi$, then $T \vdash \mathrm{Pr}_T(\ulcorner \varphi…
In this paper, we study the generalized Douglas-Rachford algorithm and its cyclic variants which include many projection-type methods such as the classical Douglas-Rachford algorithm and the alternating projection algorithm. Specifically,…
We show that SCL(FOL) can simulate the derivation of non-redundant clauses by superposition for first-order logic without equality. Superposition-based reasoning is performed with respect to a fixed reduction ordering. The completeness…
We introduce separability properties corresponding to generalized versions of the conjugacy, twisted conjugacy, Brinkmann and Brinkmann's conjugacy problems and how they relate when finite and cyclic extensions of groups are taken. In…
Let $\phi\colon A\rightarrow B$ be an algebra extension. We prove that if $\phi$ is split, the derived-discreteness of $A$ implies the derived-discreteness of $B$; if $\phi$ is separable and the right $A$-module $B$ is projective, the…
We prove that the projective complex algebraic varieties admitting a large complex local system satisfy a strong version of the Green-Griffiths-Lang conjecture.
Description Logics (DLs) are used in knowledge-based systems to represent and reason about terminological knowledge of the application domain in a semantically well-defined manner. In this thesis, we establish a number of novel complexity…
We prove that every local derivation on a finite-dimensional semisimple Lie algebra over an algebraically closed field of characteristic zero is a derivation. We also give examples of finite-dimensional nilpotent Lie algebras $\mathcal{L}$…