Sandra Carillo, Mauro Lo Schiavo, Cornelia Schiebold
ABSTRACTIn this article, a general solution formula is derived for the ‐matrix modified Korteweg–de Vries equation. Then, a solution class corresponding to special parameter choices is examined in detail. Roughly, this class can be described as ‐solitons (in the sense of Goncharenko) with common phase matrix. It turns out that such a solution even takes values in a commutative subalgebra of the ‐matrices. We arrive at a rich picture of possibilities for generalized 1‐solitons and at visual patterns of ‐solitons which combine nonlinear with linear features. The impact of the phase matrix is visualized in computer plots.
We establish the decidability of the $Σ_2$ theory of $\mathscr{D}_h(\leq_h \mathcal{O})$, the hyperarithmetic degrees below Kleene's $\mathcal{O}$, in the language of uppersemilattices with least and greatest element. This requires a new kind of initial-segment result and a new extension of embeddings result both in the hyperarithmetic setting.
We discuss such Maltsev conditions that consist of just one linear equation, we call them loop conditions. To every such condition can be assigned a graph. We provide a classification of conditions with undirected graphs. It follows that the Siggers term is the weakest non-trivial loop condition.
We develop an extension of institution theory that accommodates implicitly the partiality of the signature morphisms and its syntactic and semantic effects. This is driven primarily by applications to conceptual blending, but other application domains are possible (such as software evolution). The particularity of this extension is a reliance on ordered-enriched categorical structures.
We generalize Hrushovski's Group Configuration Theorem to quasiminimal classes. As an application, we present Zariski-like structures, a generalization of Zariski geometries, and show that a group can be found there if the pregeometry obtained from the bounded closure operator is non-trivial.
We show that any formula with two free variables in a VC-minimal theory has VC-codensity at most two. Modifying the argument slightly, we give a new proof of the fact that, in a VC-minimal theory where acl = dcl, the VC-codensity of a formula is at most the number of free variables.
We isolate here a wide class of well founded orders called tame orders and show that each such order of cardinality at most $κ$ can be realized as the Mitchell order on a measurable cardinal $κ$, from a consistency assumption weaker than $o(κ) = κ^+$.
This work was intended to be an attempt to introduce the meta-language for working with multiple-conclusion inference rules that admit asserted propositions along with the rejected propositions. The presence of rejected propositions, and especially the presence of the rule of reverse substitution, requires certain change the definition of structurality.
We extend the polynomial time algorithms due to Buss and Mints(APAL 1999) and Ferrari, Fiorentini and Fiorino(LPAR 2002) to yield a polynomial time complete disjunction property in intuitionistic propositional logic.
Following G. Mints(Kluwer 2000 and draft 2013), we present terminating and bicomplete proof searches in multi-succedent sequent calculi for intuitionistic propositional logic, fragments of intuitionistic predicate logic and full intuitionistic predicate logic in the spirit of Schuette's schema.
Tradicionalmente, en periodismo, el tiempo y el espacio han sido importantes condicionantes en la labor informativa. Más allá del ciclo productivo del sector comunicativo convencional, marcado por la periodicidad del medio, la distribución también quedaba sujeta a limitaciones geográficas. La propia emisión y publicación de contenidos es medida en términos temporales o espaciales. La irrupción de la Red ha diluido estas barreras ampliando las posibilidades de la profesión periodística y aumentando las opciones de publicación de los contenidos. No obstante, como se verá, esta mayor apertura no ha estado exenta de riesgos para el desempeño de la labor informativa.
José León Carrión, J. Fernando Calvo Mauri, Salvador Hernandez Lozano
et al.
El aumento en los hospitales y centros de salud de pacientes con traumatismos craneales debidos a distintos tipos de accidentes hace que haya crecido la demanda de profesionales capaces de atender las secuelas psicológicas derivadas del daño cerebral. La neuropsicología, como disciplina a la vez básica y aplicada, es la que se ocupa de atender estos problemas. Se trata de estudiar las relaciones cerebro-conducta destacando el papel que juegan las distintas zonas cerebrales en la planificación de la conducta y estudiando asimismo, cómo la conducta también juega un papel en la organización cerebral. En este trabajo se presenta una aproximación a la neuropsicología, con la idea de ofrecer una panorámica general que permita un primer acercamiento a dicha disciplina.
We use the Sigma^1_3 absoluteness theorem to show that the complexity of the statement "(omega,E)$ is isomorphic to an initial segment of the core model" is Pi^1_4, and that the complexity of the statement "(omega,E)$ is isomorphic to a member of the core model" is Delta^1_5.
Let m be the least cardinal k such that MA(k) fails. The only known model for "m is singular" was constructed by Kunen. In Kunen's model cof(m)=omega_1. It is unknown whether "omega_1 < cof(m) < m" is consistent. The purpose of this paper is to present a proof of Kunen's result and to identify the difficulties of generalizing this result to an arbitrary uncountable cofinality.
It is shown that if BMM (= Bounded Martin's Maximum) holds then each set is contained in an inner model with a strong cardinal. This answers a question that has been asked by various people. It follows that BMM has a much larger consistency strength than BSPFA (= the Bounded Semi-proper Forcing Axiom).