Related papers: Bilattice-Catastrophe Isomorphism for Four-Valued …
Predictions in an eternally inflating multiverse are meaningless unless we specify the probability measure. The scale-factor cutoff is perhaps the simplest and most successful measure which avoid catastrophic problems such as the youngness…
Convolution is a ubiquitous operation in mathematics and computing. The Kripke semantics for substructural and interval logics motivates its study for quantale-valued functions relative to ternary relations. The resulting notion of…
We extend the framework of abstract algebraic logic to weak logics, namely logical systems which are not necessarily closed under uniform substitution. We interpret weak logics by algebras expanded with an additional predicate and we…
In this paper, we study an extension of the stable model semantics for disjunctive logic programs where each true atom in a model is associated with an algebraic expression (in terms of rule labels) that represents its justifications. As in…
Optimal decentralized controller design is notoriously difficult, but recent research has identified large subclasses of such problems that may be convexified and thus are amenable to solution via efficient numerical methods. One recently…
This thesis investigates the central role of homomorphism problems (structure-preserving maps) in two complementary domains: database querying over finite, graph-shaped data, and constraint solving over (potentially infinite) structures.…
A topological bifurcation in chaotic scattering is characterized by a sudden change in the topology of the infinite set of unstable periodic orbits embedded in the underlying chaotic invariant set. We uncover a scaling law for the fractal…
This paper studies properties of the logic BV, which is an extension of multiplicative linear logic (MLL) with a self-dual non-commutative operator. BV is presented in the calculus of structures, a proof theoretic formalism that supports…
We propose a doxastic \L ukasiewicz logic \textbf{B\L} that is sound and complete with respect to the class of Kripke-based models in which atomic propositions and accessibility relations are both infinitely valued in the standard…
We present an intuitive diagrammatic representation of a new class of integrable $\s$-models. It is shown that to any given diagram corresponds an integrable theory that couples $N$ WZW models with a certain number of each of the following…
Extending the work of Cuntz and Vershik, we develop a general notion of independence for commuting group endomorphisms. Based on this concept, we initiate the study of irreversible algebraic dynamical systems, which can be thought of as…
The aim of this paper is to combine several Ivlev-like modal systems characterized by 4-valued non-deterministic matrices (Nmatrices) with IDM4, a 4-valued expansion of Belnap-Dunn's logic FDE with an implication introduced by Pynko in…
Clifford algebras are naturally associated with quadratic forms. These algebras are Z_2-graded by construction. However, only a Z_n-gradation induced by a choice of a basis, or even better, by a Chevalley vector space isomorphism Cl(V) <->…
We report fundamental insights into how agentic graph reasoning systems spontaneously evolve toward a critical state that sustains continuous semantic discovery. By rigorously analyzing structural (Von Neumann graph entropy) and semantic…
Starting from the hypothesis that both physics, in particular space-time and the physical vacuum, and the corresponding mathematics are discrete on the Planck scale we develop a certain framework in form of a '{\it cellular network}'…
Partial dynamical systems (X,alpha) arise naturally when dealing with commutative C*-dynamical system (A,delta). We associate with every pair (X,alpha), or (A,delta), a covariance C*-algebra C*(X,alpha)=C*(A,delta) which agrees with a…
Computability logic (CL) is a systematic formal theory of computational tasks and resources, which, in a sense, can be seen as a semantics-based alternative to (the syntactically introduced) linear logic. With its expressive and flexible…
Cause-consequence Diagram (CCD) is widely used as a deductive safety analysis technique for decision-making at the critical-system design stage. This approach models the causes of subsystem failures in a highly-critical system and their…
This Paper investigate sequent calculi for certain weak subintuitionistic logics. We establish that weakening and contraction are height-preserving admissible for each of these calculi, and we provide a syntactic proof for the admissibility…
The $\mathrm{Caus}[-]$ construction takes a base category of ``raw materials'' and builds a category of higher order causal processes, that is a category whose types encode causal (a.k.a. signalling) constraints between collections of…