El documento digital no refiere un asesor / Publicación a texto completo no autorizada por el autor / Establece la vigencia u obsolescencia de los conceptos de regionalización y descentralización forjados en el Perú desde 1928, en relación a los modelos de competitividad regional. Con esto contribuye con la modificación de bases teóricas de la gestión pública en materia de regionalización, descentralización y competitividad territorial frente a los avances cuantitativos de descentralización administrativa, la superposición de órganos, la confusión de conceptos, la construcción de ideales con propósitos que podrían ser despropósitos y la intervención pública con relación a la competitividad territorial. / Tesis

Antonio Monteiro realizó una caracterización de las congruencias maximales para ciertas variedades semisimples, permitiendo presentar un teorema de representación de las mismas; que bajo condiciones específicas, este teorema se le puede presentar una prueba unificada. En esta tesis, mostramos que esta noción de congruencia maximal está íntimamente ligada a la noción de teorías maximales de Henkin para ciertas familias de lógicas de la literatura de lógicas algebraicas. Para ver esta relación, estudiamos la clase de álgebras de Hilbert n-valoradas con supremo enriquecidas con operadores de Moisil. Para esta clase de álgebras, presentamos un cálculo proposicional y de primer orden correctos y completos. Además, mostramos cómo funciona esta relación para lógicas de variedades semisimples estudiadas en la escuela de Monteiro. Ampliando el alcance de las aplicaciones, presentamos resultados de correctitud y completitud para lógicas paraconsistentes de primer orden a través de una semántica matricial no determinista. A pesar de que estas lógicas no son algebraizables con el método general de Blok-Pigozzi, presentan un comportamiento algebraico que nos permite dar una presentación simplificada. Por otro lado, construimos modelos valorados sobre estructuras de Fidel siguiendo la metodología desarrollada para modelos valorados de Heyting; recordemos que las estructuras de Fidel no son álgebras en el sentido del álgebra universal. Tomando modelos que verifican la ley de Leibniz, podemos probar que todos los axiomas de la teoría de conjuntos de ZF son válidos sobre estos modelos. La prueba se basa fuertemente en la existencia de modelos paraconsistentes de la ley de Leibniz. En este escenario, se discute la dificultad de tener modelos de ley algebraicos paraconsistentes para fórmulas con negación usando el mapeo interpretación estándar, mostrando que la existencia de modelos de la ley de Leibniz es esencial para obtener modelos para ZF. / Antonio Monteiro gave a characterization of maximal congruences in certain semisimple varieties in order to present a representation theorem for them. Under specific conditions, this theorem can be presented with the same proof for every semisimple variety considered by him. In this thesis, we show that this notion of maximal congruence is closely linked to Henkin’s notion of maximal theories for certain families of logics from the literature of algebraic logic. To see this relation, we study the class of n-valued Hilbert algebras with supremum enriched with Moisil operators. For this class of algebras, we present a sound and complete propositional and first-order calculus. Moreover, we show how this relation works for logics from semisimple varieties studied in the Monteiro’s school. Extending the scope of applications, we present soundness and completeness results for some first-order paraconsistent logics through non-deterministic matrix semantics. Despite the fact that these logics are not algebraizable with the Blok-Pigozzi’s method, they display an algebraic behaviour that allows us to give a simplified presentation. On the other hand, we build Fidel-structures valued models following the methodology developed for Heyting-valued models; recall that Fidel structures are not algebras in the universal algebra sense. Taking models that verify Leibniz law, we are able to prove that all set-theoretic axioms of ZF are valid over these models. The proof is strongly based on the existence of paraconsistent models of Leibniz law. In this setting, the difficulty of having algebraic paraconsistent models of law for formulas with negation using the standard interpretation map is discussed, showing that the existence of models of Leibniz law is essential to getting models for ZF.

No description available.

