13 resultados para Logic, Medieval.


Relevância:

20.00% 20.00%

Publicador:

Resumo:

[ES]A lo largo de estas páginas se analiza la igualdad o desigualdad de las mujeres respecto a los varones ante el control formalizado de la justicia penal a la hora de condenarlas a penas tan rigurosas como los azotes, el destierro o la horca; y ante el control informal ejercido por la familia, reprimiendo los comportamientos considerados ilícitos al margen de los tribunalesde justicia públicos.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

[ES]A lo largo de las páginas de este trabajo se pasa revista a diversas cuestiones que permiten realizar una aproximación a las diversas formas de vida cotidiana y mentalidad del País Vasco y Navarra durante los siglos bajomedievales. Esas cuestiones aluden al primum vivere, al ciclo vital, al control de la vida privada de los individuos y pública de las comunidades por parte de las autoridades, las fiestas, las supersticiones y distintos aspectos relativos a la cultura, como literatura, historiografía y arte.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

[ES]En este artículo se pasa revista y se analizan los distintos factores que contribuyeron a la construcción de un discurso homofóbico por parte de la sociedad europea a partir del siglo XIII. Se centra la atención especialmente en la homosexualidad masculina.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

[ES]En estas páginas se analiza el modelo de sexualidad conyugal establecido por la Iglesia medieval para poder responder a la pregunta de qué era lícito y qué no en las relaciones sexuales. Así, entre otras cuestiones, se pasa revista a las posturas, a los momentos, las frecuencias, etc. Igualmente se exponen diversas estrategias arbitradas por la sociedad medieval para vivir en pareja y disfrutar del sexo al margen del matrimonio canónico, como la barraganía,el amancebamiento o el estupro.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

[ES]En este artículo se analiza la herejía de Durango (Vizcaya en el siglo xv) a partir de las fuentes, tanto literarias como archivísticas; los actores protagonistas; las coordenadas espacio-temporales en las que se desarrolló; los errores doctrinales, diferenciando entre los que propagaron realmente y los que les atribuyeron; y la persecución a la que fue sometida.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

[ES]Propuesta que se encuadra en el estudio de una serie de edificaciones anteriores al románico en la Diócesis de Vitoria, supuestamente inexistentes hasta el momento, en el marco del análisis de las técnicas constructivas medievales del territorio. Para ello se debía contar con una muestra de edificios bien fechados,algo imposible hasta la fecha dado que la historiografía negaba la existencia de iglesias prerrománicas en Álava. Por esto era necesario conseguir una muestra sobre la cual trabajar, para lo que se recurrió a un proceso de selección de edificios en los que se conservaran evidencias anteriores al románico, diseñándose el modelo de prospección que presentamos.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

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.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Coordinador de las actas: Maurilio Pérez González

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Ejemplar dedicado a: Hagiografía y archivos de la Iglesia santoral hispano-mozárabe en las Diócesis de España. Actas del XVIII Congreso de la Asociación celebrado en Orense (1ª parte) (9 al 13 de septiembre de 2002).

Relevância:

20.00% 20.00%

Publicador:

Resumo:

[ES] Cada vez son más habituales las voces que intentan amortiguar las estridencias contrastivas entre Edad Media y Renacimiento, sobre todo cuando en lo menudo de una actividad tan elemental como la gramatical del comentario de textos la estabilidad de las contundentes antítesis resulta difícil asegurarla. Apoyándose en textos representativos del pensamiento tanto teórico como práctico al respecto de la declaración de autores, el autor del presente artículo prefiere alinearse con los que de un tiempo a esta parte intentan conciliar matizadamente las divergencias -alegorización/historicidad; historicidad/clasicidad- aun dentro del mismo período renacentista. Sin desatender la enorme lección de los humanistas sobre lo que debe ser una cabal filología, concebida no como conocimiento autosuficiente, sino como ámbito privilegiado desde donde confluir con infinidad de otros, a mayores el de la vida.