We introduce the concept of o-asymptotic classes of finite structures, melding ideas coming from 1-dimensional asymptotic classes and o-minimality. Along with several examples and non-examples of these classes, we present some classification theory results of their infinite ultraproducts: Every infinite ultraproduct of structures in an o-asymptotic class is superrosy of U^þ-rank 1, and NTP2 (in fact, inp-minimal).

In this paper we consider classes of finite structures where we have good control over the sizes of the definable sets. The motivating example is the class of finite fields: it was shown in [1] that for any formulain the language of rings, there are finitely many pairs (d,μ) ∈ω×Q>0so that in any finite fieldFand for any ā ∈Fmthe size |ø(Fn,ā)| is “approximately”μ|F|d. Essentially this is a generalisation of the classical Lang-Weil estimates from the category of varieties to that (...) of the first-order-definable sets. (shrink)

Skolem studied the germs at infinity of the smallest class of real valued functions on the positive real line containing the constant $1$, the identity function ${\mathbf {x}}$, and such that whenever f and g are in the set, $f+g,fg$ and $f^g$ are in the set. This set of germs is well ordered and Skolem conjectured that its order type is epsilon-zero. Van den Dries and Levitz computed the order type of the fragment below $2^{2^{\mathbf {x}}}$. Here we prove that (...) the set of asymptotic classes within any Archimedean class of Skolem functions has order type $\omega $. As a consequence we obtain, for each positive integer n, an upper bound for the fragment below $2^{n^{\mathbf {x}}}$. We deduce an epsilon-zero upper bound for the fragment below $2^{{\mathbf {x}}^{\mathbf {x}}}$, improving the previous epsilon-omega bound by Levitz. A novel feature of our approach is the use of Conway’s surreal number for asymptotic calculations. (shrink)

In connection with the work of Anscombe, Macpherson, Steinhorn and the present author in [1] we investigate the notion of a multidimensional exact class (R-mec), a special kind of multidimensional asymptotic class (R-mac) with measuring functions that yield the exact sizes of definable sets, not just approximations. We use results about smooth approximation [24] and Lie coordinatization [13] to prove the following result (Theorem 4.6.4), as conjectured by Macpherson: For any countable language$\mathcal {L}$and any positive integerdthe class$\mathcal {C}(\mathcal {L},d)$of (...) all finite$\mathcal {L}$-structures with at mostd4-types is a polynomial exact class in$\mathcal {L}$, where a polynomial exact class is a multidimensional exact class with polynomial measuring functions. (shrink)

§1. Introduction. Asymptotic cones of metric spaces were first invented by Gromov. They are metric spaces which capture the ‘large-scale structure’ of the underlying metric space. Later, van den Dries and Wilkie gave a more general construction of asymptotic cones using ultrapowers. Certain facts about asymptotic cones, like the completeness of the metric space, now follow rather easily from saturation properties of ultrapowers, and in this survey, we want to present two applications of the van den Dries-Wilkie (...) approach. Using ultrapowers we obtain an explicit description of the asymptotic cone of a semisimple Lie group. From this description, using semi-algebraic groups and non-standard methods, we can give a short proof of the Margulis Conjecture. In a second application, we use set theory to answer a question of Gromov.§2. Definitions. The intuitive idea behind Gromov's concept of an asymptotic cone was to look at a given metric space from an ‘infinite distance’, so that large-scale patterns should become visible. In his original definition this was done by gradually scaling down the metric by factors 1/nfornϵ ℕ. In the approach by van den Dries and Wilkie, this idea was captured by ultrapowers. Their construction is more general in the sense that the asymptotic cone exists for any metric space, whereas in Gromov's original definition, the asymptotic cone existed only for a rather restricted class of spaces. (shrink)

We show that the 0-1 law does not hold for the class Σ 1 1 (∀∃∀ without =) by finding a sentence in this class which almost surely expresses parity. We also show that every recursive real in the unit interval is the asymptotic probability of a sentence in this class. This expands a result by Lidia Tendera, who in 1994 proved that every rational number in the unit interval is the asymptotic probability of a sentence in the (...) class Σ 1 1 ∀∃∀ with equality. (shrink)

We prove a 0-1 law for the fragment of second order logic SO over parametric classes of finite structures which allow only one unary atomic type. This completes the investigation of 0-1 laws for fragments of second order logic defined in terms of first order quantifier prefixes over, e.g., simple graphs and tournaments. We also prove a low oscillation law, and establish the 0-1 law for Σ14 without any restriction on the number of unary types.

We show that every definable subset of an uncountably categorical pseudofinite structure has pseudofinite cardinality which is polynomial (over the rationals) in the size of any strongly minimal subset, with the degree of the polynomial equal to the Morley rank of the subset. From this fact, we show that classes of finite structures whose ultraproducts all satisfy the same uncountably categorical theory are polynomial R-mecs as well as N-dimensional asymptotic classes, where N is the Morley rank of (...) the theory. (shrink)

In this paper we prove general exact unprovability results that show how a threshold between provability and unprovability of a finite well-quasi-orderedness assertion of a combinatorial class is transformed by the sequence-construction, multiset-construction, cycle-construction and labeled-tree-construction. Provability proofs use the asymptotic pigeonhole principle, unprovability proofs use Weiermann-style compression techniques and results from analytic combinatorics.

In this article we explore some properties of H-structures which are introduced in [2]. We describe a construction of H-structures based on one-dimensional asymptotic classes which preserves pseudofiniteness. That is, the H-structures we construct are ultraproducts of finite structures. We also prove that under the assumption that the base theory is supersimple of SU-rank one, there are no new definable groups in H-structures. This improves the corresponding result in [2].

