Related papers: On the expressive power of Lukasiewicz's square op…
Reversible Markov chains play a central role in stochastic modelling and in algorithms such as Markov chain Monte Carlo (MCMC). Motivated by the fundamental importance of reversibility in classical settings, this paper develops a…
We compare the expressiveness of two extensions of monadic second-order logic (MSO) over the class of finite structures. The first, counting monadic second-order logic (CMSO), extends MSO with first-order modulo-counting quantifiers,…
We show that descriptive complexity's result extends in High Order Logic to capture the expressivity of Turing Machine which have a finite number of alternation and whose time or space is bounded by a finite tower of exponential. Hence we…
This work develops some technology for accessing the loop expansion of the Kontsevich integral of a knot. The setting is an application of the LMO invariant to certain surgery presentations of knots by framed links in the solid torus. A…
In \cite{LC, LCMF}, it was introduced a logic (called \Six ) associated to a class of algebraic structures known as {\em involutive Stone algebras}. This class of algebras, denoted by \Sto , was considered by the first time in \cite{CS1} as…
Succinctness is a natural measure for comparing the strength of different logics. Intuitively, a logic L_1 is more succinct than another logic L_2 if all properties that can be expressed in L_2 can be expressed in L_1 by formulas of…
We define a square matrices, by which some stochastic local operations and classical communication (SLOCC) invariants can be obtained. The relation of SLOCC invariants and character polynomial of square matrix are given for three and four…
In this paper, we propose a doxastic extension $BL^+$ of Lukasiewicz logic which is sound and complete relative to the introduced corresponding semantics. Also, we equip our doxastic Lukasiewicz logic $BL^+$ with public announcement and…
We study multidimensional configurations (infinite words) and subshifts of low pattern complexity using tools of algebraic geometry. We express the configuration as a multivariate formal power series over integers and investigate the setup…
Non-classical generalizations of classical modal logic have been developed in the contexts of constructive mathematics and natural language semantics. In this paper, we discuss a general approach to the semantics of non-classical modal…
We develop a theory of nearby and vanishing cycles in the context of finite-coefficient Zariski-constructible sheaves over a non-archimedean field which is non-trivially valued, complete, algebraically closed, and of mixed characteristic or…
A theorem of Davis, Figiel, Johnson and Pe{\l}czy\'nski tells us that weakly-compact operators between Banach spaces factor through reflexive Banach spaces. The machinery underlying this result is that of the real interpolation method,…
Formulae of the Lambek calculus are constructed using three binary connectives, multiplication and two divisions. We extend it using a unary connective, positive Kleene iteration. For this new operation, following its natural…
From some observations on the linear differential operators occurring in the Lattice Green function of the d-dimensional face centred and simple cubic lattices, and on the linear differential operators occurring in the n-particle…
In Aristotelian logic, categorical propositions are divided in Universal Affirmative, Universal Negative, Particular Affirmative and Particular Negative. Possible relations between two of the mentioned type of propositions are encoded in…
We propose an explicit construction of the solution of a stationary stochastic recursion of the form $X\circ\theta=\phi(X)$ on a semi-ordered Polish space, when the monotonicity of $\phi$ is not assumed. This solution exists on an enriched…
In this paper, we consider a class of structured nonconvex nonsmooth optimization problems, in which the objective function is formed by the sum of a possibly nonsmooth nonconvex function and a differentiable function whose gradient is…
In this paper, we endow the space of continuous translation invariant valuation on convex sets generated by mixed volumes coupled with a suitable Radon measure on tuples of convex bodies with two appropriate norms. This enables us to…
We explore the problem of explaining observations in contexts involving statements with truth degrees such as `the lift is loaded', `the symptoms are severe', etc. To formalise these contexts, we consider infinitely-valued {\L}ukasiewicz…
Linear algebra algorithms often require some sort of iteration or recursion as is illustrated by standard algorithms for Gaussian elimination, matrix inversion, and transitive closure. A key characteristic shared by these algorithms is that…