Related papers: Upward confluence in the interaction calculus
The article considers systems of interacting particles on networks with adaptively coupled dynamics. Such processes appear frequently in natural processes and applications. Relying on the notion of graph convergence, we prove that for large…
Proof search in non-confluent tableau calculi, such as the connection tableau calculus, suffers from excess backtracking, but simple restrictions on backtracking are incomplete. We adopt constraint learning to reduce backtracking in the…
We investigate the new, Turing-complete class of layered systems, whose lefthand sides of rules can only be overlapped at a multiset of disjoint or equal positions. Layered systems define a natural notion of rank for terms: the maximal…
The categorical models of the differential lambda-calculus are additive categories because of the Leibniz rule which requires the summation of two expressions. This means that, as far as the differential lambda-calculus and differential…
Simple examples are constructed that show the entanglement of two qubits being both increased and decreased by interactions on just one of them. One of the two qubits interacts with a third qubit, a control, that is never entangled or…
The formal system lambda-delta is a typed lambda calculus that pursues the unification of terms, types, environments and contexts as the main goal. lambda-delta takes some features from the Automath-related lambda calculi and some from the…
A cluster expansion is proposed, that applies to both continuous and discrete systems. The assumption for its convergence involves an extension of the neat Kotecky-Preiss criterion. Expressions and estimates for correlation functions are…
Lambeks Syntactic Calculus, commonly referred to as the Lambek calculus, was innovative in many ways, notably as a precursor of linear logic. But it also showed that we could treat our grammatical framework as a logic (as opposed to a…
For the interacting urn model with polynomial reinforcement, it has been conjectured that almost surely one color monopolizes all the urns if the interaction parameter $p>0$. We disprove the conjecture. For the case $p=1$, we give a…
We develop and implement new probabilistic strategy for proving basic results about long time behaviour for interacting diffusion processes on unbounded lattice. The concept of the solution used is rather weak as we construct the process as…
Probabilistic operational semantics for a nondeterministic extension of pure lambda calculus is studied. In this semantics, a term evaluates to a (finite or infinite) distribution of values. Small-step and big-step semantics are both…
Recently researchers have been studying various conditions as swampland criteria in cosmological implications. They have studied many inflation models with different swampland conditions. Occasionally these conjectures are modified and lead…
We introduce two extensions of the $\lambda$-calculus with a probabilistic choice operator, $\Lambda_\oplus^{cbv}$ and $\Lambda_\oplus^{cbn}$, modeling respectively call-by-value and call-by-name probabilistic computation. We prove that…
In a recent paper [M. Colangeli \textit{et al.}, J.\ Stat.\ Mech.\ P04021, (2011)] it was argued that the Fluctuation Relation for the phase space contraction rate $\Lambda$ could suitably be extended to non-reversible dissipative systems.…
The superfluid properties of attractive Hubbard model in dice lattice are investigated. It is found that three superfluid order parameters increase as the interaction increases. When the filling factor falls into the flat band, due to the…
The step and impulse responses of a proper, rational transfer function are well-behaved analytic functions. We prove that such a response cannot have an inflection point such that the tangent at that point is parallel to the time-axis.…
We introduce refutationally complete superposition calculi for intentional and extensional clausal $\lambda$-free higher-order logic, two formalisms that allow partial application and applied variables. The calculi are parameterized by a…
Recently, by introducing the notion of cumulatively merged partition, M\'enard and Singh provide a sufficient condition on graphs ensuring that the critical value of the contact process is positive. In this note, we show that the…
Motivated by its connection to the limit behaviour of imprecise Markov chains, we introduce and study the so-called convergence of upper transition operators: the condition that for any function, the orbit resulting from iterated…
'Rich get richer' rule comforts previously often chosen actions. What is happening to the evolution of individual inclinations to choose an action when agents do interact ? Interaction tends to homogenize while each individual dynamics…