For [Formula: see text], the coarse similarity class of A, denoted by [Formula: see text], is the set of all [Formula: see text] such that the symmetric difference of A and B has asymptotic density 0. There is a natural metric [Formula: see text] on the space [Formula: see text] of coarse similarity classes defined by letting [Formula: see text] be the upper density of the symmetric difference of A and B. We study the metric space of coarse (...) similarity classes under this metric, and show in particular that between any two distinct points in this space there are continuum many geodesic paths. We also study subspaces of the form [Formula: see text] where [Formula: see text] is closed under Turing equivalence, and show that there is a tight connection between topological properties of such a space and computability-theoretic properties of [Formula: see text]. We then define a distance between Turing degrees based on Hausdorff distance in the metric space [Formula: see text]. We adapt a proof of Monin to show that the Hausdorff distances between Turing degrees that occur are exactly 0, [Formula: see text], and 1, and study which of these values occur most frequently in the senses of Lebesgue measure and Baire category. We define a degree a to be attractive if the class of all degrees at distance [Formula: see text] from a has measure 1, and dispersive otherwise. In particular, we study the distribution of attractive and dispersive degrees. We also study some properties of the metric space of Turing degrees under this Hausdorff distance, in particular the question of which countable metric spaces are isometrically embeddable in it, giving a graph-theoretic sufficient condition for embeddability. Motivated by a couple of issues arising in the above work, we also study the computability-theoretic and reverse-mathematical aspects of a Ramsey-theoretic theorem due to Mycielski, which in particular implies that there is a perfect set whose elements are mutually 1-random, as well as a perfect set whose elements are mutually 1-generic. Finally, we study the completeness of [Formula: see text] from the perspectives of computability theory and reverse mathematics. (shrink)

We introduce a new class of population games called stable games. These games are characterized by self-defeating externalities: when agents revise their strategies, the improvements in the payoffs of strategies to which revising players are switching are always exceeded by the improvements in the payoffs of strategies which revising players are abandoning. We show that stable games subsume many well-known classes of examples, including zero-sum games, games with an interior ESS, wars of attrition, and concave potential games. We prove (...) that the set of Nash equilibria of any stable game is convex, and offer an elementary proof of existence of equilibrium. Finally, we show that the set of Nash equilibria of a stable game is globally asymptotically stable under a variety of evolutionary dynamics. These convergence results are proved by constructing Lyapunov functions defined in terms of revision potentials—that is, potential functions for the protocols agents follow when they consider switching strategies. (shrink)

We study H-structures associated with $SU$ -rank 1 measurable structures. We prove that the $SU$ -rank of the expansion is continuous and that it is uniformly definable in terms of the parameters of the formulas. We also introduce notions of dimension and measure for definable sets in the expansion and prove they are uniformly definable in terms of the parameters of the formulas.

A broad class of inductive logics that includes the probability calculus is defined by the conditions that the inductive strengths [A|B] are defined fully in terms of deductive relations in preferred partitions and that they are asymptotically stable. Inductive independence is shown to be generic for propositions in such logics; a notion of a scale-free inductive logic is identified; and a limit theorem is derived. If the presence of preferred partitions is not presumed, no inductive logic is definable. This no-go (...) result precludes many possible inductive logics, including versions of hypothetico-deductivism. (shrink)

Normal forms for wide classes of closed IL formulas were given in Čačić and Vuković. Here we quantify asymptotically, in exact numbers, how wide those classes are. As a consequence, we show that the “majority” of closed IL formulas have GL-equivalents, and by that, they have the same normal forms as GL formulas. Our approach is entirely syntactical, except for applying the results of Čačić and Vuković. As a byproduct we devise a convenient way of computing asymptotic (...) behaviors of somewhat general classes of formulas given by their grammar rules. Its applications do not require any knowledge of the recurrence relations, generating functions, or the asymptotic enumeration methods, as all these are incorporated into two fundamental parameters. (shrink)

We investigate the stability of mixed strategy equilibria in 2 person (bimatrix) games under perturbed best response dynamics. A mixed equilibrium is asymptotically stable under all such dynamics if and only if the game is linearly equivalent to a zero sum game. In this case, the mixed equilibrium is also globally asymptotically stable. Global convergence to the set of perturbed equilibria is shown also for (rescaled) partnership games, also known as potential games. Lastly, mixed equilibria of partnership games are shown (...) to be always unstable under all dynamics of this class. (shrink)

Different directed acyclic graphs may be Markov equivalent in the sense that they entail the same conditional independence relations among the observed variables. Chickering provided a transformational characterization of Markov equivalence for DAGs, which is useful in deriving properties shared by Markov equivalent DAGs, and, with certain generalization, is needed to prove the asymptotic correctness of a search procedure over Markov equivalence classes, known as the GES algorithm. For DAG models with latent variables, maximal ancestral graphs provide a (...) neat representation that facilitates model search. However, no transformational characterization -- analogous to Chickering's -- of Markov equivalent MAGs is yet available. This paper establishes such a characterization for directed MAGs, which we expect will have similar uses as it does for DAGs. (shrink)