In our opinion, it is fair to distinguish two separate branches in the origins of model theory. The first one, the model theory of first-order logic, can be traced back to the pioneering work of L. Lowenheim, T. Skolem, K. Gödel, A. Tarski and A.I. MaI 'cev, published before the mid 30's. This branch was put forward during the 40s' and 50s’ by several authors, including A. Tarski, L. Henkin, A. Robinson, J. Los. Their contribution, however, was rather influenced by modern algebra, a discipline whose development was being truly fast at the time. Largely due to this influence, it was a very common usage among these authors lo the equality symbol belonging lo the language. Even when a few years later the algebraic methods started to be supplanted to a large extent by the set-theoretical technique that mark present-day theory, the consideration of the equality a constant in the language still subsisted. The second branch is the model theory of equational logic. It was born with the seminal work of G. Birkhoff which established the first basic tools and results of what later developed the part of universal algebra known as the theory of varieties and quasivarieties. The algebraic character of this other branch of model theory was clearer and stronger, for it simply emerged as the last stop in the continuous process of abstraction in algebra. Amid these two branches of model theory, which suffered a rapid growth at the time, there appeared the work done by Mal'cev in the early 1950's and the late 60's, which some influence in the future development of the discipline, in the old Soviet Union. During the period mentioned above, he developed a first-order model theory that retained much of the spirit of the period and diverged openly from the model theory developed in the West. In particular, he put forward the model theory of universal Horn logic with equality along the of Birkhoff's theory of varieties, and showed that such logic forms a right setting for a large part of universal algebra, including the theory of presentations and free structures. The most worth-mentioning peculiarities of Mal'cev's program were the following: first, he kept on dealing with first-order languages with equality; second, he adopted notions of homomorphism and congruence that had little to do with the relational part of the language. This well-roted tradition of developing model theory in the presence of an equality symbol to express the identity relation, which goes back to its very origin, finally broken when logicians from the PoIish School started program similar to that of Mal'cev for another type of UHL, viz. general sentential logic. Indeed, in spite of the fact that the algebraic character of sentential logic was evident early in its development (chiefly because classical sentential calculus could be completely reduced to the quasi-equational theory of Boolean algebras), the natural models of arbitrary sentential calculus quickly took the form of logical matrices, that is, algebras endowed with a unary relation on their universe. This matrix semantics so became the first attempt of starting a systematic development of a model theory for first-order languages without equality. Beginning with the publication of a paper by Los in 1949, matrix semantics was successfully developed over the next three decades by a number of different authors in Poland, including J. Los himself, R. Suszko, R. Wojcicki and J. Zygmunt. The present evolution of these issues points towards an effort of encompassing the theory of varieties and quasi-varieties and the model theory of sentential logic, by means of the development of a program similar to Mal’cev’s for UHL without equality. We recognize that this evolution has been fast and notorious in the last decade, thanks mainly to the work done by J. Czelakowski, W. Blok and D. Pigozzi among others. For example, the first author has been developing a model theory of sentential logic inherits a lot of the algebraic character of Mal’cev’s theory of sentential logic originated by Birkhoff. On the other hand, Blok and Pigozzi, in a paper published in 1992, have succeeded in the development of a model theory –based on the Leibniz operator introduced by them– that does comprises for the first time both equational logic and sentential logic, and so strengthens Czelakowsk’s program. What enables such a simultaneous treatment in their approach in the observation that equational logic can be viewed as an example of a 2-dimensional sentential calculus and thus admits a matrix semantics, this time a matrix being an algebra together with a congruence on the algebra. A characteristic of decisive importance in Blok and Pigozzi's approach in their apparent conviction that only reduced models really possess the algebraic character of the models of quasi-equational theories. We give up such a conviction and the restriction to particular types of languages. The main purpose of this paper is to outline some basic aspects of the model theory for first-order languages that definitively do not include the equality symbol and which account of both the full and the reduced semantics. The theory is intended to follow as much as possible of the Mal'cev's tradition by pronounced algebraic character and mainly covering topics fairly well studied in universal algebra (that is the reason for giving the term “algebraic” to our model theory). Most of the work, that extends to general languages and fairly clarifies some recent trends in algebraic logic, constitutes the foundations of a model theory of UHL without equality. An important number of the results in the paper run side by side with some well-known results of either classical model theory or universal algebra; so, we make an effort to highlight the concepts and techniques only applied in these contexts although, in some sense, they find a more general setting in ours. The outgrowth of the current interest in the model theory of UHL without equality is the emergence of several applications mainly in algebraic logic and computer science. Therefore we also discuss the way that the developed theory relates to algebraic logic. Actually, we maintain that our approach provides an appropriate context to investigate the availability of nice algebraic semantics, not only for the traditional deductive systems that arise in sentential logic, but also for some other types of deductive systems that are attracting increasing attention at the time. The reason is that all of them admit as interpretation as universal Horn theories without equality. As we said before, the absence of symbol is the language to mean the identity relation is central to this work. Traditionally, the equality in classical model theory has had a representation is the moral language and has been understood in an absolute sense, i.e., for any interpretation of the language, the interest of model-theorists has been put on the relation according to which two members of the universe are the same or has no other logical relation. We break this tradition by introducing a weak form of equality predicate and not presupposing its formal representation by a symbol of the language. Then the main problem consists, broadly speaking, in the investigation of the relationship between the features of this weaker equality in a given class of structures and the fulfillment of certain properties by this class. This is not at all recent treatment of the equality; for instance, it underlies the old notion of Lindenbaum-Tarski algebra in the model theory of sentential logic, and more recently contributions to the study of algebraic for semantics logics. Our contribution amounts to no more than providing a broader framework for the investigation of this question in the domain of first-order logic, the universal Horn fragment. Several points stand out for they govern all our approach. First, the extended use we make of two unlike notions of homomorphism, whose difference relies on the importance each one attaches to relations; this is a distinction that no longer exists in universal algebra but does exist in classical model theory. Secondly, the availability of two distinct adequate semantics easily connected through an algebraic operation, which consists in factorizing the structures in such a way that the Leibniz equality and the usual identity relation coincide. We believe this double semantics is what is mainly responsible for the interest of the model theory for languages without equality as a research topic; in spite of their equivalence from a semantical point of view, they furnish several stimulating problems regarding their comparability from an algebraic perspective. Thirdly, the two extensions that the notion of congruence on an algebra admits when dealing with general structures over languages without equality, namely, as a special sort of binary relation associated to a structure, here called congruence, and as the relational part of a structure, which is embodied in the concept of filter extension. Finally, and not because of this less important, the nice algebraic description that our equality predicate has as the greatest one of the congruence on a structure. This fact allows to replace the fundamental (logical) concept of Leibniz equality by an entirely algebraic notion, and to put the main emphasis on the algebraic methods. Actually, it seems to us that other forms of equality without such a property hardly give rise to model theories that work out so beautifully. The work is organized in 10 chapters. The first three contain basic material that is essential to overcome the small inadequacies of some approaches to the topic formerly provided by other authors. Chapter 1 reviews some terminology and notation that will appear repeteadly thereafter, and presents some elementary notions and results of classical model theory that remains equal for languages without equality. Chapter 2 states and characterizes algebraically the fundamental concept of equality in the sense of Leibniz which we deal with all over the paper. Finally, in Chapter 3 we discuss the semantical consequences of factorizing a structure by a congruence and show that first-order logic without equality has two complete semantics related by a reduction operator (Theorem 3.2.1). Right here we pose out if the central problem to which most of the subsequent work is devoted, i.e., the investigation of the algebraic properties that the full reduced model classes of an elementary theory exhibit. Chapter 4 contains the first difficult results in the work. By a rather obvious generalization of proofs known from classical model theory, we obtain Birkhoff-type characterizations of full classes of axiomatized by certain sorts of first-order without equality, and apply these results to derive analogue characterizations for the corresponding reduced classes. Chapter 5 is a central one; it examines the primary consequences of dealing with the relational part of a structure as the natural extension of congruences when passing from algebraic to general fist-order languages without equality. A key observation in this case is that the sets of structures of an algebraic complete lattice. It is proved that this classes is just the quasinvarieties of structure. The Leibniz operator is defined right here as a primary criterion to distinguish properties of the Leibniz equality in a class of models. Using the operator, a fundamental hierarchy of classes. Chapter 7 examines how the characterizations of reduced quasinvarieties (relative varieties) obtained in Chapter 4 can be improved when we deal with the special types of classes introduced formerly. Chapters 6, 8 and 9 provide an explicit generalization of well-known results from universal algebra. Concretely, in Chapter 6 we present the main tools of Subdirect Representation Theory for general first-order structures without equality. Chapter 8 deals with the existence of free structures both in full and reduced classes. This Chapter also includes the investigation of a correspondence between (quasi)varieties and some lattice structures associated with the Herbrand structures, correspondence that offers the possibility of turning the logical methods used in the theory of varieties and quasivarieties into purely algebraic ones (Theorems 8.3.3 and 8.3.6). In Chapter 9 we set the problem of finding Mal'cev-type conditions for properties concerning posets of relative congruences or relative filler extensions of members of quasivarieties. Finally, Chapter 10 discusses briefly the relation between algebraic logic and the approach to model theory outlined in the previous chapters, providing that some vindication to it. Of course, we cannot say whether this work will ultimately have a bearing on the resolution of any of the problem of algebraic logic, but for us, it could at least provide fresh insights in this exciting branch of logic.

