Apuntes jurídicos sobre el paisaje lingüístico en Euskal Herria

This paper is a study of place-names and signs in the Basque Country from the point of view of language law. These are matters that relate to both the status and corpus of language and contribute to the formation of the language landscape,» After a brief historical introduction, the author focuses on the factors that bear on signs and the language 1andscape: the cornpetence factor and the language factor. The description of the latter leads the author to a discussion of the existing language system, in which the Spanish and Basque sharing official status does not necessarily entail the obligation to use both languages at the same time. Using this discussion as a frame of reference, the au- thor analyses place-names, traffic signals and signs. As for place-names, the existing rules are deemed rigid and lacking in ambition, in that they do not pursue the dissemination of official Basque forms. In traffic signaIs, Basque has to appear alongside Spanish, which is required by Spanish legislation, although this bilingualism excludes place-names that have an official Basque form only. With regard to signs, the author analyses public premises, companies licensed to provide public services and the private sector. For public premises there is no specific regulation, but the status of Basque as an autochthonous language, together with the identification and informatíon purposes of signs, could support the exclusive use of this language, According to the author , companies licensed to provide public services should observe the same language system as the goverment and therefore promote the use of Basque. Finally, in the private sector, the author upholds the legitimacy of measures to promote Basque language use such as tax allowances and exemptions in advertising and commercial signs.

Una longeva técnica forestal: los trasmochos o desmochos guiados en Guipúzcoa durante la Edad Moderna

[ES] A fin de garantizar el aprovechamiento deun recurso renovable como la madera, en un momento de retroceso forestal y escasez de materiales, los habitantes de la provincia de Guipúzcoa, ante lo exiguo de su territorio, arbitraron un sistema que permitió combinar las necesidades y demandas de actividades tan dispares como la ganadería, el consumo doméstico, la siderurgia o la construcción naval. El presente artículo pretende analizar el origen, desarrollo y desaparición de los trasmochos guiados y describir su técnica en el territorio guipuzcoano. A falta de mayores evidencias, parece que la técnica del trasmochado o desmochado guiado inició su andadura en la Baja Edad Media, aunque hasta las primeras décadas del siglo XVI no existen datos documentales de su utilización en territorio guipuzcoano. Su generalización en todo el territorio guipuzcoano no parece producirse definitivamente hasta finales del siglo XVII, aunque para entonces se venía aplicando en la costa y el sector oriental de la reclamaciones de las autoridades reales y territoriales, la obligación de dejar horca y pendón se encontró con la oposición de carboneros y ferrones, quienes trasmochaban los árboles pero sin guiarlos, perjudicando de ese modo a las autoridades e intereses de la Marina Real. Precisamente el incumplimiento de las ordenanzas fue lo que provocó la aparición de dos modelos, con usos diferenciados: trasmochos sin guiar y trasmochos guiados. A lo largo del siglo XIX dicha técnica se fue perdiendo, coincidiendo con la paulatina desaparición de la construcción naval en madera.

Invariant-free deduction systems for temporal logic