In General Relativity in Hamiltonian form, change has seemed to be missing, defined only asymptotically, or otherwise obscured at best, because the Hamiltonian is a sum of first-class constraints and a boundary term and thus supposedly generates gauge transformations. Attention to the gauge generator G of Rosenfeld, Anderson, Bergmann, Castellani et al., a specially _tuned sum_ of first-class constraints, facilitates seeing that a solitary first-class constraint in fact generates not a gauge transformation, but a bad physical change in electromagnetism or (...) General Relativity. The change spoils the Lagrangian constraints, Gauss's law or the Gauss-Codazzi relations describing embedding of space into space-time, in terms of the physically relevant velocities rather than auxiliary canonical momenta. But the resemblance between the gauge generator G and the Hamiltonian H leaves still unclear where objective change is in GR. Insistence on Hamiltonian-Lagrangian equivalence, a theme emphasized by Castellani, Sugano, Pons, Salisbury, Shepley and Sundermeyer among others, holds the key. Taking objective change to be ineliminable time dependence, one recalls that there is change in vacuum GR just in case there is no time-like vector field xi^a satisfying Killing's equation L_xi g_mn=0, because then there exists no coordinate system such that everything is independent of time. Throwing away the spatial dependence of GR for convenience, one finds explicitly that the time evolution from Hamilton's equations is real change just when there is no time-like Killing vector. The inclusion of a massive scalar field is simple. No obstruction is expected in including spatial dependence and coupling more general matter fields. Hence change is real and local even in the Hamiltonian formalism. The considerations here resolve the Earman-Maudlin standoff over change in Hamiltonian General Relativity: the Hamiltonian formalism is helpful, and, suitably reformed, it does not have absurd consequences for change and observables. Hence the classical problem of time is resolved. The Lagrangian-equivalent Hamiltonian analysis of change in General Relativity is compared to Belot and Earman's treatment. The more serious quantum problem of time, however, is not automatically resolved due to issues of quantum constraint imposition. (shrink)

We study a low-rationality learning dynamics called probe and adjust. Our emphasis is on its properties in games of information transfer such as the Lewis signaling game or the Bala-Goyal network game. These games fall into the class of weakly better reply games, in which, starting from any action profile, there is a weakly better reply path to a strict Nash equilibrium. We prove that probe and adjust will be close to strict Nash equilibria in this class of games with (...) arbitrarily high probability. In addition, we compare these asymptotic properties to short-run behavior. (shrink)

For a free filter F on $$\omega$$ ω, endow the space $$N_F=\omega \cup \{p_F\}$$ N F = ω ∪ { p F }, where $$p_F\not \in \omega$$ p F ∉ ω, with the topology in which every element of $$\omega$$ ω is isolated whereas all open neighborhoods of $$p_F$$ p F are of the form $$A\cup \{p_F\}$$ A ∪ { p F } for $$A\in F$$ A ∈ F. Spaces of the form $$N_F$$ N F constitute the (...) class of the simplest non-discrete Tychonoff spaces. The aim of this paper is to study them in the context of the celebrated Josefson–Nissenzweig theorem from Banach space theory. We prove, e.g., that, for a filter F, the space $$N_F$$ N F carries a sequence $$\langle \mu _n:n\in \omega \rangle$$ ⟨ μ n : n ∈ ω ⟩ of normalized finitely supported signed measures such that $$\mu _n(f)\rightarrow 0$$ μ n ( f ) → 0 for every bounded continuous real-valued function f on $$N_F$$ N F if and only if $$F^*\le _K{\mathcal {Z}}$$ F ∗ ≤ K Z, that is, the dual ideal $$F^*$$ F ∗ is Katětov below the asymptotic density ideal $${\mathcal {Z}}$$ Z. Consequently, we get that if $$F^*\le _K{\mathcal {Z}}$$ F ∗ ≤ K Z, then: (1) if X is a Tychonoff space and $$N_F$$ N F is homeomorphic to a subspace of X, then the space $$C_p^*(X)$$ C p ∗ ( X ) of bounded continuous real-valued functions on X contains a complemented copy of the space $$c_0$$ c 0 endowed with the pointwise topology, (2) if K is a compact Hausdorff space and $$N_F$$ N F is homeomorphic to a subspace of K, then the Banach space C(K) of continuous real-valued functions on K is not a Grothendieck space. The latter result generalizes the well-known fact stating that if a compact Hausdorff space K contains a non-trivial convergent sequence, then the space C(K) is not Grothendieck. (shrink)

We introduce a new framework for classifying logics on finite structures and studying their expressive power. This framework is based on the concept of almost everywhere equivalence of logics, that is to say, two logics having the same expressive power on a class of asymptotic measure 1. More precisely, if L, L ′ are two logics and μ is an asymptotic measure on finite structures, then $\scr{L}\equiv _{\text{a.e.}}\scr{L}^{\prime}(\mu)$ means that there is a class C of finite structures with (...) μ (C)=1 and such that L and L ′ define the same queries on C. We carry out a systematic investigation of $\equiv _{\text{a.e.}}$ with respect to the uniform measure and analyze the $\equiv _{\text{a.e.}}$ -equivalence classes of several logics that have been studied extensively in finite model theory. Moreover, we explore connections with descriptive complexity theory and examine the status of certain classical results of model theory in the context of this new framework. (shrink)

I examine the relationship between \\)-dimensional Poincaré metrics and d-dimensional conformal manifolds, from both mathematical and physical perspectives. The results have a bearing on several conceptual issues relating to asymptotic symmetries in general relativity and in gauge–gravity duality, as follows: I draw from the remarkable work by Fefferman and Graham on conformal geometry, in order to prove two propositions and a theorem that characterise which classes of diffeomorphisms qualify as gravity-invisible. I define natural notions of gravity-invisibility that apply (...) to the diffeomorphisms of Poincaré metrics in any dimension. I apply the notions of invisibility, developed in, to gauge–gravity dualities: which, roughly, relate Poincaré metrics in \ dimensions to QFTs in d dimensions. I contrast QFT-visible versus QFT-invisible diffeomorphisms: those gravity diffeomorphisms that can, respectively cannot, be seen from the QFT. The QFT-invisible diffeomorphisms are the ones which are relevant to the hole argument in Einstein spaces. The results on dualities are surprising, because the class of QFT-visible diffeomorphisms is larger than expected, and the class of QFT-invisible ones is smaller than expected, or usually believed, i.e. larger than the PBH diffeomorphisms in Imbimbo et al. :1129, 2000, Eq. 2.6). I also give a general derivation of the asymptotic conformal Killing equation, which has not appeared in the literature before. (shrink)

