Related papers: On Berry's conjectures about the stable order in P…
An \textit{abstract argumentation framework} ({\sc af} for short) is a directed graph $(A,R)$ where $A$ is a set of \textit{abstract arguments} and $R\subseteq A \times A$ is the \textit{attack} relation. Let $H=(A,R)$ be an {\sc af}, $S…
Social order cannot be considered as a stable phenomenon because it contains an order of reproduced expectations. When the expectations operate upon one another, they generate a non-linear dynamics that processes meaning. Specific meaning…
A decidability proof for bisimulation equivalence of first-order grammars (finite sets of labelled rules for rewriting roots of first-order terms) is presented. The equivalence generalizes the DPDA (deterministic pushdown automata)…
Various feature descriptions are being employed in logic programming languages and constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called features. The descriptions…
We introduce the abstract notion of a \emph{smoothable fine compactified Jacobian} of a nodal curve, and of a family of nodal curves whose general element is smooth. Then we introduce the notion of a combinatorial stability condition for…
We introduce notions of stationarily ordered types and theories; the latter generalizes weak o-minimality and the first is a relaxed version of weak o-minimality localized at the locus of a single type. We show that forking, as a binary…
We define an algebra $A$ to be centrally stable if, for every epimorhism $\varphi$ from $A$ to another algebra $B$, the center $Z(B)$ of $B$ is equal to $\varphi(Z(A))$, the image of the center of $A$. After providing some examples and…
A consistent perturbation theory expansion is presented for phase-ordering kinetics in the case of a nonconserved scalar order parameter. At zeroth order in this expansion one obtains the theory due to Ohta, Jasnow and Kawasaki (OJK). At…
The word stable is used to describe a situation when mathematical objects that almost satisfy an equation are close to objects satisfying it exactly. We study operator-algebraic forms of stability for unitary representations of groups and…
In this paper we reexamine the place and role of stable model semantics in logic programming and contrast it with a least Herbrand model approach to Horn programs. We demonstrate that inherent features of stable model semantics naturally…
We present Causal Posterior Estimation (CPE), a novel method for Bayesian inference in simulator models, i.e., models where the evaluation of the likelihood function is intractable or too computationally expensive, but where one can…
The phase diagram of a simple area-preserving map, which was motivated by the quantum dynamics of cold atoms, is explored analytically and numerically. Periodic orbits of a given winding ratio are found to exist within wedge-shaped regions…
We analyze the dynamics of a deterministic model of inhibitory neuronal networks proving that the discontinuities of the Poincare map produce a never empty chaotic set, while its continuity pieces produce stable orbits. We classify the…
In this paper, an attempt is made to understand the dynamics of a fractional order three species Leslie-Gower predator prey food chain model with simplified Holling type IV functional response by considering fractional derivative in Caputo…
The fixed-template constraint satisfaction problem (CSP) can be seen as the problem of deciding whether a given primitive positive first-order sentence is true in a fixed structure (also called model). We study a class of problems that…
Word puzzles and the problem of their representations in logic languages have received considerable attention in the last decade (Ponnuru et al. 2004; Shapiro 2011; Baral and Dzifcak 2012; Schwitter 2013). Of special interest is the problem…
It is well-known that extending the Hilbert axiomatic system for first-order intuitionistic logic with an exclusion operator, that is dual to implication, collapses the domains of models into a constant domain. This makes it an interesting…
Algebraic lambda-calculi have been studied in various ways, but their semantics remain mostly untouched. In this paper we propose a semantic analysis of a general simply-typed lambda-calculus endowed with a structure of vector space. We…
A grammar logic refers to an extension to the multi-modal logic K in which the modal axioms are generated from a formal grammar. We consider a proof theory, in nested sequent calculus, of grammar logics with converse, i.e., every modal…
We derive the semiclassical Bloch dynamics with the second-order Berry phase correction in the presence of the slow-varying scalar potential as perturbation. Our mathematical derivation is based on a two-scale WKB asymptotic analysis. For a…