In this thesis we propose a new approach to deduction methods for temporal logic. Our proposal is based on an inductive definition of eventualities that is different from the usual one. On the basis of this non-customary inductive definition for eventualities, we first provide dual systems of tableaux and sequents for Propositional Linear-time Temporal Logic (PLTL). Then, we adapt the deductive approach introduced by means of these dual tableau and sequent systems to the resolution framework and we present a clausal temporal resolution method for PLTL. Finally, we make use of this new clausal temporal resolution method for establishing logical foundations for declarative temporal logic programming languages. The key element in the deduction systems for temporal logic is to deal with eventualities and hidden invariants that may prevent the fulfillment of eventualities. Different ways of addressing this issue can be found in the works on deduction systems for temporal logic. Traditional tableau systems for temporal logic generate an auxiliary graph in a first pass.Then, in a second pass, unsatisfiable nodes are pruned. In particular, the second pass must check whether the eventualities are fulfilled. The one-pass tableau calculus introduced by S. Schwendimann requires an additional handling of information in order to detect cyclic branches that contain unfulfilled eventualities. Regarding traditional sequent calculi for temporal logic, the issue of eventualities and hidden invariants is tackled by making use of a kind of inference rules (mainly, invariant-based rules or infinitary rules) that complicates their automation. A remarkable consequence of using either a two-pass approach based on auxiliary graphs or aone-pass approach that requires an additional handling of information in the tableau framework, and either invariant-based rules or infinitary rules in the sequent framework, is that temporal logic fails to carry out the classical correspondence between tableaux and sequents. In this thesis, we first provide a one-pass tableau method TTM that instead of a graph obtains a cyclic tree to decide whether a set of PLTL-formulas is satisfiable. In TTM tableaux are classical-like. For unsatisfiable sets of formulas, TTM produces tableaux whose leaves contain a formula and its negation. In the case of satisfiable sets of formulas, TTM builds tableaux where each fully expanded open branch characterizes a collection of models for the set of formulas in the root. The tableau method TTM is complete and yields a decision procedure for PLTL. This tableau method is directly associated to a one-sided sequent calculus called TTC. Since TTM is free from all the structural rules that hinder the mechanization of deduction, e.g. weakening and contraction, then the resulting sequent calculus TTC is also free from this kind of structural rules. In particular, TTC is free of any kind of cut, including invariant-based cut. From the deduction system TTC, we obtain a two-sided sequent calculus GTC that preserves all these good freeness properties and is finitary, sound and complete for PLTL. Therefore, we show that the classical correspondence between tableaux and sequent calculi can be extended to temporal logic. The most fruitful approach in the literature on resolution methods for temporal logic, which was started with the seminal paper of M. Fisher, deals with PLTL and requires to generate invariants for performing resolution on eventualities. In this thesis, we present a new approach to resolution for PLTL. The main novelty of our approach is that we do not generate invariants for performing resolution on eventualities. Our method is based on the dual methods of tableaux and sequents for PLTL mentioned above. Our resolution method involves translation into a clausal normal form that is a direct extension of classical CNF. We first show that any PLTL-formula can be transformed into this clausal normal form. Then, we present our temporal resolution method, called TRS-resolution, that extends classical propositional resolution. Finally, we prove that TRS-resolution is sound and complete. In fact, it finishes for any input formula deciding its satisfiability, hence it gives rise to a new decision procedure for PLTL. In the field of temporal logic programming, the declarative proposals that provide a completeness result do not allow eventualities, whereas the proposals that follow the imperative future approach either restrict the use of eventualities or deal with them by calculating an upper bound based on the small model property for PLTL. In the latter, when the length of a derivation reaches the upper bound, the derivation is given up and backtracking is used to try another possible derivation. In this thesis we present a declarative propositional temporal logic programming language, called TeDiLog, that is a combination of the temporal and disjunctive paradigms in Logic Programming. We establish the logical foundations of our proposal by formally defining operational and logical semantics for TeDiLog and by proving their equivalence. Since TeDiLog is, syntactically, a sublanguage of PLTL, the logical semantics of TeDiLog is supported by PLTL logical consequence. The operational semantics of TeDiLog is based on TRS-resolution. TeDiLog allows both eventualities and always-formulas to occur in clause heads and also in clause bodies. To the best of our knowledge, TeDiLog is the first declarative temporal logic programming language that achieves this high degree of expressiveness. Since the tableau method presented in this thesis is able to detect that the fulfillment of an eventuality is prevented by a hidden invariant without checking for it by means of an extra process, since our finitary sequent calculi do not include invariant-based rules and since our resolution method dispenses with invariant generation, we say that our deduction methods are invariant-free.

Análisis del entorno emprendedor universitario

[ES]La actual situación socioeconómica hace que el emprendimiento sea una fuerza necesaria para el desarrollo económico de la sociedad y la universidad debe de ser un agente creador de nuevas ideas e iniciativas empresariales. La universidad actual tiene la obligación de facilitar el emprendimiento y para ello lleva a cabo programas de ayuda al emprendedor. En este trabajo se presenta la base teórica que rige la transferencia de conocimiento y se analizan los distintos programas que diferentes universidades llevan cabo con el objetivo de identificar áreas de mejora.

Valuation of Wind Energy Projects: A Real Options Approach

We address the valuation of an operating wind farm and the finite-lived option to invest in it under different reward/support schemes: a constant feed-in tariff, a premium on top of the electricity market price (either a fixed premium or a variable subsidy such as a renewable obligation certificate or ROC), and a transitory subsidy, among others. Futures contracts on electricity with ever longer maturities enable market-based valuations to be undertaken. The model considers up to three sources of uncertainty: the electricity price, the level of wind generation, and the certificate (ROC) price where appropriate. When analytical solutions are lacking, we resort to a trinomial lattice combined with Monte Carlo simulation; we also use a two-dimensional binomial lattice when uncertainty in the ROC price is considered. Our data set refers to the UK. The numerical results show the impact of several factors involved in the decision to invest: the subsidy per MWh generated, the initial lump-sum subsidy, the maturity of the investment option, and electricity price volatility. Different combinations of variables can help bring forward investments in wind generation. One-off policies, e.g., a transitory initial subsidy, seem to have a stronger effect than a fixed premium per MWh produced.