El entorno competitivo donde se desenvuelven actualmente las organizaciones empresariales, obliga a plantearse esquemas de operación bajo requerimientos de alta calidad y mínimos costes de producción. En los costes de producción, influyen, considerablemente, la distribución de las diferentes actividades en planta y el mantenimiento de los equipos que la conforman. Para la distribución de las actividades, es imperioso diseñar la ordenación, que favorezca el recorrido óptimo de los materiales de producción, para minimizar los gastos asociados al desplazamiento y a otros criterios de implantación. En relación al mantenimiento, es indispensable habilitar aquellas acciones que permitan conservar, plenamente operativos, los equipos del proceso y que a su vez impliquen costes mínimos. Hasta el presente, no se ha propuesto una metodología que contemple ambas consideraciones en el diseño de plantas. En este trabajo, se propone un primer modelo, cuya finalidad es minimizar tanto los costes relacionados por el posicionamiento de las actividades, como los esperados por la aplicación del mantenimiento a los equipos, y la influencia que tiene la distribución en éstos. Como metodología de búsqueda y validación se emplea un algoritmo genético. / Contreras Pérez, RA. (2010). Modelo de optimización en la generación de plantas industriales, considerando las actividades de mantenimiento y las condiciones ambientales mediante el uso de la metodología de los algoritmos genéticos [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/7344 / Palancia

Aquesta tesi té tres objectius. En primer lloc, estudiem generalitzacions de la jerarquia no ample relatives a una família de tipus parcials. Aquestes jerarquies en permeten classificar la complexitat del “forking” respecte a una família de tipus parcials. Si considerem la família de tipus algebraics, aquestes generalitzacions corresponen a la jerarquia ordinària, on el primer i el segon nivell corresponen a one-basedness i a CM-trivialitat, respectivament. Fixada la família de tipus regulars “no one-based”, el primer nivell d'una d'aquestes possibles jerarquies no ample ens diu que el tipus de la base canònica sobre una realització és analitzable en la família. Demostrem que tota teoria simple amb suficients tipus regulars pertany al primer nivell de la jerarquia dèbil relativa a la família de tipus regulars no one-based. Aquest resultat generalitza una versió dèbil de la “Canonical Base Property” estudiada per Chatzidakis i Pillay. En segon lloc, discutim problemes d'eliminació de hiperimaginaris assumint que la teoria és CM-trivial, en tal cas la independència del “forking” té un bon comportament. Més concretament, demostrem que tota teoria simple CM-trivial elimina els hiperimaginaris si elimina els hiperimaginaris finitaris. En particular, tota teoria petita simple CM-trivial elimina els hiperimaginaris. Cal remarcar que totes les teories omega-categòriques simples que es coneixen són CM-trivials; en particular, aquelles teories obtingudes mitjançant una construcció de Hrushovski. Finalment, tractem problemes de classificació en les teories simples. Estudiem la classe de les teories simples baixes; classe que inclou les teories estables i les teories supersimples de D-rang finit. Demostrem que les teories simples amb pes finit acotat també pertanyen a aquesta classe. A més, provem que tota teoria omega-categòrica simple CM-trivial és baixa. Aquest darrer fet resol parcialment una pregunta formulada per Casanovas i Wagner. / The development of first-order stable theories required two crucial abstract notions: forking independence, and the related notion of canonical base. Forking independence generalizes the linear independence in vector spaces and the algebraic independence in algebraically closed fields. On the other hand, the concept of canonical base generalizes the field of definition of an algebraic variety. The general theory of independence adapted to simple theories, a class of first-order theories which includes all stable theories and other interesting examples such as algebraically closed fields with an automorphism and the random graph. Nevertheless, in order to obtain canonical bases for simple theories, the model-theoretic development of hyperimaginaries --equivalence classes of arbitrary tuple modulo a type-definable (without parameters) equivalence relation-- was required. In the present thesis we deal with topics around the geometry of forking in simple theories. Our first goal is to study generalizations of the non ample hierarchy which will code the complexity of forking with respect to a family of partial types. We introduce two hierarchies: the non (weak) ample hierarchy with respect to a fixed family of partial types. If we work with respect to the family of bounded types, these generalizations correspond to the ordinary non ample hierarchy. Recall that in the ordinary non ample hierarchy the first and the second level correspond to one-basedness and CM-triviality, respectively. The first level of the non weak ample hierarchy with respect to some fixed family of partial types states that the type of the canonical base over a realization is analysable in the family. Considering the family of regular non one-based types, the first level of the non weak ample hierarchy corresponds to the weak version of the Canonical Base Property studied by Chatzidakis and Pillay. We generalize Chatzidakis' result showing that in any simple theory with enough regular types, the canonical base of a type over a realization is analysable in the family of regular non one-based types. We hope that this result can be useful for the applications; for instance, the Canonical Base Property plays an essential role in the proof of Mordell-Lang for function fields in characteristic zero and Manin-Mumford due to Hrushovski. Our second aim is to use combinatorial properties of forking independence to solve elimination of hyperimaginaries problems. For this we assume the theory to be simple and CM-trivial. This implies that the forking independence is well-behaved. Our goal is to prove that any simple CM-trivial theory which eliminates finitary hyperimaginaries --hyperimaginaries which are definable over a finite tuple-- eliminates all hyperimaginaries. Using a result due to Kim, small simple CM-trivial theories eliminate hyperimaginaries. It is worth mentioning that all currently known omega-categorical simple theories are CM-trivial, even those obtained by an ab initio Hrushovski construction. To conclude, we study a classification problem inside simple theories. We study the class of simple low theories, which includes all stable theories and supersimple theories of finite D-rank. In addition, we prove that it also includes the class of simple theories of bounded finite weight. Moreover, we partially solve a question posed by Casanovas and Wagner: Are all omega-categorical simple theories low? We solve affirmatively this question under the assumption of CM-triviality. In fact, our proof exemplifies that the geometry of forking independence in a possible counterexample cannot come from finite sets.