In General Relativity in Hamiltonian form, change has seemed to be missing, defined only asymptotically, or otherwise obscured at best, because the Hamiltonian is a sum of first-class constraints and a boundary term and thus supposedly generates gauge transformations. By construing change as essential time dependence, one can find change locally in vacuum GR in the Hamiltonian formulation just where it should be. But what if spinors are present? This paper is motivated by the tendency in space-time philosophy tends to (...) slight fermionic/spinorial matter, the tendency in Hamiltonian GR to misplace changes of time coordinate, and the tendency in treatments of the Einstein-Dirac equation to include a gratuitous local Lorentz gauge symmetry along with the physically significant coordinate freedom. Spatial dependence is dropped in most of the paper, both restricting the physical situation and largely fixing the spatial coordinates. In the interest of including all and only the coordinate freedom, the Einstein-Dirac equation is investigated using the Schwinger time gauge and Kibble-Deser symmetric triad condition are employed as a \ version of the DeWitt-Ogievetsky-Polubarinov nonlinear group realization formalism that dispenses with a tetrad and local Lorentz gauge freedom. Change is the lack of a time-like stronger-than-Killing field for which the Lie derivative of the metric-spinor complex vanishes. An appropriate \-friendly form of the Rosenfeld-Anderson-Bergmann-Castellani gauge generator G, a tuned sum of first class-constraints, is shown to change the canonical Lagrangian by a total derivative, implying the preservation of Hamilton’s equations. Given the essential presence of second-class constraints with spinors and their lack of resemblance to a gauge theory, it is useful to have an explicit physically interesting example. This gauge generator implements changes of time coordinate for solutions of the equations of motion, showing that the gauge generator makes sense even with spinors. (shrink)

Within a state-space approach endowed with a generalized potential function, mental states can be systematically characterized by their stability against perturbations. This approach yields three major classes of states: (1) asymptotically stable categorial states, (2) marginally stable non-categorial states and (3) unstable acategorial states. The particularly interesting case of states giving rise to exceptional experiences will be elucidated in detail. Their proper classification will be related to Metzinger’s account of self-model and world-model, and empirical support for this classification will (...) be surveyed. Eventually, it will be outlined how Metzinger’s discussion of intentionality achieves pronounced significance within a dual-aspect framework of thinking. (shrink)

A fuzzy predictive fault-tolerant control scheme is proposed for a wide class of discrete-time nonlinear systems with uncertainties, interval time-varying delays, and partial actuator failures as well as unknown disturbances, in which the main opinions focus on the relevant theory of FPFTC based on Takagi-Sugeno fuzzy model description of these systems. The T-S fuzzy model represents the discrete-time nonlinear system in the form of the discrete uncertain time-varying delay state space, which is firstly constructed by a set of local linear (...) models and the nonlinear membership functions. The novel improved state space model can be further obtained by extending the output tracking error to the constructed model. Then the fuzzy predictive fault-tolerant control law based on this extended model is designed, which can increase more control degrees of freedom. Utilizing Lyapunov-Krasovskill theory, less conservative delay-range-dependent stable conditions in terms of linear matrix inequality constraints are given to ensure the asymptotically robust stability of closed-loop system. Meanwhile, the optimized cost function and H-infinity performance index are introduced to the stable conditions to guarantee the robust performance and antidisturbance capability. The simulation results on the temperature control of a strong nonlinear continuous stirred tank reactor show that the proposed control scheme is feasible and effective. (shrink)

Doubly robust (DR) estimators are an important class of statistics derived from a theory of semiparametric efficiency. They have become a popular tool in causal inference, including applications to dynamic treatment regimes. The doubly robust estimators for the mean response to a dynamic treatment regime may be conceived through the augmented inverse probability weighted (AIPW) estimating function, defined as the sum of the inverse probability weighted (IPW) estimating function and an augmentation term. The IPW estimating function of the causal estimand (...) via marginal structural model is defined as the complete-case score function for those subjects whose treatment sequence is consistent with the dynamic regime in question divided by the probability of observing the treatment sequence given the subject's treatment and covariate histories. The augmentation term is derived by projecting the IPW estimating function onto the nuisance tangent space and has mean-zero under the truth. The IPW estimator of the causal estimand is consistent if (i) the treatment assignment mechanism is correctly modeled and the AIPW estimator is consistent if either (i) is true or (ii) nested functions of intermediate and final outcomes are correctly modeled.Hence, the AIPW estimator is doubly robust and, moreover, the AIPW is semiparametric efficient if both (i) and (ii) are true simultaneously. Unfortunately, DR estimators can be inferior when either (i) or (ii) is true and the other false. In this case, the misspecified parts of the model can have a detrimental effect on the variance of the DR estimator. We propose an improved DR estimator of causal estimand in dynamic treatment regimes through a technique originally developed by [4] which aims to mitigate the ill-effects of model misspecification through a constrained optimization.In addition to solving a doubly robust system of equations, the improved DR estimator simultaneously minimizes the asymptotic variance of the estimator under a correctly specified treatment assignment mechanism but misspecification of intermediate and final outcome models. We illustrate the desirable operating characteristics of the estimator through Monte Carlo studies and apply the methods to data from a randomized study of integrilin therapy for patients undergoing coronary stent implantation. The methods proposed here are new and may be used to further improve personalized medicine, in general. (shrink)

