Spelling suggestions: "subject:"proposition""
61 |
The Complexity of Reasoning with Boolean Modal Logics: Extended VersionLutz, Carsten, Sattler, Ulrike 20 May 2022 (has links)
Since Modal Logics are an extension of Propositional Logic, they provide Boolean operators for constructing complex formulae. However, most Modal Logics do not admit Boolean operators for constructing complex modal parameters to be used in the box and diamond operators. This asymmetry is not present in Boolean Modal Logics, in which box and diamond quantify over arbitrary Boolean combinations of atomic model parameters. / This is an extended version of the article in: Advances in Modal Logic (AiML), Volume 3
|
62 |
Aristotelian rationality of animals : phantasia as a commonality of human and animal cognitive processesWorkman-Davies, Bradley Wayne 03 1900 (has links)
This dissertation investigates Aristotle’s theory of phantasia as a cognitive
ability, in terms of which mental content is available to the mind of rational
beings. The focus is on Catherine Osborne’s extension of phantasia to nonhuman
animals in order to allow for and explain non-human animal
behaviour in terms of a rational paradigm, which de-emphasises, and does
not rely on, linguistic ability. This paradigm for understanding animal
behaviour as rational supports, and is supported by, modern theories of
cognitive ethology, and argues for the ability of animals to share in
conceptual thought. The recognition of rationality in animals by means of
this paradigm bears ethical consequences for the treatment of animals. / Classics and Modern European Languages / M.A. (Classical Studies)
|
63 |
Diagnostic distribué de systèmes respectant la confidentialité / Distributed diagnosis of systems respecting privacyArmant, Vincent 27 September 2012 (has links)
Dans cette thèse, nous nous intéressons à diagnostiquer des systèmes intrinsèquement distribués (comme les systèmes pairs-à-pairs) où chaque pair n'a accès qu'à une sous partie de la description d'un système global. De plus, en raison d'une politique d'accès trop restrictive, il sera pourra qu'aucun pair ne puisse expliquer le comportement du système global. Dans ce contexte, le challenge du diagnostic distribué est le suivant: expliquer le comportement global d'un système distribué par un ensemble de pairs ayant chacun une vision limitée, tout comme l'aurait fait un unique pair diagnostiqueur ayant, lui, une vision globale du système.D'un point de vue théorique, nous montrons que tout nouveau système, logiquement équivalent au système pair-à-pairs initialement observé, garantit que tout diagnostic local d'un pair pourra être prolongé par un diagnostic global (dans ce cas, le nouveau système est dit correct pour le diagnostic distribué).Nous montrons aussi que si ce nouveau système est structuré (c-à-d: il contient un arbre couvrant pour lequel tous les pairs contenant une même variable forme un graphe connecté) alors il garantit que tout diagnostic global pourra être retrouvé à travers un ensemble de diagnostics locaux des pairs (dans ce cas le nouveau système est dit complet pour le diagnostic distribué).Dans un souci de représentation succincte et afin de respecter la politique de confidentialité du vocabulaire de chacun des pairs, nous présentons un nouvel algorithme Token Elimination (TE), qui décompose le système de pairs initial vers un système structuré.Nous montrons expérimentalement que TE produit des décompositions de meilleurs qualité (c-à-d: de plus petites largeurs arborescentes) que les méthodes envisagées dans un contexte distribué. À partir du système structuré construit par TE, nous transformons chaque description locale en une Forme Normale Disjonctive (FND) globalement cohérente.Nous montrons que ce dernier système garantit effectivement un diagnostic distribué correct et complet. En plus, nous exhibons un algorithme capable de vérifier efficacement que tout diagnostic local fait partie d'un diagnostic minimal global, faisant du système structuré de FNDs un système compilé pour le diagnostic distribué. / In this thesis, we focus on diagnosing inherently distributed systems such as peer-to-peer, where each peer has access to only a sub-part of the description of an overall system.In addition, due to a too restrictive access control policy, it can be possible that neither peer nor supervisor is able to explain the behaviour of the overall system.The goal of distributed diagnosis is to explain the behaviour of a distributed system by a set of peers (each having a limited local view) as a single diagnosis engine having a global view of the overall system.First, we show that any new system logically equivalent to the initially observed peer-to-peer setting ensures that all diagnosis of a peer may be extended to a global diagnosis (in this case the new system ensures correctness of the distributed diagnosis).Moreover, we prove that if the new system is structured (i.e.it contains a spanning tree for which all peers containing the same variable form a connected graph) then it ensures that any global diagnosis can be found through a set of local diagnoses (in this case the new system ensures the completeness of the distributed diagnoses).For a succinct representation and in order to comply with the privacy policy of the vocabulary of each peer, we present a new algorithm Token Elimination (TE), which decomposes the original peer system to a structured one.We experimentally show that TE produces better quality decompositions (i.e. smaller tree widths) than proposed methods in a distributed context.From the structured system built by TE, we transform each local description into globally consistent DNF.We demonstrate that the latter system is correct and complete for the distributed diagnosis.Finally, we present an algorithm that can effectively check that any local diagnosis is part of a global minimal diagnosis, turning the structured system of DNFs into a compiled system for distributed diagnosis.
|
64 |
[en] LOGIC PROOFS COMPACTATION / [pt] COMPACTAÇÃO DE PROVAS LÓGICASVASTON GONCALVES DA COSTA 01 June 2007 (has links)
[pt] É um fato conhecido que provas clássicas podem ser
demasiadamente grandes. Estudos em teoria da prova
descobriram diferenças exponenciais entre
provas normais (ou provas livres do corte) e suas
respectivas provas não normais. Por outro lado, provadores
automáticos de teorema usualmente se baseiam na
construção de provas normais, livres de corte ou provas de
corte atômico, pois tais procedimento envolvem menos
escolhas. Provas de algumas tautologias são
conhecidamente grandes quanto realizadas sem a regra do
corte e curtas quando a utilizam. Queremos com este
trabalho apresentar procedimentos para reduzir o
tamanho de provas proposicionais. Neste sentido,
apresentamos dois métodos. O primeiro, denominado método
vertical, faz uso de axiomas de extensão e alguns
casos é possível uma redução considerável no tamanho da
prova. Apresentamos um procedimento que gera tais axiomas
de extensão. O segundo, denominado método horizontal,
adiciona fórmulas máximas por meio de unificação via
substituição de variáveis proposicionais. Também
apresentamos um método que gera tal unificação durante o
processo de construção da prova. O primeiro método
é aplicado a dedução natural enquanto o segundo à Dedução
Natural e Cálculo de Seqüentes. As provas produzidas
correspondem de certo modo a provas não normais (com a
regra do corte). / [en] It is well-known that the size of propositional classical
proofs can be
huge. Proof theoretical studies discovered exponential
gaps between normal or
cut-free proofs and their respective non-normal proofs.
The task of automatic
theorem proving is, on the other hand, usually based on
the construction of
normal, cut-free or only-atomic-cuts proofs, since this
procedure produces less
alternative choices. There are familiar tautologies such
that the cut-free proof
is huge while the non-cut-free is small. The aim of this
work is to reduce the
weight of proposicional deductions. In this sense we
present two methods. The
fi first, namely vertical method, uses the extension
axioms. We present a method
that generates a such extension axiom. The second, namely
horizontal method,
adds suitable (propositional) unifi fications modulo
variable substitutions.We also
present a method that generates a such unifi fication
during the proving process.
The proofs produced correspond in a certain way to non
normal proofs (non
cut-free proofs).
|
65 |
Mapas conceituais no ensino de ciências: identificação de proposições estáticas e dinâmicas nas relações entre a ciência, tecnologia e a sociedade / Concept maps in science education: identification of static and dynamic propositions to express the relationships between science, technology and societyRomano Junior, Jerson Geraldo 05 June 2012 (has links)
Os mapas conceituais (MCs) são úteis para representar o conhecimento e promover a aprendizagem significativa, porém recentes trabalhos na literatura apontam que não estão sendo plenamente explorados, pois raramente são utilizados para representar o conhecimento diversificando as proposições. As proposições são unidades fundamentais de conhecimento nos mapas conceituais (MCs). Diferentes mapeadores podem responder a mesma pergunta focal realizando diferentes conexões e relacionando os conceitos de formas diferentes para representar o conhecimento. A proposta do trabalho consiste na elaboração de uma análise de proposições (n=1455) presentes em MCs (n= 104) coletados na disciplina Ciências da Natureza (EACH-USP/Leste) em 2009, durante o período da primeira (MC5) e terceira avaliação (MC15). A análise proposicional proposta utilizou-se de um esquema taxonômico para classificação de proposições estáticas e dinâmicas em seis categorias. As proposições estáticas representam o conhecimento com definições e classificações, enquanto que as proposições dinâmicas expressam relações de ação, influência, dependência, interdependência funcional, proporcionalidade e causa e efeito entre os conceitos. O número de proposições por categoria passou por métodos de estatística descritiva, para mostrar os parâmetros estatísticos como, média, mediana, quartil inferior, quartil superior, mínimo da amostra, e máximo da amostra para descrever cada uma das seis variáveis consideradas na análise proposicional proposta neste trabalho. A comparação dos valores médios de cada categoria para análise proposicional das avaliações MC5 com os valores médios de cada categoria das avaliações MC15 foi feita utilizando-se o teste-t. O método de estatística exploratória multivariada foi empregado para realizar análise hierárquica de agrupamentos (HCA) a fim de observar possíveis tendências entre os alunos e/ou categorias. A HCA agrupou as seis categorias de proposições propostas por este trabalho, sendo que em MC15 houve uma maior distribuição dos tipos de proposições entre as categorias dinâmicas. A HCA formou três agrupamentos para ambas as avaliações e, ainda que tendências dos agrupamentos tenham se mantido, houve um aumento do número total de proposições, sendo que mais de 60% dos alunos optaram pelas proposições dinâmicas, comprovando a eficácia dos estímulos fornecidos nas avaliações. Os resultados apontam para a necessidade da utilização da análise proposicional no mapeamento conceitual para diversificar formas de representação do conhecimento, ou seja, que não sejam somente com o objetivo de descrever, definir e classificar conceitos, mas que sejam utilizadas para incentivar relações conceituais de ação, influência, dependência, proporcionalidade, interdependência funcional e causa e efeito. / The concept maps (CMs) are useful for representing knowledge and promote meaningful learning, but recent studies in the literature indicate that they are not being fully exploited because they are rarely used to represent knowledge by diversifying the propositions. The propositions are fundamental units of knowledge in concept maps (CMs). Different authors may answer the same question different focal performing connections and related concepts in different ways to represent knowledge. Our purpose is to prepare an analysis of propositions (n = 1455) present in MCs (n = 104) collected in the course of Nature Sciences (EACH-USP/Leste) in 2009, during the first (MC5) and third assessment (MC15). The analysis used the propositional proposed a scheme for taxonomic classification of static and dynamic propositions in six categories. The proposals represent the static knowledge with definitions and classifications, while the dynamic propositions expressing relations of action, influence, dependence, and proportionality between cause and effect concepts. The number of propositions in each category went through descriptive statistical methods, to show the statistical parameters as mean, median, lower quartile, upper quartile, the sample minimum and maximum sample to describe each of the six variables considered in the analysis proposed propositional this work. A comparison of mean values for each category analysis of propositional evaluations MC05 to mean values for each category of MC15 evaluation was made using t-test. The exploratory multivariate statistical method was used to perform hierarchical cluster analysis (HCA) to observe possible trends among students and / or categories. HCA grouped the categories and in MC15 was a greater distribution of the types of propositions between the dynamic categories. The HCA was formed three groups for both assessments and, although trends of groupings have been kept, there was an increase in the total number of propositions, and more than 60% of students opted for dynamic propositions, proving the effectiveness of the stimuli provided in the evaluations . The results point to the necessity of using propositional analysis of the conceptual mapping to diversify forms of knowledge representation, they are not solely for the purpose of describing, defining and classifying concepts, but are used to encourage conceptual relations action, influence, dependence, proportionality and cause and effect.
|
66 |
Exposições de arte brasileira: um estudo de exposições como meio para a compreensão dos fundamentos e da recepção da arte contemporânea / Exhibitions of Brazilian art: a study of exhibitions as a means to understand the fundamentals and the reception of contemporary artFirmo, Adrienne de Oliveira 09 May 2017 (has links)
Na tese é averiguado o estatuto do fato artístico em exposições na atualidade, mediante a investigação de sua recepção em exibições nacionais e internacionais de arte brasileira. Fundamenta-se em textos relativos às mostras, observados à luz do multiculturalismo, de vertentes da filosofia contemporânea e das demandas por reconhecimento nas sociedades atuais. Está dividida em quatro partes, onde são examinadas as tendências da arte nacional de vanguarda nas mostras dos anos 1960, a fim de entender, por intermédio do conceito de performação, como procedimentos transferem-se do objeto artístico às exposições; averigua-se então como as tendências performam nas narrativas expositivas nos anos 1980; na seguinte são identificadas mostras dirigidas à proposição discursiva, conceituadas pela pesquisa como exposições proposicionais defrontadas a outros projetos expositivos; por fim dialoga com a produção universitária concernente ao assunto abordado. / This thesis examines the status of the artistic fact in contemporary exhibitions, through the investigation of its reception in national and international Brazilian art exhibitions. It is founded on texts concerning expositions in light of multiculturalism, some aspects of contemporary philosophy and demands of recognition in contemporary societies. It is divided into four parts: where the tendencies of national avant-garde art exhibitions of the 1960s are examined, in order to understand how procedures were transferred from the artistic object to the exhibitions, through the concept of performação; it is then ascertained how tendencies perform in the expository narratives in the 1980s; then exhibitions towards the discursive proposition are identified and conceptualized by the research as propositional expositions in face of other expositive projects; finally, it dialogues with university production concerning the subject matter.
|
67 |
Disjoint NP-pairs and propositional proof systemsBeyersdorff, Olaf 31 August 2006 (has links)
Die Theorie disjunkter NP-Paare, die auf natürliche Weise statt einzelner Sprachen Paare von NP-Mengen zum Objekt ihres Studiums macht, ist vor allem wegen ihrer Anwendungen in der Kryptografie und Beweistheorie interessant. Im Zentrum dieser Dissertation steht die Analyse der Beziehung zwischen disjunkten NP-Paaren und aussagenlogischen Beweissystemen. Haben die Anwendungen der NP-Paare in der Beweistheorie maßgeblich das Verständnis aussagenlogischer Beweissysteme gefördert, so beschreiten wir in dieser Arbeit gewissermaßen den umgekehrten Weg, indem wir Methoden der Beweistheorie zur genaueren Untersuchung des Verbands disjunkter NP-Paare heranziehen. Insbesondere ordnen wir jedem Beweissystem P eine Klasse DNPP(P) von NP-Paaren zu, deren Disjunktheit in dem Beweissystem P mit polynomiell langen Beweisen gezeigt werden kann. Zu diesen Klassen DNPP(P) zeigen wir eine Reihe von Resultaten, die illustrieren, dass robust definierten Beweissystemen sinnvolle Komplexitätsklassen DNPP(P) entsprechen. Als wichtiges Hilfsmittel zur Untersuchung aussagenlogischer Beweissysteme und der daraus abgeleiteten Klassen von NP-Paaren benutzen wir die Korrespondenz starker Beweissysteme zu erststufigen arithmetischen Theorien, die gemeinhin unter dem Schlagwort beschränkte Arithmetik zusammengefasst werden. In der Praxis trifft man statt auf zwei häufig auf eine größere Zahl konkurrierender Bedingungen. Daher widmen wir uns der Erweiterung der Theorie disjunkter NP-Paare auf disjunkte Tupel von NP-Mengen. Unser Hauptergebnis in diesem Bereich besteht in der Charakterisierung der Fragen nach der Existenz optimaler Beweissysteme und vollständiger NP-Paare mit Hilfe disjunkter Tupel. / Disjoint NP-pairs are an interesting complexity theoretic concept with important applications in cryptography and propositional proof complexity. In this dissertation we explore the connection between disjoint NP-pairs and propositional proof complexity. This connection is fruitful for both fields. Various disjoint NP-pairs have been associated with propositional proof systems which characterize important properties of these systems, yielding applications to areas such as automated theorem proving. Further, conditional and unconditional lower bounds for the separation of disjoint NP-pairs can be translated to results on lower bounds to the length of propositional proofs. In this way disjoint NP-pairs have substantially contributed to the understanding of propositional proof systems. Conversely, this dissertation aims to transfer proof-theoretic knowledge to the theory of NP-pairs to gain a more detailed understanding of the structure of the class of disjoint NP-pairs and in particular of the NP-pairs defined from propositional proof systems. For a proof system P we introduce the complexity class DNPP(P) of all disjoint NP-pairs for which the disjointness of the pair is efficiently provable in the proof system P. We exhibit structural properties of proof systems which make the previously defined canonical NP-pairs of these proof systems hard or complete for DNPP(P). Moreover, we demonstrate that non-equivalent proof systems can have equivalent canonical pairs and that depending on the properties of the proof systems different scenarios for DNPP(P) and the reductions between the canonical pairs exist. As an important tool for our investigation we use the connection of propositional proof systems and disjoint NP-pairs to theories of bounded arithmetic.
|
68 |
Επαγωγικός λογικός προγραμματισμός : μια διδακτική προσέγγισηΚαραμουτζογιάννη, Ζωή 31 May 2012 (has links)
Ο Επαγωγικός Λογικός Προγραμματισμός (Inductive Logic Programming ή, σε συντομογραφία ILP) είναι ο ερευνητικός τομέας της Τεχνητής Νοημοσύνης (Artificial Intelligence) που δραστηριοποιείται στη τομή των γνωστικών περιοχών της Μάθησης Μηχανής (Machine Learning) και του Λογικού Προγραμματισμού (Logic Programming).Ο όρος επαγωγικός εκφράζει την ιδέα του συλλογισμού από το επί μέρους στο γενικό. Μέσω της επαγωγικής μάθησης μηχανής ο Επαγωγικός Λογικός Προγραμματισμός επιτυγχάνει το στόχο του που είναι η δημιουργία εργαλείων και η ανάπτυξη τεχνικών για την εξαγωγή υποθέσεων από παρατηρήσεις (παραδείγματα) και η σύνθεση-απόκτηση νέας γνώσης από εμπειρικές παρατηρήσεις. Σε αντίθεση με της περισσότερες άλλες προσεγγίσεις της επαγωγικής μάθησης ο Επαγωγικός Λογικός Προγραμματισμός ενδιαφέρεται για της ιδιότητες του συμπερασμού με κανόνες για την σύγκλιση αλγορίθμων και για την υπολογιστική πολυπλοκότητα των διαδικασιών. Ο Επαγωγικός Λογικός Προγραμματισμός ασχολείται με την ανάπτυξη τεχνικών και εργαλείων για την σχεσιακή ανάλυση δεδομένων. Εφαρμόζεται απευθείας σε δεδομένα πολλαπλών συσχετισμών για την ανακάλυψη προτύπων. Τα πρότυπα που ανακαλύπτονται από τα συστήματα στον Επαγωγικό Λογικό Προγραμματισμό προκύπτουν από κάποιο γνωστό θεωρητικό υπόβαθρο και θετικά και αρνητικά παραδείγματα και εκφράζονται ως λογικά προγράμματα. Ο Επαγωγικός Λογικός Προγραμματισμός έχει χρησιμοποιηθεί εκτεταμένα σε προβλήματα που αφορούν τη μοριακή βιολογία, την βιοχημεία και την χημεία. Ο Επαγωγικός Λογικός Προγραμματισμός διαφοροποιείται από τις άλλες μορφές Μάθησης Μηχανής, αφ’ ενός μεν λόγω της χρήσης μιας εκφραστικής γλώσσας αναπαράστασης και αφ’ ετέρου από τη δυνατότητά του να χρησιμοποιεί τη γνώση υποβάθρου. Έχουν αναπτυχθεί διάφορες μηχανισμούς υλοποίησης του ILP, εκ των οποίων η πιο πρόσφατη είναι η Progol, που βασίζεται σε ένα διερμηνέα της Prolog ο οποίος συνοδεύεται από έναν αλγόριθμο Αντίστροφης Συνεπαγωγής (Inverse Entailment). Η Progol κατασκευάζει νέες προτάσεις με τη γενίκευση των παραδειγμάτων που περιέχονται στη βάση δεδομένων που της δίνεται. Η θεωρία του Επαγωγικού Λογικού Προγραμματισμού εγγυάται ότι η Progol θα διεξάγει μια αποδεκτή αναζήτηση στο διάστημα των γενικεύσεων, βρίσκοντας το ελάχιστο σύνολο προτάσεων, από το οποίο όλα τα παραδείγματα μπορούν να προκύψουν.
Σε αυτή την εργασία θα αναπτυχθούν αναλυτικά η θεωρία και οι κανόνες του Επαγωγικού Λογικού Προγραμματισμού, τα είδη των προβλημάτων που επιλύονται μέσω του Επαγωγικού Λογικού Προγραμματισμού, οι μέθοδοι που ακολουθούνται καθώς και ο τρόπος με τον οποίο αναπτύσσονται οι εφαρμογές του Επαγωγικού Λογικού Προγραμματισμού. Θα δοθούν επίσης παραδείγματα κατάλληλα για την κατανόηση των γνώσεων αυτών από ένα ακροατήριο που διαθέτει βασικές γνώσεις Λογικής και Λογικού Προγραμματισμού. / Inductive Logic Programming is a research area of Artificial Intelligence that operates in the intersection of cognitive areas of Machine Learning and Logic Programming. Through inductive machine learning, Inductive Logic Programming‟s objective is creating tools and developing techniques to extract new knowledge composing a background one and empirical observations (examples). Some methods are employed, the best known of which is the reverse implication, the reverse resolution and the inverse implication. Based on Inductive Logic Programming, some systems have been developed for knowledge production. The most widely used system is Progol, which uses an input of examples and background knowledge, whichε is stated in a kind of grammar compatible to that the programming language Prolog, and generates procedures in the same language that illustrate these examples. Other systems are FOIL, MOBAL, GOLEM and LINUS. There is also Cigol which is a programming language based on the theory of Inductive Logic Programming. These systems are used in many applications. The most important is the area of pharmacology, such as predictive toxicology, the provision of rheumatic disease and the design of drugs for Alzheimer's. Applications can also be found in programming, linguistics and games like chess.
|
69 |
The theory and pedagody of semantic inconsistency in critical reasoningDixon, Scott Walton 05 1900 (has links)
One aspect of critical reasoning is the analysis and appraisal of claims and arguments. A typical problem, when analysing and appraising arguments, is inconsistent statements. Although several inconsistencies may have deleterious effects on rationality and action, not all of them do. As educators, we also have an obligation to teach this evaluation in a way that does justice to our normal reasoning practices and judgements of inconsistency. Thus, there is a need to determine the acceptable inconsistencies from those that are not, and to impart that information to students.
We might ask: What is the best concept of inconsistency for critical reasoning and pedagogy? While the answer might appear obvious to some, the history of philosophy shows that there are many concepts of “inconsistency”, the most common of which comes from classical logic and its reliance on opposing truth-values. The current exemplar of this is the standard truth functional account from propositional logic. Initially, this conception is shown to be problematic, practically, conceptually and pedagogically speaking. Especially challenging from the classical perspective are the concepts of ex contradictione quodlibet and ex falso quodlibet. The concepts may poison the well against any notion of inconsistency, which is not something that should be done unreflectively. Ultimately, the classical account of inconsistency is rejected.
In its place, a semantic conception of inconsistency is argued for and demonstrated to handle natural reasoning cases effectively. This novel conception utilises the conceptual antonym theory to explain semantic contrast and gradation, even in the absence of non-canonical antonym pairs. The semantic conception of inconsistency also fits with an interrogative argument model that exploits inconsistency to display semantic contrast in reasons and conclusions. A method for determining substantive inconsistencies follows from this argument model in a
4
straightforward manner. The conceptual fit is then incorporated into the pedagogy of critical reasoning, resulting in a natural approach to reasoning which students can apply to practical matters of everyday life, which include inconsistency. Thus, the best conception of inconsistency for critical reasoning and its pedagogy is the semantic, not the classical. / Philosophy Practical and Systematic Theology / D. Phil
|
70 |
Aristotelian rationality of animals : phantasia as a commonality of human and animal cognitive processesWorkman-Davies, Bradley Wayne 03 1900 (has links)
This dissertation investigates Aristotle’s theory of phantasia as a cognitive
ability, in terms of which mental content is available to the mind of rational
beings. The focus is on Catherine Osborne’s extension of phantasia to nonhuman
animals in order to allow for and explain non-human animal
behaviour in terms of a rational paradigm, which de-emphasises, and does
not rely on, linguistic ability. This paradigm for understanding animal
behaviour as rational supports, and is supported by, modern theories of
cognitive ethology, and argues for the ability of animals to share in
conceptual thought. The recognition of rationality in animals by means of
this paradigm bears ethical consequences for the treatment of animals. / Classics and Modern European Languages / M.A. (Classical Studies)
|
Page generated in 0.1027 seconds