Related categories

24487 found
Order:
1 — 50 / 24487
Material to categorize
  1. Philosophy of Logic. [REVIEW]B. W. A. - 1972 - Review of Metaphysics 25 (3):565-566.
  2. Elementary Modern Logic. [REVIEW]E. J. A. - 1965 - Review of Metaphysics 19 (1):149-149.
  3. The Elements of Logic. [REVIEW]E. J. A. - 1965 - Review of Metaphysics 18 (4):772-772.
  4. Language and Clear Thinking: An Introduction to Logic. [REVIEW]P. D. M. A. - 1960 - Review of Metaphysics 14 (1):174-174.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  5. Elements of Logic. [REVIEW]R. A. A. - 1957 - Review of Metaphysics 11 (2):345-345.
  6. Individual Members 2012.Arnfinn Aamodt, Martın Abadi, Areski Nait Abdallah, Yoshihiro Abe, Andreas Abel, Francine F. Abeles, Andrew Aberdein, Kuanysh Abeshev, Nate Ackerman & Juan Pablo Acosta López - 2012 - Bulletin of Symbolic Logic 18 (4).
    Remove from this list   Direct download  
     
    Export citation  
     
    My bibliography  
  7. Individual Members 2011.Arnfinn Aamodt, Martın Abadi, Yoshihiro Abe, Andreas Abel, Francine F. Abeles, Andrew Aberdein, Kuanysh Abeshev, Nate Ackerman, Martin Adamcik & Winfred P. Adams - 2011 - Bulletin of Symbolic Logic 17 (4).
    Remove from this list  
     
    Export citation  
     
    My bibliography  
  8. Individual Members 2010.Martın Abadi, Yoshihiro Abe, Andreas Abel, Francine F. Abeles, Andrew Aberdein, J. David Abernethy, Kuanysh Abeshev, Nate Ackerman, Winfred P. Adams & Miloš Adzic - 2010 - Bulletin of Symbolic Logic 16 (4).
    Remove from this list  
     
    Export citation  
     
    My bibliography  
  9. Individual Members 2009.Martın Abadi, Yoshihiro Abe, Andreas Abel, Francine F. Abeles, Andrew Aberdein, J. David Abernethy, Nate Ackerman, Bryant Adams, Winifred P. Adams & Klaus T. Aehlig - 2009 - Bulletin of Symbolic Logic 15 (4).
    Remove from this list  
     
    Export citation  
     
    My bibliography  
  10. Individual Members 2008.Martın Abadi, Yoshihiro Abe, Andreas Abel, Francine F. Abeles, Andrew Aberdein, J. David Abernethy, Bryant Adams, Klaus T. Aehlig, Fritz Aeschbach & Henry Louis Africk - 2008 - Bulletin of Symbolic Logic 14 (4).
  11. Individual Members 2006.Martın Abadi, Yoshihiro Abe, Francine F. Abeles, Andrew Aberdein, Nathanael Ackerman, Bryant Adams, Klaus T. Aehlig, Fritz Aeschbach, Henry Louis Africk & Bahareh Afshari - 2006 - Bulletin of Symbolic Logic 12 (4):625-681.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  12. Elements of Logic.T. K. Abbott - 1884 - Mind 9:163.
  13. The Elements of Logic.Thomas Kingsmill Abbott - 1883 - Hodges Longmans, Green.
  14. Combinatorial Characterization of Pi^11-Indescribability in P{Kappa}Lambda.Yoshihiro Abe - 1998 - Archive for Mathematical Logic 37 (4):261-272.
    It is proved that $\Pi^1_1$ -indescribability in $P_{\kappa}\lambda$ can be characterized by combinatorial properties without taking care of cofinality of $\lambda$ . We extend Carr's theorem proving that the hypothesis $\kappa$ is $2^{\lambda^{<\kappa}}$ -Shelah is rather stronger than $\kappa$ is $\lambda$ -supercompact.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  15. Notes on the Partition Property of {\ Mathcal {P} _\ Kappa\ Lambda}.Yoshihiro Abe & Toshimichi Usuba - 2012 - Archive for Mathematical Logic 51 (5-6):575-589.
    We investigate the partition property of ${\mathcal{P}_{\kappa}\lambda}$ . Main results of this paper are as follows: (1) If λ is the least cardinal greater than κ such that ${\mathcal{P}_{\kappa}\lambda}$ carries a (λ κ , 2)-distributive normal ideal without the partition property, then λ is ${\Pi^1_n}$ -indescribable for all n < ω but not ${\Pi^2_1}$ -indescribable. (2) If cf(λ) ≥ κ, then every ineffable subset of ${\mathcal{P}_{\kappa}\lambda}$ has the partition property. (3) If cf(λ) ≥ κ, then the completely ineffable ideal over (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  16. Aristotelian Logic and the Arabic Language in Alfarabi.Shukri B. Abed - 1991 - State University of New York Press.
    The first part of the book examines language as a tool of logic, and deals with Alfarabi's analysis of the meanings of various terms as they are used in logic and philosophy.
    Remove from this list   Direct download  
     
    Export citation  
     
    My bibliography   3 citations  
  17. In Defense of Formal Logic.Raziel Abelson - 1960 - Philosophy and Phenomenological Research 21 (3):333-346.
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  18. Generic Extensions and Elementary Embeddings.Claes Åberg - 1975 - Theoria 41 (2):96-104.
  19. Computable Calculus.Oliver Aberth - 2002 - Bulletin of Symbolic Logic 8 (3):426-428.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  20. Categoricity of Denumerable Atomless Boolean Rings.Alexander Abian - 1972 - Studia Logica 30 (1):63 - 68.
  21. REVIEWS-On the Consistency of Some Partition Theorems for Continuous Colorings.U. Abraham, M. Rubin, S. Shelah & J. Steprans - 2002 - Bulletin of Symbolic Logic 8 (2):303-305.
    Remove from this list  
     
    Export citation  
     
    My bibliography  
  22. Aronszajn Trees on ℵ2 and ℵ3.Uri Abraham - 1983 - Annals of Pure and Applied Logic 24 (3):213-230.
    Assuming the existence of a supercompact cardinal and a weakly compact cardinal above it, we provide a generic extension where there are no Aronszajn trees of height ω 2 or ω 3 . On the other hand we show that some large cardinal assumptions are necessary for such a consistency result.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography   11 citations  
  23. Aronszajn Trees on N 2 and N 3.Uri Abraham, James Cummings, Matthew Foreman, Menachem Magidor & Saharon Shelah - 2001 - Bulletin of Symbolic Logic 7 (2):283-285.
    Remove from this list  
     
    Export citation  
     
    My bibliography  
  24. On the Consistency of Some Partition Theorems for Continuous Colorings, and the Structure of ℵ< Sub> 1-Dense Real Order Types.Uri Abraham, Matatyahu Rubin & Saharon Shelah - 1985 - Annals of Pure and Applied Logic 29 (2):123-206.
    We present some techniques in c.c.c. forcing, and apply them to prove consistency results concerning the isomorphism and embeddability relations on the family of ℵ 1 -dense sets of real numbers. In this direction we continue the work of Baumgartner [2] who proved the axiom BA stating that every two ℵ 1 -dense subsets of R are isomorphic, is consistent. We e.g. prove Con). Let K H , be the set of order types of ℵ 1 -dense homogeneous subsets of (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography   15 citations  
  25. KM99] GP Kogan and JA Makowsky. Computing Schur Functions for Borchardt Matrices. In Preparation, 1999. Kog96] GP Kogan. Computing the Permanent Over Elds of Characteristic 3: Where and Why It Becomes Dificult. In FOCS'96, Pages 108 {114. IEEE, 1996. [REVIEW]S. Abramsky, D. Gabbay & T. Maibaum - 1996 - Annals of Pure and Applied Logic 78 (2):189-202.
    Remove from this list   Direct download  
     
    Export citation  
     
    My bibliography  
  26. A Game Semantics for Generic Polymorphism.Samson Abramsky & Radha Jagadeesan - 2005 - Annals of Pure and Applied Logic 133 (1-3):3-37.
    Genericity is the idea that the same program can work at many different data types. Longo, Milstead and Soloviev proposed to capture the inability of generic programs to probe the structure of their instances by the following equational principle: if two generic programs, viewed as terms of type , are equal at any given instance A[T], then they are equal at all instances. They proved that this rule is admissible in a certain extension of System F, but finding a semantically (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  27. Some Uses of Dilators in Combinatorial Problems. II.Abrusci V. Michele, Girard Jean-Yves & Wiele Jacques Van De - 1990 - Journal of Symbolic Logic 55 (1):32 - 40.
    We study increasing F-sequences, where F is a dilator: an increasing F-sequence is a sequence (indexed by ordinal numbers) of ordinal numbers, starting with 0 and terminating at the first step x where F(x) is reached (at every step x + 1 we use the same process as in decreasing F-sequences, cf. [2], but with "+ 1" instead of "- 1"). By induction on dilators, we shall prove that every increasing F-sequence terminates and moreover we can determine for every dilator (...)
    Remove from this list   Direct download (7 more)  
     
    Export citation  
     
    My bibliography  
  28. New Perspectives in Logic and Formal Linguistics Proceedings of the Vth Roma Workshop.V. M. Abrusci & C. Casadio - 2002
    Remove from this list  
     
    Export citation  
     
    My bibliography  
  29. Conceptions of the Mind... That Do Not Loose Sight of Logic.Juan José Acero - 2003 - Theoria 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 (7 more)  
     
    Export citation  
     
    My bibliography  
  30. On a Problem of P(Α, Δ, Π) Concerning Generalized Alexandroff S Cube.Jarosław Achinger - 1986 - Studia Logica 45 (3):293 - 300.
    Universality of generalized Alexandroff's cube plays essential role in theory of absolute retracts for the category of , -closure spaces. Alexandroff's cube. is an , -closure space generated by the family of all complete filters. in a lattice of all subsets of a set of power .Condition P(, , ) says that is a closure space of all , -filters in the lattice ( ).
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  31. Sheaf Recursion and a Separation Theorem.Nathanael Leedom Ackerman - 2014 - Journal of Symbolic Logic 79 (3):882-907.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  32. Solvable Cases of the Decision Problem.W. Ackermann - 1954 - Amsterdam: North-Holland Pub. Co..
  33. Review: Frederic B. Fitch, On Natural Numbers, Integers, and Rationals. [REVIEW]W. Ackermann - 1950 - Journal of Symbolic Logic 14 (4):258-258.
    Remove from this list   Direct download  
     
    Export citation  
     
    My bibliography  
  34. Review: Leon Henkin, The Completeness of the First-Order Functional Calculus. [REVIEW]W. Ackermann - 1950 - Journal of Symbolic Logic 15 (1):68-68.
  35. Review: Laszlo Kalmar, Janos Suranyi, On the Reduction of the Decision Problem. Second Paper. Godel Prefix, a Single Binary Predicate. [REVIEW]W. Ackermann - 1948 - Journal of Symbolic Logic 13 (1):48-48.
  36. Review: Hartley Rogers, Certain Logical Reduction and Decision Problems. [REVIEW]Wilhelm Ackermann - 1957 - Journal of Symbolic Logic 22 (2):217-218.
    Remove from this list  
     
    Export citation  
     
    My bibliography  
  37. Review: Frederic Brenton Fitch, Symbolic Logic. An Introduction. [REVIEW]Wilhelm Ackermann - 1952 - Journal of Symbolic Logic 17 (4):266-268.
  38. Curry Haskell B.. A Theory of Formal Deducibility. Notre Dame Mathematical Lectures, No. 6. Lithoprinted. University of Notre Dame, Notre Dame, Indiana, 1950, Ix + 126 Seiten. [REVIEW]Wilhelm Ackermann - 1951 - Journal of Symbolic Logic 16 (1):56-58.
  39. Review: John G. Kemeny, Models of Logical Systems. [REVIEW]Wilhelm Ackermann - 1948 - Journal of Symbolic Logic 13 (3):154-156.
  40. BOCHENSKI, I. M. - Ancient Formal Logic. [REVIEW]J. L. Ackrill - 1953 - Mind 62:110.
    Remove from this list  
     
    Export citation  
     
    My bibliography  
  41. Are There Enough Injective Sets?Peter Aczel, Benno Berg, Johan Granström & Peter Schuster - 2013 - Studia Logica 101 (3):467-482.
    The axiom of choice ensures precisely that, in ZFC, every set is projective: that is, a projective object in the category of sets. In constructive ZF (CZF) the existence of enough projective sets has been discussed as an additional axiom taken from the interpretation of CZF in Martin-Löf’s intuitionistic type theory. On the other hand, every non-empty set is injective in classical ZF, which argument fails to work in CZF. The aim of this paper is to shed some light on (...)
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  42. Are There Enough Injective Sets?Peter Aczel, Benno van den Berg, Johan Granström & Peter Schuster - 2013 - Studia Logica 101 (3):467-482.
  43. Review: F.I. Andon, Ob Odnom Podhode K Minimizacii Sistem Buleoyh Funkcij (On One Approach to the Minimization of Systems of Boolean Functions); F. I. Andon, Algoritm Uproscenia D.N.F. Bulevyh Funckij (A Simplification Alogorithm of a Disjunctive Normal Form of the Boolean Functions). [REVIEW]A. Adam - 1970 - Journal of Symbolic Logic 35 (2):330-330.
  44. A Note on the E1 Collection Scheme and Fragments of Bounded Arithmetic.Zofia Adamowicz & Leszek Aleksander Kolodziejczyk - 2010 - Mathematical Logic Quarterly 56 (2):126-130.
    We show that for each n ≥ 1, if T2n does not prove the weak pigeonhole principle for Σbn functions, then the collection scheme B Σ1 is not finitely axiomatizable over T2n. The same result holds with Sn2 in place of T 2n.
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  45. Partial Collapses of the Complexity Hierarchy in Models for Fragments of Bounded Arithmetic.Zofia Adamowicz & Leszek Aleksander Kołodziejczyk - 2007 - Annals of Pure and Applied Logic 145 (1):91-95.
    For any n, we construct a model of in which each formula is equivalent to an formula.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  46. Logic of Mathematics a Modern Course of Classical Logic.Zofia Adamowicz & Pawel Zbierski - 1997
  47. Logika Matematyczna.Zofia Adamowicz & Pawel Zbierski - 1991
    Remove from this list  
     
    Export citation  
     
    My bibliography  
  48. The Fundamentals of General Logic.E. M. Adams - 1954 - Longmans, Green.
  49. A Note on Two-Cardinal Models.Alan Adamson - 1983 - Mathematical Logic Quarterly 29 (4):193-196.
  50. A Set Theory Workbook.Iain T. Adamson - 2001 - Studia Logica 69 (3):433-435.
    Remove from this list  
     
    Export citation  
     
    My bibliography  
1 — 50 / 24487