The purpose of this paper is modelling and controlling the spread of COVID-19 disease in Morocco. A nonlinear mathematical model with two subclasses of infectious individuals is proposed. The population is divided into five classes, namely, susceptible, exposed, undiagnosed infectious, diagnosed patients, and removed individuals. To reflect the real dynamic of the COVID-19 transmission in Morocco, the real reported data are used for estimating model parameters. Two controls representing screening effort and limited treatment are considered. Based on viability theory (...) and set-valued analysis, a Lyapunov function is constructed such that both exposed and infected populations are decreased to zero asymptotically. The corresponding controls are derived via a continuous selection of adequately designed feedback map. Numerical simulations are presented with three scenarios. Our results show that when only one control is to be applied, screening is the most effective in decreasing the number of people in the three infected compartments, whereas combining both controls is found to be highly effective and leads to a significant improvement in the epidemiological situation of Morocco. To the best of our knowledge, this work is the first one that applies the set-valued approach to a controlled COVID-19 model which agrees with the observed cases in Morocco. (shrink)

Standard adaptive control is the preferred approach for stabilization and synchronization of chaotic systems when the structure of such systems is a priori known but the parameters are unknown. However, in the presence of unmodeled dynamics and/or disturbance, this approach is not effective anymore due to the drift of the parameter estimations, which eventually causes the instability of the closed-loop system. In this paper, a robustifying term, which consists of a saturation function, is used to avoid this problem. The robustifying (...) term is added to the adaptive control law. Consequently, the learning law is also modified. The boundedness of the states and the parameter estimations is rigorously and thoroughly proven by means of Lyapunov like analysis based on Barbalat’s lemma. On these new conditions, the convergence to zero cannot be achieved due to the presence of unmodeled dynamics and/or disturbance. However, it is still possible to guarantee the asymptotic convergence to a bounded zone around zero. The width of this zone can be adjusted by the designer. The performance of this robust approach is verified by numerical simulations. Although, for simplicity, this strategy is only applied to the stabilization and synchronization of Zhang system, the procedure can easily be generalized to a broad class of chaotic systems. (shrink)

argumentation has proven to be a versatile tool to model and analyze various problems in an argumentative setting. The addition of collective attacks syntactically extends Dung’s original argumentation frameworks (AFs), while retaining the most desirable properties—the resulting class of frameworks is called SETAFs. While most reasoning tasks in the realm of abstract argumentation have been shown to be intractable, real-world instances oftentimes are not entirely random but admit a certain structure that allows for efficient computational shortcuts. In certain cases, we (...) can characterize this structure via an integer parameter, and exploit these insights with advanced algorithmic techniques. A thorough analysis of the computational aspects of SETAFs w.r.t. parameterized algorithms has not yet been conducted. We start the investigation of these approaches by applying the backdoor and treewidth approaches to SETAFs. A backdoor is a part of a problem instance, such that removing the backdoor leads to a simple structure. If we can find such a backdoor and guess the solution on this part (respectively, extensions), the rest of the solution follows almost effortlessly. Similarly, the treewidth of a problem instance is a parameter that characterizes the properties of the instance’s graph structure. Intuitively, the lower the treewidth of a graph, the more “tree-like” it is. Since most argumentation problems become easy on trees, one can exploit low treewidth for efficient algorithms. In this paper, we establish that for SETAFs with constant backdoor sizes general argumentation tasks become efficiently solvable—they are fixed-parameter tractable. We generalize the respective techniques that are known for the special case of Dung-style AFs and show that they also apply to the more general case of SETAFs. In addition, we can show an improvement in the asymptotic runtime compared to earlier approaches for AFs via two-valued guesses instead of the state-of-the-art three-valued approach. Along the way, we point out similarities and interesting situations arising from the more general setting. While treewidth is well-studied in the context of AFs with their graph structure, it cannot be directly applied to the (directed) hypergraphs representing SETAFs. We thus introduce two generalizations of treewidth based on different graphs that can be associated with SETAFs, that is, the primal graph and the incidence graph. We show that while some of these notions allow for parameterized tractability results, reasoning remains intractable for other notions, even if we fix the parameter to a small constant. We present parameterized algorithms for efficient reasoning on SETAFs via tree decompositions by characterizing extensions not only by labeling the arguments, but also by assigning (temporary) labels to the attacks. (shrink)

Cognition in living entities—and their social groupings or institutional artifacts—is necessarily as complicated as their embedding environments, which, for humans, includes a particularly rich cultural milieu. The asymptotic limit theorems of information and control theories permit construction of a new class of empirical ‘regression-like’ statistical models for cognitive developmental processes, their dynamics, and modes of dysfunction. Such models may, as have their simpler analogs, prove useful in the study and re-mediation of cognitive failure at and across the scales and (...) levels of organization that constitute and drive the phenomena of life. These new models particularly focus on the roles of sociocultural environment and stress, in a large sense, as both trigger for the failure of the regulation of bio-cognition and as ‘riverbanks’ determining the channels of pathology, with implications across life-course developmental trajectories. We examine the effects of an embedding cultural milieu and its socioeconomic implementations using the ‘lenses’ of metabolic optimization, control system theory, and an extension of symmetry-breaking appropriate to information systems. A central implication is that most, if not all, human developmental disorders are fundamentally culture-bound syndromes. This has deep implications for both individual treatment and public health policy. (shrink)

