Related categories
Subcategories:
4667 found
Search inside:
(import / add options)   Order:
1 — 50 / 4667
Material to categorize
  1. Mitrofan Nikolaevich[from old catalog] Alekseev (1959). Dialektika Form Myshlenii͡a.
    Remove from this list  
     
    Export citation  
     
    My bibliography  
  2. 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  
  3. 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  
  4. 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  
  5. Alessandro Andretta (ed.) (2007). On Applications of Transfer Principles in Model Theory. Quaderni di Matematica.
    Remove from this list  
    Translate
     
     
    Export citation  
     
    My bibliography  
  6. 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  
  7. 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  
  8. James H. Andrews (1992). Logic Programming Operational Semantics and Proof Theory. Monograph Collection (Matt - Pseudo).
    Remove from this list  
     
    Export citation  
     
    My bibliography  
  9. 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  
  10. 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  
  11. 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  
  12. 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  
  13. Mitsumasa Anno & Akihiro Nozaki (1985). Anno's Hat Tricks. Monograph Collection (Matt - Pseudo).
    Remove from this list  
     
    Export citation  
     
    My bibliography  
  14. Coelho Antonio (2011). Da costa on ontology: a naturalisticinterpretation. Manuscrito 34 (1).
    Remove from this list  
    Translate
      Direct download  
     
    Export citation  
     
    My bibliography  
  15. 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  
  16. 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  
  17. 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  
  18. Krzysztof R. Apt & Franco Turini (1995). Meta-Logics and Logic Programming. Monograph Collection (Matt - Pseudo).
    Remove from this list  
     
    Export citation  
     
    My bibliography   1 citation  
  19. 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  
  20. 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  
  21. 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  
  22. 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  
  23. Lennart Aqvist (1991). Solution to Chisholm's Paradox. In Georg Schurz (ed.), Advances in Scientific Philosophy. 24--127.
    Remove from this list   Direct download  
     
    Export citation  
     
    My bibliography  
  24. Lennart Åqvist (1965). A New Approach to the Logical Theory of Interrogatives. [Uppsala].
    Remove from this list  
     
    Export citation  
     
    My bibliography   8 citations  
  25. Regina Arag N. (1995). Some Boolean Algebras with Finitely Many Distinguished Ideals I. Mathematical Logic Quarterly 41 (4):485-504.
    Remove from this list  
     
    Export citation  
     
    My bibliography  
  26. R. Aragón (2003). Some Boolean Algebras with Finitely Many Distinguished Ideals II. Mathematical Logic Quarterly 49 (3):260.
    We describe the countably saturated models and prime models of the theory Thprin of Boolean algebras with a principal ideal, the theory Thmax of Boolean algebras with a maximal ideal, the theory Thac of atomic Boolean algebras with an ideal such that the supremum of the ideal exists, and the theory Thsa of atomless Boolean algebras with an ideal such that the supremum of the ideal exists. We prove that there are infinitely many completions of the theory of Boolean algebras (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  27. Regina Aragón (1995). Some Boolean Algebras with Finitely Many Distinguished Ideals I. Mathematical Logic Quarterly 41 (4):485-504.
    We consider the theory Thprin of Boolean algebras with a principal ideal, the theory Thmax of Boolean algebras with a maximal ideal, the theory Thac of atomic Boolean algebras with an ideal where the supremum of the ideal exists, and the theory Thsa of atomless Boolean algebras with an ideal where the supremum of the ideal exists. First, we find elementary invariants for Thprin and Thsa. If T is a theory in a first order language and α is a linear (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  28. Toshiyasu Arai (2000). Ordinal Diagrams for Recursively Mahlo Universes. Archive for Mathematical Logic 39 (5):353-391.
    In this paper we introduce a recursive notation system $O(\mu)$ of ordinals. An element of the notation system is called an ordinal diagram following G. Takeuti [25]. The system is designed for proof theoretic study of theories of recursively Mahlo universes. We show that for each $\alpha<\Omega$ in $O(\mu)$ KPM proves that the initial segment of $O(\mu)$ determined by $\alpha$ is a well ordering. Proof theoretic study for such theories will be reported in [9].
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  29. Toshiyasu Arai (1998). Consistency Proof Via Pointwise Induction. Archive for Mathematical Logic 37 (3):149-165.
    We show that the consistency of the first order arithmetic $PA$ follows from the pointwise induction up to the Howard ordinal. Our proof differs from U. Schmerl [Sc]: We do not need Girard's Hierarchy Comparison Theorem. A modification on the ordinal assignment to proofs by Gentzen and Takeuti [T] is made so that one step reduction on proofs exactly corresponds to the stepping down $\alpha\mapsto\alpha [1]$ in ordinals. Also a generalization to theories $ID_q$ of finitely iterated inductive definitions is proved.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  30. Andrew Arana (2005). Review of S. Feferman's in the Light of Logic. [REVIEW] Mathematical Intelligencer 27 (4).
    We review Solomon Feferman's 1998 essay collection In The Light of Logic (Oxford University Press).
    Remove from this list  
     
    Export citation  
     
    My bibliography  
  31. João Araújo & Janusz Konieczny (2012). A Method for Finding New Sets of Axioms for Classes of Semigroups. Archive for Mathematical Logic 51 (5-6):461-474.
    We introduce a general technique for finding sets of axioms for a given class of semigroups. To illustrate the technique, we provide new sets of defining axioms for groups of exponent n, bands, and semilattices.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  32. Carlos Luis Araya-Rodriguez (1990). Schemata: A Language for Deduction and its Application in Nonmonotonic Reasoning. Dissertation, University of Kansas
    The SCHEMATA functional programming language for writing deduction systems is proposed and its applications in the construction of a Nonmonotonic Reasoning System are illustrated. SCHEMATA implements deduction as a less controlled form of computation by rewriting expressions under equivalence preservation. It approaches the representation and application of deductive knowledge using the lambda-abstraction and the lambda-conversion mechanisms of SCHEME properly modified by: equivalence preservation during evaluation, a pattern matching sublanguage on the argument expression of functions, multiple expressions, with emptiness representing failure, (...)
    Remove from this list  
     
    Export citation  
     
    My bibliography  
  33. Joannes Arboreus & Héritiers de Simon Vincent (1535). Compendaria Ioannis Arborei ... In Dialectica Elementa Introductio Ab Aliquot Erratulis Repurgata, & Locupletius Adaucta. Apud Haeredes Simonis Vincentij.
    Remove from this list  
    Translate
     
     
    Export citation  
     
    My bibliography  
  34. G. W. R. Ardley (1968). Validity in Interpretation. Philosophical Studies 17:332-333.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  35. Carlos Areces, Santiago Figueira & Sergio Mera (2012). Completeness Results for Memory Logics. Annals of Pure and Applied Logic 163 (7):961-972.
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  36. Camilo Argoty (2013). The Model Theory of Modules of a C*-Algebra. Archive for Mathematical Logic 52 (5-6):525-541.
    We study the theory of a Hilbert space H as a module for a unital C*-algebra ${\mathcal{A}}$ from the point of view of continuous logic. We give an explicit axiomatization for this theory and describe the structure of all the representations which are elementary equivalent to it. Also, we show that this theory has quantifier elimination and we characterize the model companion of the incomplete theory of all non-degenerate representations of ${\mathcal{A}}$ . Finally, we show that there is an homeomorphism (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  37. Claudius Aristotle, Antonio Marnius, Riccoboni & Haeredes Iohannis Aubrii (1606). [Aristotelous, Technes Rhetorikes Biblia Iii] = Aristotelis, Artis Rhetoricæ Siue de Arte Dicendi Libri Tres. Typis Wechelianis, Apud Claudium Marnium & Heredes Iohannis Aubrii.
    Remove from this list  
    Translate
     
     
    Export citation  
     
    My bibliography  
  38. Robin Aristotle & Smith (1997). Topics. Monograph Collection (Matt - Pseudo).
    Remove from this list  
     
    Export citation  
     
    My bibliography   1 citation  
  39. Manfred Armbrust (1970). On Set‐Theoretic Characterization of Congruence Lattices. Mathematical Logic Quarterly 16 (8):417-419.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  40. Ayda I. Arruda, R. Chuaqui & Newton C. A. da Costa (1980). Mathematical Logic in Latin America Proceedings of the IV Latin American Symposium on Mathematical Logic Held in Santiago, December 1978. Monograph Collection (Matt - Pseudo).
    Remove from this list  
     
    Export citation  
     
    My bibliography  
  41. Ayda I. Arruda, R. Chuaqui & Newton C. A. da Costa (1977). Non-Classical Logics, Model Theory, and Computability Proceedings of the Third Latin-American Symposium on Mathematical Logic, Campinas, Brazil, July 11-17, 1976. [REVIEW]
    Remove from this list  
     
    Export citation  
     
    My bibliography  
  42. Ayda I. Arruda, Newton C. A. da Costa, R. Chuaqui & Universidade Estadual de Campinas (1978). Mathematical Logic Proceedings of the First Brazilian Conference.
    Remove from this list  
     
    Export citation  
     
    My bibliography  
  43. Miloš Arsenijević (2012). The Philosophical Impact of the Löwenheim-Skolem Theorem. In Majda Trobok Nenad Miščević & Berislav Žarnić (eds.), Between Logic and Reality. Springer 59--81.
    Remove from this list   Direct download  
     
    Export citation  
     
    My bibliography  
  44. Buchsbaum Arthur & Jean-Yves Béziau, Introduction of Implication and Generalization in Axiomatic Calculi.
    Remove from this list   Direct download  
     
    Export citation  
     
    My bibliography  
  45. Federico Aschieri (2013). Learning Based Realizability for HA+ EM1 and 1-Backtracking Games: Soundness and Completeness. Annals of Pure and Applied Logic 164 (6):591-617.
    We prove a soundness and completeness result for Aschieri and Berardiʼs learning based realizability for Heyting Arithmetic plus Excluded Middle over semi-decidable statements with respect to 1-Backtracking Coquand game semantics. First, we prove that learning based realizability is sound with respect to 1-Backtracking Coquand game semantics. In particular, any realizer of an implication-and-negation-free arithmetical formula embodies a winning recursive strategy for the 1-Backtracking version of Tarski games. We also give examples of realizers and winning strategy extraction for some classical proofs. (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  46. Federico Aschieri (2012). A Constructive Analysis of Learning in Peano Arithmetic. Annals of Pure and Applied Logic 163 (11):1448-1470.
    We give a constructive analysis of learning as it arises in various computational interpretations of classical Peano Arithmetic, such as Aschieri and Berardi learning based realizability, Avigad’s update procedures and epsilon substitution method. In particular, we show how to compute in Gödel’s system T upper bounds on the length of learning processes, which are themselves represented in T through learning based realizability. The result is achieved by the introduction of a new non standard model of Gödel’s T, whose new basic (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  47. C. J. Ash (1975). Sentences with Finite Models. Mathematical Logic Quarterly 21 (1):401-404.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  48. David Asperó (2009). Forcing Notions in Inner Models. Archive for Mathematical Logic 48 (7):643-651.
    There is a partial order ${\mathbb{P}}$ preserving stationary subsets of ω 1 and forcing that every partial order in the ground model V that collapses a sufficiently large ordinal to ω 1 over V also collapses ω 1 over ${V^{\mathbb{P}}}$ . The proof of this uses a coding of reals into ordinals by proper forcing discovered by Justin Moore and a symmetric extension of the universe in which the Axiom of Choice fails. Also, using one feature of the proof of (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  49. David Asperó (2009). On a Convenient Property About {[Gamma]^{Aleph_0}}. Archive for Mathematical Logic 48 (7):653-677.
    Several situations are presented in which there is an ordinal γ such that ${\{ X \in [\gamma]^{\aleph_0} : X \cap \omega_1 \in S\,{\rm and}\, ot(X) \in T \}}$ is a stationary subset of ${[\gamma]^{\aleph_0}}$ for all stationary ${S, T\subseteq \omega_1}$ . A natural strengthening of the existence of an ordinal γ for which the above conclusion holds lies, in terms of consistency strength, between the existence of the sharp of ${H_{\omega_2}}$ and the existence of sharps for all reals. Also, an (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  50. David Asperó & Ralf Schindler (2014). Bounded Martin’s Maximum with an Asterisk. Notre Dame Journal of Formal Logic 55 (3):333-348.
    We isolate natural strengthenings of Bounded Martin’s Maximum which we call ${\mathsf{BMM}}^{*}$ and $A-{\mathsf{BMM}}^{*,++}$, and we investigate their consequences. We also show that if $A-{\mathsf{BMM}}^{*,++}$ holds true for every set of reals $A$ in $L$, then Woodin’s axiom $$ holds true. We conjecture that ${\mathsf{MM}}^{++}$ implies $A-{\mathsf{BMM}}^{*,++}$ for every $A$ which is universally Baire.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
1 — 50 / 4667