• PhilPapers
  • PhilPeople
  • PhilArchive
  • PhilEvents
  • PhilJobs
  • Sign in
PhilPeople
 
  • Sign in
  • News Feed
  • Find Philosophers
  • Departments
  • Radar
  • Help
 
profile-cover
Drag to reposition
profile picture

Emmanuel Lopez

  •  Home
  •  Publications
    42
    • Most Recent
    • Most Downloaded
    • Topics
  •  News and Updates
    1

 More details
  • All publications (42)
  •  94
    Equivalence between semantics for intuitionism. I
    Journal of Symbolic Logic 46 (4): 773-780. 1981.
    Intuitionistic Logic
  •  61
    Review: Andrzej Grzegorczyk, Olgierd Wojtasiewicz, Waclaw Zawadowski, An Outline of Mathematical Logic. Fundamental Results and Notions Explained with All Details (review)
    Journal of Symbolic Logic 48 (1): 220-222. 1983.
    Logic and Philosophy of Logic
  • Intuitionistic equivalence
    with Francisco Miraglia
    Manuscrito 22 (2): 205. 1999.
    Intuitionistic Logic
  • ¿ Es el trilema de Fishkin un verdadero trilema?
    Análisis Filosófico. forthcoming.
  •  27
    Review: W. W. Tait, J. N. Crossley, M. A. E. Dummett, Infinitely Long Terms of Transfinite Type (review)
    Journal of Symbolic Logic 40 (4): 623-624. 1975.
    Logic and Philosophy of LogicLogic and Philosophy of Logic, Miscellaneous
  •  19
    König's lemma, the ω-Rule and primitive recursive arithmetic
    Archive for Mathematical Logic 25 (1): 67-74. 1985.
    Areas of Mathematics
  •  25
    Sets, classes and the propositional calculus
    Manuscrito 28 (2): 417-448. 2005.
    The propositional calculus AoC, “Algebra of Classes”,and the extended propositional calculus EAC, “Extended Algebra ofClasses” are introduced in this paper. They are extensions, by additionalpropositional functions which are not invariant under the biconditional,of the corresponding classical propositional systems. Theirorigin lies in an analysis, motivated by Cantor’s concept of the cardinalnumbers, of A. P. Morse’s impredicative, polysynthetic set theory
    LogicsNonclassical Logics
  •  28
    Chateaubriand on propositional logic
    Manuscrito 31 (1): 103-113. 2008.
    In Logical Forms Part II, Chateaubriand begins the Chapter on “Propositional Logic” by considering the reading of the ‘conditional’ by ‘implies’; in fact he states that:There is a confusion, as a matter of fact, and it runs deep, but it is a confusion in propositional logic itself, and the mathematician’s reading is a rather sensible one.After a careful, erudite analysis of various philosophical viewpoints of logic, Chateaubriand comes to the conclusion that:Pure propositional logic, as just cha…Read more
    In Logical Forms Part II, Chateaubriand begins the Chapter on “Propositional Logic” by considering the reading of the ‘conditional’ by ‘implies’; in fact he states that:There is a confusion, as a matter of fact, and it runs deep, but it is a confusion in propositional logic itself, and the mathematician’s reading is a rather sensible one.After a careful, erudite analysis of various philosophical viewpoints of logic, Chateaubriand comes to the conclusion that:Pure propositional logic, as just characterized, belongs to ontological logic, and it does not include a theory of deduction as a human activity. This is a part of epistemological logic, and is more closely connected to the applications of pure propositional logic.An implicit assumption in Chateaubriand’s reasoning appears to be that propositions have a timeless status. I will present arguments for the opposite viewpoint which leads to an analysis of Propositional Logic not covered under Chateaubriand’s monograph and perhaps resolves some conflicts therein; much as the conflict between the Intuitionist and Classical Mathematician on whether every function on the Reals is continuous is resolved by the realization that they are talking about different “entities”.Em Logical Forms II, Chateaubriand inicia o capítulo “Lógica Proposi-cional” considerando a leitura do ‘condicional’ como ‘implica’. De fato, ele diz o seguinte:Na verdade, existe uma confusão, e ela é profunda, mas é uma confusão na lógica proposicional ela mesma, e a leitura de um matemático é bastante sensível.Depois de uma análise cuidadosa e erudita dos vários pontos de vista filosóficos da lógica , Chateaubriand chega à conclusão que:A lógica proposicional pura, tal como aqui caracterizada, pertence à lógica ontológica, e não inclui uma teoria da dedução como atividade humana. Isto é parte da lógica epistemológica, e é mais intimamente conectada às aplicações da lógica proposicional.Uma premissa implícita no raciocínio de Chateaubriand parece ser a de que proposições têm um estatuto atemporal. Eu argumentarei em favor da visão oposta, que leva a uma análise da Lógica Proposicional não abordada no texto de Chateaubriand e que talvez resolva alguns conflitos. Muito do conflito entre Intuicionistas e Matemáticos Clássicos sobre se toda função sobre os números reais é contínua é resolvido pela compreensão de que eles estão falando de “entidades” diferentes
    Areas of MathematicsSemantics
  • Definitions: The Primitive Concept of Logics or the Le'sniewski-Tarski Legacy Vol. 401
    with Francisco Miraglia
    Polska Akademia Nauk, Instytut Matematyczny. 2002.
    Alfred Tarski
  •  65
    The mental and subjective skin: Emotion, empathy, feelings and thermography
    with E. Domínguez, V. Juárez Ramos, J. de la Fuente, A. Meins, O. Iborra, G. Gálvez, M. A. Rodríguez-Artacho, and E. Gómez-Milán
    Consciousness and Cognition 34 149-162. 2015.
    Consciousness and Psychology
  •  40
    Variations on A System Of Gentzen
    Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 27 (25-30): 385-389. 1981.
    Proof Theory
  •  69
    Čudnovskiǐ G. V.. Some results in the theory of infinitely long expressions. English translation of XXXVII 215 by Mendelson E.. Soviet mathematics, vol. 9 no. 2 , pp. 556–559
    Journal of Symbolic Logic 37 (1): 202-203. 1972.
    Model Theory
  •  99
    Keisler H. Jerome. Model theory for infinitary logic. Logic with countable conjunctions and finite quantifiers. Studies in logic and the foundations of mathematics, vol. 62, North-Holland Publishing Company, Amsterdam and London 1971, x + 208 pp
    Journal of Symbolic Logic 38 (3): 522-523. 1973.
    Logical ExpressionsModel Theory
  •  76
    Konstrukcje a logika beznegacyjna
    Studia Logica 30 (1): 20-20. 1972.
    Logic and Philosophy of Logic
  •  259
    Implicational logics in natural deduction systems
    Journal of Symbolic Logic 47 (1): 184-186. 1982.
    Logic and Philosophy of LogicNonclassical LogicsProof Theory
  •  17
    Further applications of ultra-conservative ω-rules
    Archive for Mathematical Logic 22 (3-4): 89-102. 1980.
  •  67
    Engeler Erwin. Zur Beweistheorie von Sprachen mit unendlich langen Formeln. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 7 , pp. 213–218 (review)
    Journal of Symbolic Logic 36 (4): 685-685. 1971.
    Logic and Philosophy of Logic
  •  61
    Barwise Jon and Kunen Kenneth. Hanf numbers for fragments of L∞ω. Israel journal of mathematics, vol. 10 , pp. 306–320
    Journal of Symbolic Logic 49 (1): 315. 1984.
    Model Theory
  •  96
    A second paper "on the interpolation theorem for the logic of constant domains"
    Journal of Symbolic Logic 48 (3): 595-599. 1983.
    Logic and Philosophy of LogicNonclassical Logics
  •  41
    The Logic of Classes
    Logic Journal of the IGPL 15 (5-6): 689-706. 2007.
    An extension of the Quantified Propositional Calculus1 obtained by the addition of two binary propositional functions is put forward as an inheritor of E. Schröder's “Algebra der Logik”. The formal system is itself not new, in fact it forms part of A. P. Morse's “A Theory of Sets”; although the latter is considered as a first-order system. Since the additional propositional functions are not invariant under the logical biconditional, this system–and many others naturally obtained from it–give us…Read more
    An extension of the Quantified Propositional Calculus1 obtained by the addition of two binary propositional functions is put forward as an inheritor of E. Schröder's “Algebra der Logik”. The formal system is itself not new, in fact it forms part of A. P. Morse's “A Theory of Sets”; although the latter is considered as a first-order system. Since the additional propositional functions are not invariant under the logical biconditional, this system–and many others naturally obtained from it–give us a collection of examples of non-standard, but mathematically meaningful, propositional systems.
    Science, Logic, and MathematicsAreas of Mathematics
  •  70
    Kenneth Kunen. Implicit definability and infinitary languages. The journal of symbolic logic, vol. 33 , pp. 446–451
    Journal of Symbolic Logic 35 (2): 341-342. 1970.
    Model TheoryLogics
  •  105
    Jon Barwise. Infinitary logic and admissible sets. The journal of symbolic logic, vol. 34 , pp. 226–252
    Journal of Symbolic Logic 36 (1): 156-157. 1971.
    Infinitary Logic
  •  254
    Meeting of the association for symbolic logic: Atlanta 1973
    with C. Ward Henson, Bjarni Jónsson, and Michael D. Resnik
    Journal of Symbolic Logic 39 (2): 390-405. 1974.
    Logic and Philosophy of LogicLogic and Philosophy of Logic, Misc
  •  76
    W. W. Tait. Infinitely long terms of transfinite type. Formal systems and recursive functions, Proceedings of the Eighth Logic Colloquium, Oxford, July 1963, edited by J. N. Crossley and M. A. E. Dummett, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam 1965, pp. 176–185
    Journal of Symbolic Logic 40 (4): 623-624. 1975.
    Logic and Philosophy of Logic
  •  76
    Wilbur John WalkoeJr., Finite partially-ordered quantification. The journal of symbolic logic, vol. 35 , pp. 535–555
    Journal of Symbolic Logic 40 (2): 239-240. 1975.
    Logical ExpressionsModel Theory
  •  76
    Remarks on the church-Rosser property
    Journal of Symbolic Logic 55 (1): 106-112. 1990.
    A reduction algebra is defined as a set with a collection of partial unary functions (called reduction operators). Motivated by the lambda calculus, the Church-Rosser property is defined for a reduction algebra and a characterization is given for those reduction algebras satisfying CRP and having a measure respecting the reductions. The characterization is used to give (with 20/20 hindsight) a more direct proof of the strong normalization theorem for the impredicative second order intuitionistic…Read more
    A reduction algebra is defined as a set with a collection of partial unary functions (called reduction operators). Motivated by the lambda calculus, the Church-Rosser property is defined for a reduction algebra and a characterization is given for those reduction algebras satisfying CRP and having a measure respecting the reductions. The characterization is used to give (with 20/20 hindsight) a more direct proof of the strong normalization theorem for the impredicative second order intuitionistic propositional calculus
    Proof Theory
  •  99
    On the interpolation theorem for the logic of constant domains
    Journal of Symbolic Logic 46 (1): 87-88. 1981.
    Logic and Philosophy of LogicNonclassical Logics
  •  115
    David W. Kueker. Generalized interpolation and definability. Annals of mathematical logic, vol. 1 no. 4 , pp. 423–468
    Journal of Symbolic Logic 39 (2): 337-338. 1974.
    Model Theory
  •  79
    Circumscription within monotonic inferences
    Journal of Symbolic Logic 53 (3): 888-904. 1988.
    A conservative extension of first order logic, suitable for circumscriptive inference, is introduced
    Logic and Philosophy of LogicLogics
  •  68
    Constructions and negationless logic
    Studia Logica 30 (1). 1972.
    Logic and Philosophy of LogicSemantics
  • Prev.
  • 1
  • 2
  • Next
PhilPeople logo

On this site

  • Find a philosopher
  • Find a department
  • The Radar
  • Index of professional philosophers
  • Index of departments
  • Help
  • Acknowledgments
  • Careers
  • Contact us
  • Terms and conditions

Brought to you by

  • The PhilPapers Foundation
  • The American Philosophical Association
  • Centre for Digital Philosophy, Western University
PhilPeople is currently in Beta Sponsored by the PhilPapers Foundation and the American Philosophical Association
Feedback