The output feedback controller is designed for a class of stochastic nonlinear systems that satisfy uncertain function growth conditions for the first time. The multivariate function growth condition has greatly relaxed the restrictions on the drift and diffusion terms in the original stochastic nonlinear system. Here, we cleverly handle the problem of uncertain functions in the scaling process through the function maxima theory so that the Ito differential system can achieve output stabilization through Lyapunov function design and the solution of (...) stochastic nonlinear system objects satisfies the existence of uniqueness, ensuring that the system is globally asymptotically stable in the sense of probability. Furthermore, it is concluded that the system is inversely optimally stable in the sense of probability. Finally, we apply the theoretical results to the practical subsea intelligent electroexecution robot control system and obtain good results. (shrink)

Following up on previous results by Falmagne, this paper investigates possible mechanisms explaining how preference relations are created and how they evolve over time. We postulate a preference relation which is initially empty and becomes increasingly intricate under the influence of a random environment delivering discrete tokens of information concerning the alternatives. The framework is that of a class of real-time stochastic processes having interlinked Markov and Poisson components. Specifically, the occurence of the tokens is governed by a Poisson process, (...) while the succession of preference relations is a Markov process. In an example case, the preference relations are the various possible semiorders on the set of alternatives. Asymptotic results are obtained in the form of the limit probabilities of any semiorder. The arguments extend to a much more general situation including interval orders, biorders and partial orders. The results provide (up to a small number of parameters) complete quantitative predictions for panel data of a standard type, in which the same sample of subjects has been asked to compare the alternatives a number of times. (shrink)

A simple proof of a weak version of Eliezer's theorem on unphysical solutions of the Lorentz-Dirac equation is given. This version concerns a free particle scattered by a spatially localized electric field in one space dimension. (The solutions are also solutions in three space dimensions.) It establishes that for certain physically reasonable localized fields, all solutions which are free (i.e., unaccelerated) before they enter the field have unbounded proper acceleration and velocity asymptotic to that of light in the future. (...) For any given initial velocity, the fields yielding this unphysical behavior can be arbitrarily weak. The result is then extended to a class of static fields which need not be spatially localized, including Coulomb fields. For this case the same conclusion is obtained omitting the assumption that the particle be free in the past.The rest of the paper discusses solutions to the localized field problem which are assumed free in the future rather than the past. Some strange features of these solutions are noted. The possibility of experimentally detecting deviations from the Coulomb law for a particle obeying the Lorentz-Dirac equation is discussed. (shrink)

In this work we study the behavior of a time discrete multiregional stochastic model for a population structured in age classes and spread out in different spatial patches between which individuals can migrate. The dynamics of the population is controlled both by reproduction-survival and by migration. These processes take place at different time scales in the sense of the latter being much faster than the former. We incorporate the effect of demographic stochasticity into the population, which results in both (...) dynamics being modelled by multitype Bienaymé–Galton–Watson branching processes. We present a multitype global model that incorporates the effect of both processes and, making use of the existence of different time scales for demography and migration, build a reduced model in which the variables correspond to the total population in each age class. We extend previous results that relate the behavior of the original and the reduced model showing that, given a large enough separation of time scales between demography and migration, we can obtain information about the behavior of the multitype global model through the study of the simpler reduced model. We concentrate on the case where the two systems are supercritical and therefore the expected number of individuals grows to infinity, and show that we can approximate the asymptotic structure of the population vector and the asymptotic population size of the original system through the study of the reduced model. (shrink)

This manuscript considers the transmission dynamics of lymphatic filariasis with some intervention strategies in place. Unlike previously developed models, our model takes into account both the exposed and infected classes in both the human and mosquito populations, respectively. We also consider vaccinated, treated and recovered humans in the presented model. The global dynamics of the proposed model are completely determined by the basic ( $${\mathcal {R}}_0$$ ) and effective reproduction numbers ( $${\mathcal {R}}_e$$ ). We then use Lyapunov function (...) theory to find the sufficient conditions for global stability of both the disease-free equilibrium and endemic equilibrium. The Lyapunov functions show that when the basic reproduction number is less than or equal to unity, the disease-free equilibrium is globally asymptotically stable, and when it is greater than unity then the endemic equilibrium is also globally asymptotically stable. Finally, numerical simulations are carried out to investigate the effects of the intervention strategies and key parameters to the spread of lymphatic filariasis. The numerical simulations support the analytical results and illustrate possible model behavioral scenarios. (shrink)

We propose an original use of techniques from random graph theory to find a Monadic ∑ 1 1 sentence without an asymptotic probability. Our result implies that the 0-1 law fails for the logics ∑ 1 1 and ∑ 1 1 . Therefore we complete the classification of first-order prefix classes with or without equality, according to the existence of the 0-1 law for the corresponding ∑ 1 1 fragment. In addition, our counterexample can be viewed as a (...) single explanation of the failure of the 0-1 law of all the fragments of existential second-order logic for which the failure is already known. (shrink)

In this work we deal with a general class of spatially distributed periodic SIS epidemic models with two time scales. We let susceptible and infected individuals migrate between patches with periodic time dependent migration rates. The existence of two time scales in the system allows to describe certain features of the asymptotic behavior of its solutions with the help of a less dimensional, aggregated, system. We derive global reproduction numbers governing the general spatially distributed nonautonomous system through the aggregated (...) system. We apply this result when the mass action law and the frequency dependent transmission law are considered. Comparing these global reproductive numbers to their non spatially distributed counterparts yields the following: adequate periodic migration rates allow global persistence or eradication of epidemics where locally, in absence of migrations, the contrary is expected. (shrink)

