Related categories
Subcategories:
6192 found
Search inside:
(import / add options)   Order:
1 — 50 / 6192
Material to categorize
  1. Andrew Aberdein (2006). The Elements: Books I-XIII by Euclid. Barnes & Noble.
    Remove from this list  
    Translate
     
     
    Export citation  
     
    My bibliography  
  2. Alexander Abian (1968). On Definitions of Cuts and Completion of Partially Ordered Sets. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 14 (19):299-302.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  3. Alexander Abian & David Deever (1967). On the Minimal Length of Sequences Representing Simply Ordered Sets. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 13 (1-2):21-23.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  4. S. Abramsky, D. Gabbay & T. Maibaurn (eds.) (1992). Handbook of Logic in Computer Science. Oxford University Press.
    Remove from this list  
    Translate
     
     
    Export citation  
     
    My bibliography   4 citations  
  5. Juan José Acero (2003). Conceptions of the Mind... That Do Not Loose Sight of Logic. Theoria: Revista de Teoría, Historia y Fundamentos de la Ciencia 18 (1):17-25.
    Which is the relation between logic and philosophy of mind? This work tries to answer that question by shortly examining, first, the place that is assigned to logic in three current views of the mind: Computationalism, Interpretativism and Naive Naturalism. Secondly, the classical debate between psychologism and antipsychologism is reviewed -the question about whether logic is or not a part of psychology- and it is indicated in which place of such debate the three mentioned conceptions of mind are located.
    Remove from this list   Direct download  
     
    Export citation  
     
    My bibliography  
  6. Zofia Adamowicz & Roman Kossak (1988). A Note on BΣn and an Intermediate Induction Schema. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 34 (3):261-264.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  7. Andrew Adler (1969). Extensions of Non-Standard Models of Number Theory. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 15 (19):289-290.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  8. Tarek Sayed Ahmed (2009). A Simple Construction of Representable Relation Algebras with Non-Representable Completions. Mathematical Logic Quarterly 55 (3):237-244.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  9. Hassan Ait-Kaci & Maurice Nivat (eds.) (1989). Resolution of Equations in Algebraic Structures. Academic Press.
    Remove from this list  
     
    Export citation  
     
    My bibliography  
  10. Seiki Akama (1988). On the Proof Method for Constructive Falsity. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 34 (5):385-392.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  11. L. Alberucci, J. Krahenbuhl & T. Studer (2014). Justifying Induction on Modal -Formulae. Logic Journal of the IGPL 22 (6):805-817.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  12. Mitrofan Nikolaevich[from old catalog] Alekseev (1959). Dialektika Form Myshlenii͡a.
    Remove from this list  
     
    Export citation  
     
    My bibliography  
  13. James Alf (1948). The Priest. Thought: A Journal of Philosophy 23 (3):565-566.
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  14. M. Alizadeh & N. Joharizadeh (2015). Counting Weak Heyting Algebras on Finite Distributive Lattices. Logic Journal of the IGPL 23 (2):247-258.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  15. Majid Alizadeh, Mohammad Ardeshir & Wim Ruitenburg (2016). Boolean Algebras in Visser Algebras. Notre Dame Journal of Formal Logic 57 (1):141-150.
    We generalize the double negation construction of Boolean algebras in Heyting algebras to a double negation construction of the same in Visser algebras. This result allows us to generalize Glivenko’s theorem from intuitionistic propositional logic and Heyting algebras to Visser’s basic propositional logic and Visser algebras.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  16. C. Alkor (1980). On A Theory of Classes. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 26 (22-24):337-342.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  17. Joseph Almog (1996). The What and the How II: Reals and Mights. Noûs 30 (4):413-433.
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  18. Carlos Álvarez (1987). Sobre Las Posibilidades de Una Equivalencia Para El Fundamento de la Aritmética. Theoria 2 (2):345-364.
    Our aim in this paper is to analyse the possibilities of a logical or epistemological equivalence between the projets of R. Dedekind and G. Frege for the foundations of arithmetic. It is well know that both of them have a “logicist” point of vew. But we think that even if some coincidences exist in the wa y they define the main concepts of arithmetic, some important differences remain.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  19. Klaus Ambos-Spies (1985). Anti-Mitotic Recursively Enumerable Sets. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 31 (29-30):461-477.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  20. Alice Ambrose (1959). Proof and the Theorem Proved. Mind 68 (272):435-445.
    Remove from this list   Direct download (7 more)  
     
    Export citation  
     
    My bibliography  
  21. Alice Ambrose & W. V. Quine (1951). Methods of Logic. Philosophical Review 60 (4):595.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  22. Mohamed A. Amer (1985). Classification of Boolean Algebras of Logic and Probabilities Defined on Them by Classical Models. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 31 (31-34):509-515.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  23. Scientific American, Randomness in Arithmetic.
    What could be more certain than the fact that 2 plus 2 equals 4? Since the time of the ancient Greeks mathematicians have believed there is little---if anything---as unequivocal as a proved theorem. In fact, mathematical statements that can be proved true have often been regarded as a more solid foundation for a system of thought than any maxim about morals or even physical objects. The 17th-century German mathematician and philosopher Gottfried Wilhelm Leibniz even envisioned a ``calculus'' of reasoning such (...)
    Remove from this list  
    Translate
     
     
    Export citation  
     
    My bibliography  
  24. Lucas Amiras (2003). Über den Produktiv-Operativen Ansatz Zur Begründung der Geometrie in der Protophysik. Journal for General Philosophy of Science / Zeitschrift für Allgemeine Wissenschaftstheorie 34 (1):133-158.
    On the productive-operative approach to the foundations of geometry in protophysics. Attempts to establish a foundation to elementary geometry as a theory of spatial figures in Protophysics are surveyed in Section 1. An idea suggested by H. Dingler was to extract the basic properties of the geometrical primitive notions from descriptions of the operations performed in the ‘first’ production of the corresponding objects. P. Janich presents this ‘productive-operative’ approach as a succesful methodical alternative to the ‘geometry of forms’ of R. (...)
    Remove from this list   Direct download (7 more)  
     
    Export citation  
     
    My bibliography  
  25. Alan Ross Anderson, Nuel D. Belnap & John R. Wallace (1960). Independent Axiom Schemata for the Pure Theory of Entailment. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 6 (1-6):93-95.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  26. Mats Andersson & Bo Berndtsson (2002). Non-Holomorphic Functional Calculus for Commuting Operators with Real Spectrum. Annali della Scuola Normale Superiore di Pisa 1 (4):925-955.
    We consider $n$-tuples of commuting operators $a=a_1,\ldots,a_n$ on a Banach space with real spectra. The holomorphic functional calculus for $a$ is extended to algebras of ultra-differentiable functions on $\mathbb{R}^n$, depending on the growth of $\Vert \exp \Vert $, $t\in \mathbb{R}^n$, when $|t|\rightarrow \infty $. In the non-quasi-analytic case we use the usual Fourier transform, whereas for the quasi-analytic case we introduce a variant of the FBI transform, adapted to ultradifferentiable classes.
    Remove from this list   Direct download  
     
    Export citation  
     
    My bibliography  
  27. Edvard Pavlovich Andreev, Institut Sotsiologicheskikh Issledovanii Sssr) & Sovetskaia Sotsiologicheskaia Assotsiatsiia (1977). Metody Sovremennoi Matematiki I Logiki V Sotsiologicheskikh Issledovaniiakh [Sbornik Statei]. In-T Sotsiol. Issledovanii.
    Remove from this list  
     
    Export citation  
     
    My bibliography  
  28. Alessandro Andretta (ed.) (2007). On Applications of Transfer Principles in Model Theory. Quaderni di Matematica.
    Remove from this list  
    Translate
     
     
    Export citation  
     
    My bibliography  
  29. Floy Andrews Doull (1996). The Principle of Excluded Middle Then and Now: Aristotle and Principia Mathematica. Animus 1:53-66.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  30. Floy Andrews (1996). The Principle of Excluded Middle Then and Now: Aristotle and Principia Mathematica. Animus 1:53-66.
    The prevailing truth-functional logic of the twentieth century, it is argued, is incapable of expressing the subtlety and richness of Aristotle's Principle of Excluded Middle, and hence cannot but misinterpret it. Furthermore, the manner in which truth-functional logic expresses its own Principle of Excluded Middle is less than satisfactory in its application to mathematics. Finally, there are glimpses of the "realism" which is the metaphysics demanded by twentieth century logic, with the remarkable consequent that Classical logic is a particularly inept (...)
    Remove from this list  
     
    Export citation  
     
    My bibliography  
  31. James H. Andrews (1992). Logic Programming Operational Semantics and Proof Theory.
    Remove from this list  
     
    Export citation  
     
    My bibliography  
  32. P. B. Andrews (1965). A Transfinite Type Theory with Type Variables. Amsterdam: North-Holland Pub. Co..
    Remove from this list   Direct download  
     
    Export citation  
     
    My bibliography   2 citations  
  33. P. B. Andrews & Mitsuru Yasuhara (2003). REVIEWS-An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof. Bulletin of Symbolic Logic 9 (3):408.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  34. Peter B. Andrews (1974). Provability in Elementary Type Theory. Mathematical Logic Quarterly 20 (25‐27):411-418.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  35. Peter B. Andrews (1974). Provability in Elementary Type Theory. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 20 (25-27):411-418.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  36. T. G. Andrews (1940). The Effect of Benzedrine Sulfate on Syllogistic Reasoning. Journal of Experimental Psychology 26 (4):423.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  37. Uri Andrews (2011). New Spectra of Strongly Minimal Theories in Finite Languages. Annals of Pure and Applied Logic 162 (5):367-372.
    We describe strongly minimal theories Tn with finite languages such that in the chain of countable models of Tn, only the first n models have recursive presentations. Also, we describe a strongly minimal theory with a finite language such that every non-saturated model has a recursive presentation.
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  38. Irving H. Anellis (1991). The Philosophy of Set Theory: A Historical Introduction to Cantor's ParadiseMary Tiles. Isis 82 (1):173-174.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  39. Mitsumasa Anno & Akihiro Nozaki (1985). Anno's Hat Tricks.
    Remove from this list  
     
    Export citation  
     
    My bibliography  
  40. Coelho Antonio (2011). Da costa on ontology: a naturalisticinterpretation. Manuscrito 34 (1).
    Remove from this list  
    Translate
      Direct download  
     
    Export citation  
     
    My bibliography  
  41. Hiroshi Aoyama (1998). The Semantic Completeness of a Global Intuitionistic Logic. Mathematical Logic Quarterly 44 (2):167-175.
    In this paper we will study a formal system of intuitionistic modal predicate logic. The main result is its semantic completeness theorem with respect to algebraic structures. At the end of the paper we will also present a brief consideration of its syntactic relationships with some similar systems.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  42. Leo Apostel (1982). The Future of Piagetian Logic. Revue Internationale de Philosophie 36 (4):567.
    Remove from this list  
     
    Export citation  
     
    My bibliography   1 citation  
  43. K. R. Apt & W. Marek (1974). Second Order Arithmetic and Related Topics. Annals of Mathematical Logic 6 (3-4):177-229.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography   6 citations  
  44. Krzysztof R. Apt & Franco Turini (1995). Meta-Logics and Logic Programming.
    Remove from this list  
     
    Export citation  
     
    My bibliography   1 citation  
  45. Arthur W. Apter (2005). An Easton Theorem for Level by Level Equivalence. Mathematical Logic Quarterly 51 (3):247-253.
    We establish an Easton theorem for the least supercompact cardinal that is consistent with the level by level equivalence between strong compactness and supercompactness. In both our ground model and the model witnessing the conclusions of our theorem, there are no restrictions on the structure of the class of supercompact cardinals. We also briefly indicate how our methods of proof yield an Easton theorem that is consistent with the level by level equivalence between strong compactness and supercompactness in a universe (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  46. Arthur W. Apter (2000). A New Proof of a Theorem of Magidor. Archive for Mathematical Logic 39 (3):209-211.
    We give a new proof using iterated Prikry forcing of Magidor's theorem that it is consistent to assume that the least strongly compact cardinal is the least supercompact cardinal.
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  47. Arthur W. Apter & Mirna Džamonja (2001). Some Remarks on a Question of D. H. Fremlin Regarding Ε-Density. Archive for Mathematical Logic 40 (7):531-540.
    We show the relative consistency of ℵ1 satisfying a combinatorial property considered by David Fremlin (in the question DU from his list) in certain choiceless inner models. This is demonstrated by first proving the property is true for Ramsey cardinals. In contrast, we show that in ZFC, no cardinal of uncountable cofinality can satisfy a similar, stronger property. The questions considered by D. H. Fremlin are if families of finite subsets of ω1 satisfying a certain density condition necessarily contain all (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  48. P. D. Aquino (2001). Quotient Fields of a Model of IDelta~0 + Omega~1. Mathematical Logic Quarterly 47 (3):305-314.
    Remove from this list  
     
    Export citation  
     
    My bibliography  
  49. Lennart Aqvist (1991). Solution to Chisholm's Paradox. In Georg Schurz (ed.), Advances in Scientific Philosophy. pp. 24--127.
    Remove from this list   Direct download  
     
    Export citation  
     
    My bibliography  
  50. Lennart Åqvist (1965). A New Approach to the Logical Theory of Interrogatives. [Uppsala].
    Remove from this list  
     
    Export citation  
     
    My bibliography   8 citations  
1 — 50 / 6192