Results for 'Proving Aa Voronkov'

1000+ found
Order:
  1. Section 2. Model Theory.Va Vardanyan, On Provability Resembling Computability, Proving Aa Voronkov & Constructive Logic - 1989 - In Jens Erik Fenstad, Ivan Timofeevich Frolov & Risto Hilpinen (eds.), Logic, Methodology, and Philosophy of Science Viii: Proceedings of the Eighth International Congress of Logic, Methodology, and Philosophy of Science, Moscow, 1987. Sole Distributors for the U.S.A. And Canada, Elsevier Science.
    No categories
     
    Export citation  
     
    Bookmark  
  2. Logic for Programming Artificial Intelligence and Reasoning 10th International Conference, Lpar 2003, Almaty, Kazakhstan, September 22-26, 2003 : Proceedings. [REVIEW]Moshe Y. Vardi & A. Voronkov - 2003
     
    Export citation  
     
    Bookmark  
  3. The Ground-Negative Fragment of First-Order Logic is Πp2-Complete.Andrei Voronkov - 1999 - Journal of Symbolic Logic 64 (3):984 - 990.
    We prove that for a natural class of first-order formulas the validity problem is Π p 2 -complete.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  4.  30
    Term-Modal Logics.Melvin Fitting, Lars Thalmann & Andrei Voronkov - 2001 - Studia Logica 69 (1):133-169.
    Many powerful logics exist today for reasoning about multi-agent systems, but in most of these it is hard to reason about an infinite or indeterminate number of agents. Also the naming schemes used in the logics often lack expressiveness to name agents in an intuitive way.To obtain a more expressive language for multi-agent reasoning and a better naming scheme for agents, we introduce a family of logics called term-modal logics. A main feature of our logics is the use of modal (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  5.  4
    Complexity of Some Problems in Modal and Superintuitionistic Logics.Larisa Maksimova & Andrei Voronkov - 2000 - Bulletin of Symbolic Logic 6:118-119.
  6. Heraclitus and Stoicism.Long Aa - 1975 - Filosofia 5:133-156.
     
    Export citation  
     
    Bookmark  
  7.  29
    Testimonios.V. V. Aa - 2010 - Telos: Revista Iberoamericana de Estudios Utilitaristas 17 (2):17-22.
    No categories
    Direct download (3 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  8.  16
    The Informal Public in Soviet Society: Double Morality at Work.Elena Zdravomyslova & Viktor Voronkov - 2002 - Social Research 69 (1):49-69.
    Soviet work and family kollektives were the substance of official public life in Soviet Russia. Beginning in the late 1950s, gradually from both private and privatized official settings and differentiating from them, the informal public sphere emerged-the sphere of social practices, regulated by the unwritten codes of everyday moral economy.
    Direct download  
     
    Export citation  
     
    Bookmark  
  9.  10
    Realizability 473.A. Voronkov & Kf Wehmeier - 1998 - In Samuel R. Buss (ed.), Handbook of Proof Theory. Elsevier. pp. 39--472.
  10.  5
    Mares, Edwin, Relevant Logic: A Philosophical Interpretation, Cambridge: Cambridge University Press, 2004, Pp. X Þ 229, US $65 (Cloth). [REVIEW]B. AÀ - 2005 - Australasian Journal of Philosophy 83 (4):617.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  11. Arte de emergencia.Vv Aa - 2011 - Minerva: Evidence-Based Medicine pour la première ligne 4 (16):68-74.
    No categories
    Translate
     
     
    Export citation  
     
    Bookmark  
  12. Books and Reviews.W. Aa - 1976 - International Logic Review: Rassegna Internazionale di Logica 13:106.
     
    Export citation  
     
    Bookmark  
  13. Culture and Utopia in the Phenomenological Perspective.Bello Aa - 1976 - Analecta Husserliana 5:305-341.
  14. L'argument(Renforcé) de la Connexion Logique Rejeté En Néerlandais.Derksen Aa - 1976 - Algemeen Nederlands Tijdschrift voor Wijsbegeerte 68 (4):232-249.
    Translate
     
     
    Export citation  
     
    Bookmark  
  15. Liberté et nécessité selon Simone Weil.Devaux Aa - 1976 - Revue de Théologie Et de Philosophie 1:1-11.
    No categories
    Translate
     
     
    Export citation  
     
    Bookmark  
  16.  39
    Is Mathematics Problem Solving or Theorem Proving?Carlo Cellucci - 2017 - Foundations of Science 22 (1):183-199.
    The question that is the subject of this article is not intended to be a sociological or statistical question about the practice of today’s mathematicians, but a philosophical question about the nature of mathematics, and specifically the method of mathematics. Since antiquity, saying that mathematics is problem solving has been an expression of the view that the method of mathematics is the analytic method, while saying that mathematics is theorem proving has been an expression of the view that the (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  17. On Proving Too Much.Moti Mizrahi - 2013 - Acta Analytica 28 (3):353-358.
    It is quite common to object to an argument by saying that it “proves too much.” In this paper, I argue that the “proving too much” charge can be understood in at least three different ways. I explain these three interpretations of the “proving too much” charge. I urge anyone who is inclined to level the “proving too much” charge against an argument to think about which interpretation of that charge one has in mind.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  18. Teaching Proving by Coordinating Aspects of Proofs with Students' Abilities.Annie Selden & John Selden - 2009 - In Despina A. Stylianou, Maria L. Blanton & Eric J. Knuth (eds.), Teaching and Learning Proof Across the Grades: A K-16 Perspective. New York, USA: Routledge. pp. 339--354.
    In this chapter we introduce concepts for analyzing proofs, and for analyzing undergraduate and beginning graduate mathematics students’ proving abilities. We discuss how coordination of these two analyses can be used to improve students’ ability to construct proofs. -/- For this purpose, we need a richer framework for keeping track of students’ progress than the everyday one used by mathematicians. We need to know more than that a particular student can, or cannot, prove theorems by induction or contradiction or (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  19. Symbolic Logic and Mechanical Theorem Proving.Chin-Liang Chang - 1973 - Academic Press.
    This book contains an introduction to symbolic logic and a thorough discussion of mechanical theorem proving and its applications. The book consists of three major parts. Chapters 2 and 3 constitute an introduction to symbolic logic. Chapters 4–9 introduce several techniques in mechanical theorem proving, and Chapters 10 an 11 show how theorem proving can be applied to various areas such as question answering, problem solving, program analysis, and program synthesis.
     
    Export citation  
     
    Bookmark   16 citations  
  20.  34
    Human-Oriented and Machine-Oriented Reasoning: Remarks on Some Problems in the History of Automated Theorem Proving[REVIEW]Furio Di Paola - 1988 - AI and Society 2 (2):121-131.
    Examples in the history of Automated Theorem Proving are given, in order to show that even a seemingly ‘mechanical’ activity, such as deductive inference drawing, involves special cultural features and tacit knowledge. Mechanisation of reasoning is thus regarded as a complex undertaking in ‘cultural pruning’ of human-oriented reasoning. Sociological counterparts of this passage from human- to machine-oriented reasoning are discussed, by focusing on problems of man-machine interaction in the area of computer-assisted proof processing.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  21. First-Order Logic and Automated Theorem Proving.Melvin Fitting - 1998 - Studia Logica 61 (2):300-302.
  22. Introduction to Hol a Theorem Proving Environment for Higher Order Logic.Michael J. C. Gordon & T. F. Melham - 1993
     
    Export citation  
     
    Bookmark   9 citations  
  23. Automated Theorem-Proving in Non-Classical Logics.Paul B. Thistlewaite, M. A. Mcrobbie & Robert K. Meyer - 1988 - Pitman Publishing.
  24. Theorem Proving in Higher Order Logics 11th International Conference, Tphols '98, Canberra, Australia, September 27-October 2, 1998 : Proceedings'. [REVIEW]J. Grundy & Malcolm Charles Newey - 1998
     
    Export citation  
     
    Bookmark  
  25. Theorem Proving in Higher Order Logics : Emerging Trends 11th International Conference, Tphols '98, Canberra, Australia, September 27-October 2, 1997 ; Supplementary Proceedings'. [REVIEW]J. Grundy & Malcolm Charles Newey - 1998
     
    Export citation  
     
    Bookmark  
  26. From Logic Design to Logic Programming Theorem Proving Techniques and P-Functions.Dominique Snyers & André Thayse - 1987
     
    Export citation  
     
    Bookmark  
  27. Proof Phenomenon as a Function of the Phenomenology of Proving.Inês Hipólito - 2015 - Progress in Biophysics and Molecular Biology 119:360-367.
    Kurt Gödel wrote (1964, p. 272), after he had read Husserl, that the notion of objectivity raises a question: “the question of the objective existence of the objects of mathematical intuition (which, incidentally, is an exact replica of the question of the objective existence of the outer world)”. This “exact replica” brings to mind the close analogy Husserl saw between our intuition of essences in Wesensschau and of physical objects in perception. What is it like to experience a mathematical (...) process? What is the ontological status of a mathematical proof? Can computer assisted provers output a proof? Taking a naturalized world account, I will assess the relationship between mathematics, the physical world and consciousness by introducing a significant conceptual distinction between proving and proof. I will propose that proving is a phenomenological conscious experience. This experience involves a combination of what Kurt Gödel called intuition, and what Husserl called intentionality. In contrast, proof is a function of that process — the mathematical phenomenon — that objectively self-presents a property in the world, and that results from a spatiotemporal unity being subject to the exact laws of nature. In this essay, I apply phenomenology to mathematical proving as a performance of consciousness, that is, a lived experience expressed and formalized in language, in which there is the possibility of formulating intersubjectively shareable meanings. (shrink)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  28.  13
    A Uniform Method for Proving Lower Bounds on the Computational Complexity of Logical Theories.Kevin J. Compton & C. Ward Henson - 1990 - Annals of Pure and Applied Logic 48 (1):1.
    A new method for obtaining lower bounds on the computational complexity of logical theories is presented. It extends widely used techniques for proving the undecidability of theories by interpreting models of a theory already known to be undecidable. New inseparability results related to the well known inseparability result of Trakhtenbrot and Vaught are the foundation of the method. Their use yields hereditary lower bounds . By means of interpretations lower bounds can be transferred from one theory to another. Complicated (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  29. Higher-Order Automated Theorem Proving.Michael Kohlhase - unknown
    The history of building automated theorem provers for higher-order logic is almost as old as the field of deduction systems itself. The first successful attempts to mechanize and implement higher-order logic were those of Huet [13] and Jensen and Pietrzykowski [17]. They combine the resolution principle for higher-order logic (first studied in [1]) with higher-order unification. The unification problem in typed λ-calculi is much more complex than that for first-order terms, since it has to take the theory of αβη-equality into (...)
    Translate
     
     
    Export citation  
     
    Bookmark   3 citations  
  30.  26
    The Web as A Tool For Proving.Petros Stefaneas & Ioannis M. Vandoulakis - 2012 - Metaphilosophy 43 (4):480-498.
    The Web may critically transform the way we understand the activity of proving. The Web as a collaborative medium allows the active participation of people with different backgrounds, interests, viewpoints, and styles. Mathematical formal proofs are inadequate for capturing Web-based proofs. This article claims that Web provings can be studied as a particular type of Goguen's proof-events. Web-based proof-events have a social component, communication medium, prover-interpreter interaction, interpretation process, understanding and validation, historical component, and styles. To demonstrate its claim, (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  31. Kant on Proving Aristotle’s Logic as Complete.Huaping Lu-Adler - 2016 - Kantian Review 21 (1):1-26.
    Kant claims that Aristotles logic as complete, explain the historical and philosophical considerations that commit him to proving the completeness claim and sketch the proof based on materials from his logic corpus. The proof will turn out to be an integral part of Kant’s larger reform of formal logic in response to a foundational crisis facing it.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  32.  21
    Reuben Hersh. Proving is Convincing and Explaining. Educational Studies in Mathematics, Vol. 24 , Pp. 389–399. - Philip J. Davis. Visual Theorems. Educational Studies in Mathematics, Vol. 24 , Pp. 333–344. - Gila Hanna and H. Niels Jahnke. Proof and Application. Educational Studies in Mathematics, Vol. 24 , Pp. 421–438. - Daniel Chazan. High School Geometry Students' Justification for Their Views of Empirical Evidence and Mathematical Proof. Educational Studies in Mathematics Vol. 24 ,Pp. 359–387. [REVIEW]Don Fallis - 1998 - Journal of Symbolic Logic 63 (3):1196-1200.
    Reviewed Works:Reuben Hersh, Proving is Convincing and Explaining.Philip J. Davis, Visual Theorems.Gila Hanna, H. Niels Jahnke, Proof and Application.Daniel Chazan, High School Geometry Students' Justification for Their Views of Empirical Evidence and Mathematical Proof.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  33.  46
    Proving Possession of Arbitrary Secrets While Not Giving Them Away: New Protocols and a Proof in GNY Logic.Wouter Teepe - 2006 - Synthese 149 (2):409-443.
    This paper introduces and describes new protocols for proving knowledge of secrets without giving them away: if the verifier does not know the secret, he does not learn it. This can all be done while only using one-way hash functions. If also the use of encryption is allowed, these goals can be reached in a more efficient way. We extend and use the GNY authentication logic to prove correctness of these protocols.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  34.  41
    Theorem Proving for Conditional Logics: CondLean and GOALD U CK.Nicola Olivetti & Gian Luca Pozzato - 2008 - Journal of Applied Non-Classical Logics 18 (4):427-473.
    In this paper we focus on theorem proving for conditional logics. First, we give a detailed description of CondLean, a theorem prover for some standard conditional logics. CondLean is a SICStus Prolog implementation of some labeled sequent calculi for conditional logics recently introduced. It is inspired to the so called “lean” methodology, even if it does not fit this style in a rigorous manner. CondLean also comprises a graphical interface written in Java. Furthermore, we introduce a goal-directed proof search (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  35.  27
    First‐Year Secondary School Mathematics Students' Conceptions of Mathematical Proofs and Proving.Savas Basturk - 2010 - Educational Studies 36 (3):283-298.
    The aim of this study is to investigate students’ conceptions about proof in mathematics and mathematics teaching. A five‐point Likert‐type questionnaire was administered in order to gather data. The sample of the study included 33 first‐year secondary school mathematics students . The data collected were analysed and interpreted using the methods of qualitative and quantitative analysis. The results have revealed that the students think that mathematical proof has an important place in mathematics and mathematics education. The students’ studying methods for (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  36.  70
    On Theorem Proving in Annotated Logics.Mi Lu & Jinzhao Wu - 2000 - Journal of Applied Non-Classical Logics 10 (2):121-143.
    ABSTRACT We are concerned with the theorem proving in annotated logics. By using annotated polynomials to express knowledge, we develop an inference rule superposition. A proof procedure is thus presented, and an improvement named M- strategy is mainly described. This proof procedure uses single overlaps instead of multiple overlaps, and above all, both the proof procedure and M-strategy are refutationally complete.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  37.  35
    Turner on Reason and Proving God’s Existence.Bruce Milem - 2007 - Philosophy and Theology 19 (1/2):79-94.
    In Faith, Reason and the Existence of God, Denys Turner defends the possibility of proving God’s existence on Christian and philosophical grounds. He responds to Kantian objections by developing a theory of reason derived from Thomas Aquinas. Turner’s work shifts the debate about God’s existence to the problem of determining which concept of reason is correct. I argue that this problem is extremely difficult and perhaps insoluble, because it requires using reason to resolve a dispute about reason. Consequently, Turner’s (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  38.  8
    Bridging Theorem Proving and Mathematical Knowledge Retrieval.Christoph Benzmüller, Andreas Meier & Volker Sorge - 2004 - In Dieter Hutter & Werner Stephan (eds.), Mechanizing Mathematical Reasoning: Essays in Honor of Jörg Siekmann on the Occasion of His 60th Birthday. Springer. pp. 277-296.
    Accessing knowledge of a single knowledge source with different client applications often requires the help of mediator systems as middleware components. In the domain of theorem proving large efforts have been made to formalize knowledge for mathematics and verification issues, and to structure it in databases. But these databases are either specialized for a single client, or if the knowledge is stored in a general database, the services this database can provide are usually limited and hard to adjust for (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  39.  43
    The A Priori Meaningfulness Measure and Resolution Theorem Proving.Joseph S. Fulda & Kevin De Fontes - 1989 - Journal of Experimental and Theoretical Artificial Intelligence 1 (3):227-230.
    Demonstrates the validity of the measure presented in "Estimating Semantic Content" on textbook examples using (binary) resolution [a generalization of disjunctive syllogism] theorem proving; the measure is based on logical probability and is the mirror image of logical form; it dates to Popper.
    Direct download  
     
    Export citation  
     
    Bookmark  
  40.  52
    Put My Galakmid Coin Into the Dispenser and Kick It: Computational Linguistics and Theorem Proving in a Computer Game. [REVIEW]Alexander Koller, Ralph Debusmann, Malte Gabsdil & Kristina Striegnitz - 2004 - Journal of Logic, Language and Information 13 (2):187-206.
    We combine state-of-the-art techniques from computational linguisticsand theorem proving to build an engine for playing text adventures,computer games with which the player interacts purely through naturallanguage. The system employs a parser for dependency grammar and ageneration system based on TAG, and has components for resolving andgenerating referring expressions. Most of these modules make heavy useof inferences offered by a modern theorem prover for descriptionlogic. Our game engine solves some problems inherent in classical textadventures, and is an interesting test case (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  41.  23
    Connection-Driven Inductive Theorem Proving.Christoph Kreitz & Brigitte Pientka - 2001 - Studia Logica 69 (2):293-326.
    We present a method for integrating rippling-based rewriting into matrix-based theorem proving as a means for automating inductive specification proofs. The selection of connections in an inductive matrix proof is guided by symmetries between induction hypothesis and induction conclusion. Unification is extended by decision procedures and a rippling/reverse-rippling heuristic. Conditional substitutions are generated whenever a uniform substitution is impossible. We illustrate the integrated method by discussing several inductive proofs for the integer square root problem as well as the algorithms (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  42.  52
    Identity in Modal Logic Theorem Proving.Francis J. Pelletier - 1993 - Studia Logica 52 (2):291 - 308.
    THINKER is an automated natural deduction first-order theorem proving program. This paper reports on how it was adapted so as to prove theorems in modal logic. The method employed is an indirect semantic method, obtained by considering the semantic conditions involved in being a valid argument in these modal logics. The method is extended from propositional modal logic to predicate modal logic, and issues concerning the domain of quantification and existence in a world's domain are discussed. Finally, we look (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  43.  15
    Theorem Proving in Lean.Jeremy Avigad, Leonardo de Moura & Soonho Kong - unknown
    Formal verification involves the use of logical and computational methods to establish claims that are expressed in precise mathematical terms. These can include ordinary mathematical theorems, as well as claims that pieces of hardware or software, network protocols, and mechanical and hybrid systems meet their specifications. In practice, there is not a sharp distinction between verifying a piece of mathematics and verifying the correctness of a system: formal verification requires describing hardware and software systems in mathematical terms, at which point (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  44.  23
    The Reality of Time and the Existence of God: The Project of Proving God's Existence.Philip L. Quinn - 1988 - Review of Metaphysics 42 (2):378-379.
    This book is an essay in systematic metaphysics. Its ambitious aim is to present an a posteriori causal proof for the existence of God. In addition to its metaphysical assault on the problem of proving God's existence, it contains forays into epistemology, philosophy of language, philosophy of logic and philosophy of science. As a result, the book is a rich and complex tapestry of argumentation that well illustrates its author's contention that philosophy is a "seamless web". Braine has evidently (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  45.  10
    Theorem Proving and Model Building with the Calculus KE.Jeremy Pitt & Jim Cunningham - 1996 - Logic Journal of the IGPL 4 (1):129-150.
    A Prolog implementation of a new theorem-prover for first-order classical logic is described. The prover is based on the calculus KE and the rules used for analysing quantifiers in free variable semantic tableaux. A formal specification of the rules used in the implementation is described, for which soundness and completeness is straightforwardly verified. The prover has been tested on the first 47 problems of the Pelletier set, and its performance compared with a state of the art semantic tableaux theorem-prover. It (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  46.  9
    Theorem Proving Via Uniform Proofs>.Alberto Momigliano - unknown
    Uniform proofs systems have recently been proposed [Mi191j as a proof-theoretic foundation and generalization of logic programming. In [Mom92a] an extension with constructive negation is presented preserving the nature of abstract logic programming language. Here we adapt this approach to provide a complete theorem proving technique for minimal, intuitionistic and classical logic, which is totally goal-oriented and does not require any form of ancestry resolution. The key idea is to use the Godel-Gentzen translation to embed those logics in the (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  47.  8
    A New Technique for Proving Realisability and Consistency Theorems Using Finite Paraconsistent Models of Cut‐Free Logic.Arief Daynes - 2006 - Mathematical Logic Quarterly 52 (6):540-554.
    A new technique for proving realisability results is presented, and is illustrated in detail for the simple case of arithmetic minus induction. CL is a Gentzen formulation of classical logic. CPQ is CL minus the Cut Rule. The basic proof theory and model theory of CPQ and CL is developed. For the semantics presented CPQ is a paraconsistent logic, i.e. there are non-trivial CPQ models in which some sentences are both true and false. Two systems of arithmetic minus induction (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  48.  3
    PA( Aa ).James H. Schmerl - 1995 - Notre Dame Journal of Formal Logic 36 (4):560-569.
    The theory PA(aa), which is Peano Arithmetic in the context of stationary logic, is shown to be consistent. Moreover, the first-order theory of the class of finitely determinate models of PA(aa) is characterized.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  49. Programming Men and Machines. Changing Organisation in the Artillery Computations at Aberdeen Proving Ground.Maarten Bullynck - 2018 - Revue de Synthèse 139 (3-4):241-266.
    After the First World War mathematics and the organisation of ballistic computations at Aberdeen Proving Ground changed considerably. This was the basis for the development of a number of computing aids that were constructed and used during the years 1920 to 1950. This article looks how the computational organisation forms and changes the instruments of calculation. After the differential analyzer relay-based machines were built by Bell Labs and, finally, the ENIAC, one of the first electronic computers, was built, to (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  50. Making Theorem-Proving in Modal Logic Easy.Paul Needham - 2009 - In Lars-Göran Johansson, Jan Österberg & Rysiek Śliwiński (eds.), Logic, Ethics and All That Jazz: Essays in Honour of Jordan Howard Sobel. Uppsala, Sverige: pp. 187-202.
    A system for the modal logic K furnishes a simple mechanical process for proving theorems.
     
    Export citation  
     
    Bookmark  
1 — 50 / 1000