We will show that almost all nonassociative relation algebras are symmetric and integral (in the sense that the fraction of both labelled and unlabelled structures that are symmetric and integral tends to $1$ ), and using a Fraïssé limit, we will establish that the classes of all atom structures of nonassociative relation algebras and relation algebras both have $0$ – $1$ laws. As a consequence, we obtain improved asymptotic formulas for the numbers of these structures and broaden some (...) known probabilistic results on relation algebras. (shrink)

Starting from a unitary, Lorentz invariant two-particle scattering amplitude, we show how to use an identification and replacement process to construct a unique, unitary particle–antiparticle amplitude. This process differs from conventional on-shell Mandelstam s, t, u crossing in that the input and constructed amplitudes can be off-diagonal and off-energy shell. Further, amplitudes are constructed using the invariant parameters which are appropriate to use as driving terms in the multi-particle, multichannel non-perturbative, cluster decomposable, relativistic scattering equations of the Faddeev-type integral equations (...) recently presented by Alfred, Kwizera, Lindesay and Noyes. It is therefore anticipated that when so employed, the resulting multi-channel solutions will also be unitary. The process preserves the usual particle–antiparticle symmetries. To illustrate this process, we construct a J=0 scattering length model chosen for simplicity. We also exhibit a class of physical models which contain a finite quantum mass parameter and are Lorentz invariant. These are constructed to reduce in the appropriate limits, and with the proper choice of value and sign of the interaction parameter, to the asymptotic solution of the non-relativistic Coulomb problem, including the forward scattering singularity, the essential singularity in the phase, and the Bohr bound-state spectrum. (shrink)

Ash's functions Nσ ,k count the number of k -equivalence classes of σ -structures of size n . Some conditions on their asymptotic behavior imply the long standing spectrum conjecture. We present a new condition which is equivalent to this conjecture and we discriminate some easy and difficult particular cases.

This paper addresses the robust stabilization problem for a class of stochastic Markovian jump systems with distributed delays. The systems under consideration involve Brownian motion, Markov chains, distributed delays, and parameter uncertainties. By an appropriate Lyapunov–Krasovskii functional, the novel delay-dependent stabilization criterion for the stochastic Markovian jump systems is derived in terms of linear matrix inequalities. When given linear matrix inequalities are feasible, an explicit expression of the desired state feedback controller is given. The designed controller, based on the obtained (...) criterion, ensures asymptotically stable in the mean square sense of the resulting closed-loop system. The convenience of the design is greatly enhanced due to the existence of an adjustable parameter in the controller. Finally, a numerical example is exploited to demonstrate the effectiveness of the developed theory. (shrink)

The category of coherent phase spaces introduced by the author is a refinement of the symplectic “category” of A. Weinstein. This category is *-autonomous and thus provides a denotational model for Multiplicative Linear Logic. Coherent phase spaces are symplectic manifolds equipped with a certain extra structure of “coherence”. They may be thought of as “infinitesimal” analogues of familiar coherent spaces of Linear Logic. The role of cliques is played by Lagrangian submanifolds of ambient spaces. Physically, a symplectic manifold is the (...) phase space of a classical dynamical system, and a Lagrangian submanifold is a phase of a short-wave oscillation. Typically, Lagrangian submanifolds represent such objects as short-wave approximations of wave functions in asymptotic quantization and wave fronts in geometrical optics. The coherent phase space semantics was motivated to a large extent by methods of geometric and asymptotic quantization and suggests some interesting intuitions on Linear Logic. In particular Lagrangian submanifold-cliques of types A and A can be interpreted as semiclassical limits of eigenstates of respectively position and momentum observables. These observables being canonically conjugate cannot be measured simultaneously, which corresponds to the idea that a formula A and its negation A cannot both simultaneously have proofs . We show that the coherent phase space semantics of Linear Logic enjoys several completeness properties in general much stronger than the usual full completeness with respect to the class of dinatural transformations. These properties of completeness in conjunction with a quite natural -physical meaning make the coherent phase space semantics an interesting object of investigation. (shrink)

Let φ be a monadic second order sentence about a finite structure from a class K which is closed under disjoint unions and has components. Compton has conjectured that if the number of n element structures has appropriate asymptotics, then unlabelled (labelled) asymptotic probabilities ν(φ) (μ(φ) respectively) for φ always exist. By applying generating series methods to count finite models, and a tailor made Tauberian lemma, this conjecture is proved under a mild additional condition on the asymptotics of the (...) number of single component K-structures. Prominent among examples covered, are structures consisting of a single unary function (or partial function) and a fixed number of unary predicates. (shrink)

For a free filter F on $$\omega$$, let $$N_F=\omega \cup \{p_F\}$$, where $$p_F\not \in \omega$$, be equipped with the following topology: every element of $$\omega$$ is isolated whereas all open neighborhoods of $$p_F$$ are of the form $$A\cup \{p_F\}$$ for $$A\in F$$. The aim of this paper is to study spaces of the form $$N_F$$ in the context of the Nikodym property of Boolean algebras. By $$\mathcal{A}\mathcal{N}$$ we denote the class of all those ideals $$\mathcal {I}$$ on (...) $$\omega$$ such that for the dual filter $$\mathcal {I}^*$$ the space $$N_{\mathcal {I}^*}$$ carries a sequence $$\langle \mu _n:n\in \omega \rangle$$ of finitely supported signed measures such that $$\Vert \mu _n\Vert \rightarrow \infty$$ and $$\mu _n(A)\rightarrow 0$$ for every clopen subset $$A\subseteq N_{\mathcal {I}^*}$$. We prove that $$\mathcal {I}\in \mathcal{A}\mathcal{N}$$ if and only if there exists a density submeasure $$\varphi$$ on $$\omega$$ such that $$\varphi (\omega )=\infty$$ and $$\mathcal {I}$$ is contained in the exhaustive ideal $$\text{ Exh }(\varphi )$$. Consequently, we get that if $$\mathcal {I}\subseteq \text{ Exh }(\varphi )$$ for some density submeasure $$\varphi$$ on $$\omega$$ such that $$\varphi (\omega )=\infty$$ and $$N_{\mathcal {I}^*}$$ is homeomorphic to a subspace of the Stone space $$St(\mathcal {A})$$ of a given Boolean algebra $$\mathcal {A}$$, then $$\mathcal {A}$$ does not have the Nikodym property. We observe that each $$\mathcal {I}\in \mathcal{A}\mathcal{N}$$ is Katětov below the asymptotic density zero ideal $$\mathcal {Z}$$, and prove that the class $$\mathcal{A}\mathcal{N}$$ has a subset of size $$\mathfrak {d}$$ which is dominating with respect to the Katětov order $$\le _K$$, but $$\mathcal{A}\mathcal{N}$$ has no $$\le _K$$ -maximal element. We show that, when $$\mathcal {I}$$ is a density ideal, $$\mathcal {I}\not \in \mathcal{A}\mathcal{N}$$ holds if and only if $$\mathcal {I}$$ is totally bounded if and only if the Boolean algebra $$\mathcal {P}(\omega )/\mathcal {I}$$ contains a countable splitting family. Our results shed some new light on differences between the Nikodym property and the Grothendieck property of Boolean algebras. (shrink)

The aim of this paper is to shed light on our understanding of large scale properties of infinite strings. We say that one string $\alpha $ has weaker large scale geometry than that of $\beta $ if there is color preserving bi-Lipschitz map from $\alpha $ into $\beta $ with small distortion. This definition allows us to define a partially ordered set of large scale geometries on the classes of all infinite strings. This partial order compares large scale geometries (...) of infinite strings. As such, it presents an algebraic tool for classification of global patterns. We study properties of this partial order. We prove, for instance, that this partial order has a greatest element and also possess infinite chains and antichains. We also investigate the sets of large scale geometries of strings accepted by finite state machines such as Büchi automata. We provide an algorithm that describes large scale geometries of strings accepted by Büchi automata. This connects the work with the complexity theory. We also prove that the quasi-isometry problem is a $\Sigma _2^0$ -complete set, thus providing a bridge with computability theory. Finally, we build algebraic structures that are invariants of large scale geometries. We invoke asymptotic cones, a key concept in geometric group theory, defined via model-theoretic notion of ultra-product. Partly, we study asymptotic cones of algorithmically random strings, thus connecting the topic with algorithmic randomness. (shrink)

Logarithmic ambiguities in the choice of asymptotically Cartesian coordinates at spatial infinity are discussed. It is shown that they do not affect the definitions of energy-momentum and angular momentum at i°. Thus, from a physical viewpoint, the ambiguities are “pure gauge.” A prescription is given for fixed this gauge freedom for the class of space-times in which the leading-order part of the Weyl tensor satisfies a certain reflection symmetry. This class admits, in all (relatively boosted) rest frames at infinity, a (...) one-parameter family of asymptotically distinct 3-surfaces (generalized 3-planes) on which the trace of the extrinsic curvature falls off faster than usual. (shrink)

This is a companion to another paper. Together they rebut two widespread philosophical doctrines about emergence. The first, and main, doctrine is that emergence is incompatible with reduction. The second is that emergence is supervenience; or more exactly, supervenience without reduction.In the other paper, I develop these rebuttals in general terms, emphasising the second rebuttal. Here I discuss the situation in physics, emphasising the first rebuttal. I focus on limiting relations between theories and illustrate my claims with four examples, each (...) of them a model or a framework for modelling, from well-established mathematics or physics.I take emergence as behaviour that is novel and robust relative to some comparison class. I take reduction as, essentially, deduction. The main idea of my first rebuttal will be to perform the deduction after taking a limit of some parameter. Thus my first main claim will be that in my four examples (and many others), we can deduce a novel and robust behaviour, by taking the limit N→∞ of a parameter N.But on the other hand, this does not show that the N=∞ limit is “physically real”, as some authors have alleged. For my second main claim is that in these same examples, there is a weaker, yet still vivid, novel and robust behaviour that occurs before we get to the limit, i.e. for finite N. And it is this weaker behaviour which is physically real.My examples are: the method of arbitrary functions (in probability theory); fractals (in geometry); superselection for infinite systems (in quantum theory); and phase transitions for infinite systems (in statistical mechanics). (shrink)

In a recently proposed quantum measurement theory the definiteness of quantum measurements is achieved by means of “special” states. The recovery of the usual quantum probabilities is related to the relative abundance of particular classes of “special” states. In the present article we consider two-state discrimination, and model the apparatus modes that could provide the “special” states. We find that there are structural features which, if generally present in apparatus, will provide universal recovery of standard probabilities. These structural features (...) relate to the distribution of certain Hamiltonian matrix elements or interaction times. In particular, those quantities must be asymptotically (x → ∞) distributed according to the Cauchy law, Ca(x)=a/π(x 2 +a 2 ). (shrink)