Related categories
Subcategories:
6584 found
Search inside:
(import / add options)   Order:
1 — 50 / 6584
Material to categorize
  1. A. R. A. (1957). Elements of Logic. Review of Metaphysics 11 (2):345-345.
  2. B. W. A. (1972). Philosophy of Logic. [REVIEW] Review of Metaphysics 25 (3):565-566.
    Remove from this list   Direct download  
     
    Export citation  
     
    My bibliography  
  3. E. J. A. (1965). Elementary Modern Logic. [REVIEW] Review of Metaphysics 19 (1):149-149.
    Remove from this list   Direct download  
     
    Export citation  
     
    My bibliography  
  4. E. J. A. (1965). The Elements of Logic. [REVIEW] Review of Metaphysics 18 (4):772-772.
    Remove from this list   Direct download  
     
    Export citation  
     
    My bibliography  
  5. P. D. M. A. (1960). Language and Clear Thinking: An Introduction to Logic. [REVIEW] Review of Metaphysics 14 (1):174-174.
    Remove from this list   Direct download  
     
    Export citation  
     
    My bibliography  
  6. R. A. A. (1957). Elements of Logic. [REVIEW] Review of Metaphysics 11 (2):345-345.
    Remove from this list   Direct download  
     
    Export citation  
     
    My bibliography  
  7. T. K. Abbott (1884). Elements of Logic. Mind 9:163.
    Remove from this list  
     
    Export citation  
     
    My bibliography  
  8. Thomas Kingsmill Abbott (1883). The Elements of Logic. Hodges Longmans, Green.
    Remove from this list  
     
    Export citation  
     
    My bibliography  
  9. Shukri B. Abed (1991). Aristotelian Logic and the Arabic Language in Alfarabi. 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  
  10. Alexander Abian (1972). Categoricity of Denumerable Atomless Boolean Rings. Studia Logica 30 (1):63 - 68.
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  11. Uri Abraham, Matatyahu Rubin & Saharon Shelah (1985). On the Consistency of Some Partition Theorems for Continuous Colorings, and the Structure of ℵ< Sub> 1-Dense Real Order Types. 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   10 citations  
  12. Jarosław Achinger (1986). On a Problem of P(Α, Δ, Π) Concerning Generalized Alexandroff S Cube. 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  
  13. J. L. Ackrill (1953). BOCHENSKI, I. M. - Ancient Formal Logic. [REVIEW] Mind 62:110.
    Remove from this list  
     
    Export citation  
     
    My bibliography  
  14. Peter Aczel, Benno Berg, Johan Granström & Peter Schuster (2013). Are There Enough Injective Sets? 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  
  15. Alan Adamson (1983). A Note on Two-Cardinal Models. Mathematical Logic Quarterly 29 (4):193-196.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  16. T. Sayed Ahmed (2003). Omitting Types for Finite Variable Fragments of First Order Logic. Bulletin of the Section of Logic 32 (3):103-107.
  17. Tarek Sayed Ahmed (2009). On Neat Embeddings of Cylindric Algebras. Mathematical Logic Quarterly 55 (6):666-668.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  18. Tarek Sayed Ahmed (2008). Weakly Representable Atom Structures That Are Not Strongly Representable, with an Application to First Order Logic. Mathematical Logic Quarterly 54 (3):294-306.
    Letn > 2. A weakly representable relation algebra that is not strongly representable is constructed. It is proved that the set of all n by n basic matrices forms a cylindric basis that is also a weakly but not a strongly representable atom structure. This gives an example of a binary generated atomic representable cylindric algebra with no complete representation. An application to first order logic is given.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  19. Tarek Sayed Ahmed (2005). An Independence Result in Algebraic Logic. Bulletin of the Section of Logic 34 (1):29-36.
    Remove from this list   Direct download  
     
    Export citation  
     
    My bibliography  
  20. Tarek Sayed Ahmed (2005). Omitting Types for Algebraizable Extensions of First Order Logic. Journal of Applied Non-Classical Logics 15 (4):465-489.
    We prove an Omitting Types Theorem for certain algebraizable extensions of first order logic without equality studied in [SAI 00] and [SAY 04]. This is done by proving a representation theorem preserving given countable sets of infinite meets for certain reducts of ?- dimensional polyadic algebras, the so-called G polyadic algebras (Theorem 5). Here G is a special subsemigroup of (?, ? o) that specifies the signature of the algebras in question. We state and prove an independence result connecting our (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  21. Tarek Sayed Ahmed (2002). A Modeltheoretic Solution to a Problem of Tarski. Mathematical Logic Quarterly 48 (3):343-355.
    Let 1 n. We show that the class NrnCAβ of n-dimensional neat reducts of β-dimensional cylindric algebras is not closed under forming elementary subalgebras. This solves a long-standing open problem of Tarski and his co-authors Andréka, Henkin, Monk and Németi. The proof uses genuine model-theoretic arguments.
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  22. Tarek Sayed Ahmed & Basim Samir (2006). Neat Embeddings and Amalgamation. Bulletin of the Section of Logic 35 (4):163-171.
    Remove from this list   Direct download  
     
    Export citation  
     
    My bibliography  
  23. Kazimierz Ajdukiewicz (1974). Pragmatic Logic.
    Remove from this list  
     
    Export citation  
     
    My bibliography   11 citations  
  24. Muhammad Ibn Muhammad Qutb Al-Tahtani & Ali ibn Umar Qazwini (1884). Qutbi. Nawalkishawr.
    Remove from this list  
    Translate
     
     
    Export citation  
     
    My bibliography  
  25. Kwame Abu Al-Faraj Abd Allah Ibn Al-Tayyib & Gyekye (1975). Tafsir Kitab Isaghuji Li-Furfuriyus.
    Remove from this list  
    Translate
     
     
    Export citation  
     
    My bibliography  
  26. Jesús Alcolea Banegas (1990). Lógica formal. Theoria 5 (1-2):270-273.
    Remove from this list  
    Translate
      Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  27. Henry Aldrich, Thomas Jackson & John Wesley (1836). A Compendium of Logic. Printed for Thomas Tegg & Son R. Griffin, & Co. Tegg, Wise, & Co.
    Remove from this list  
     
    Export citation  
     
    My bibliography  
  28. Igor Aleksander (1970). Introduction to Logic Circuit Theory.
    Remove from this list  
     
    Export citation  
     
    My bibliography  
  29. Peter Alexander (1969). An Introduction to Logic the Criticism of Arguments.
    Remove from this list  
     
    Export citation  
     
    My bibliography  
  30. C. Alkor & B. Intrigila (1983). Baire Category on Cardinals. Mathematical Logic Quarterly 29 (4):245-252.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  31. Colin Allen & Michael Hand (1992). Logic Primer. Monograph Collection (Matt - Pseudo).
    Remove from this list  
     
    Export citation  
     
    My bibliography   1 citation  
  32. Klaus Ambos-Spies (2014). On the Strongly Bounded Turing Degrees of Simple Sets. In Dieter Spreen, Hannes Diener & Vasco Brattka (eds.), Logic, Computation, Hierarchies. De Gruyter 23-78.
    Remove from this list   Direct download  
     
    Export citation  
     
    My bibliography  
  33. Klaus Ambos-Spies (1985). Cupping and Noncapping in the Re Weak Truth Table and Turing Degrees. Archive for Mathematical Logic 25 (1):109-126.
    Remove from this list   Direct download  
     
    Export citation  
     
    My bibliography  
  34. Klaus Ambos-Spies & André Nies (1992). Cappable Recursively Enumerable Degrees and Post's Program. Archive for Mathematical Logic 32 (1):51-56.
    We give a simple structural property which characterizes the r.e. sets whose (Turing) degrees are cappable. Since cappable degrees are incomplete, this may be viewed as a solution of Post's program, which asks for a simple structural property of nonrecursive r.e. sets which ensures incompleteness.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  35. Klaus Ambos‐Spies (1985). Anti‐Mitotic Recursively Enumerable Sets. Mathematical Logic Quarterly 31 (29‐30):461-477.
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    My bibliography   9 citations  
  36. Brooke M. Andersen & Marcia J. Groszek (2009). Grigorieff Forcing on Uncountable Cardinals Does Not Add a Generic of Minimal Degree. Notre Dame Journal of Formal Logic 50 (2):195-200.
    Grigorieff showed that forcing to add a subset of ω using partial functions with suitably chosen domains can add a generic real of minimal degree. We show that forcing with partial functions to add a subset of an uncountable κ without adding a real never adds a generic of minimal degree. This is in contrast to forcing using branching conditions, as shown by Brown and Groszek.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  37. Brooke M. Andersen, Asher M. Kach, Alexander G. Melnikov & Reed Solomon (2012). Jump Degrees of Torsion-Free Abelian Groups. Journal of Symbolic Logic 77 (4):1067-1100.
    We show, for each computable ordinal α and degree $\alpha > {0^{\left( \alpha \right)}}$, the existence of a torsion-free abelian group with proper α th jump degree α.
    Remove from this list   Direct download (6 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  38. Holger Andreas (2013). Deductive Reasoning in the Structuralist Approach. Studia Logica 101 (5):1093-1113.
    The distinction between the syntactic and the semantic approach to scientific theories emerged in formal philosophy of science. The semantic approach is commonly considered more advanced and more successful than the syntactic one, but the transition from the one approach to the other was not brought about without any loss. In essence, it is the formal analysis of atomic propositions and the analysis of deductive reasoning that dropped out of consideration in at least some of the elaborated versions of the (...)
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  39. H. Andréka, T. Gergely & I. Németi (1974). Sufficient and Necessary Condition for the Completeness of a Calculus. Mathematical Logic Quarterly 20 (28‐29):433-434.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  40. H. Andreka, S. Givant, I. Nemeti & Roger D. Maddux (2003). REVIEWS-Decision Problems for Equational Theories of Relation Algebras. Bulletin of Symbolic Logic 9 (1):37-38.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  41. H. Andréka, J. Donald Monk, I. Németi, Bolyai János Matematikai Társulat & Association of Symbolic Logic (1991). Algebraic Logic. Monograph Collection (Matt - Pseudo).
    Remove from this list  
     
    Export citation  
     
    My bibliography   6 citations  
  42. Hajnal Andréka (1997). Complexity of Equations Valid in Algebras of Relations Part I: Strong Non-Finitizability. Annals of Pure and Applied Logic 89 (2):149-209.
    We study algebras whose elements are relations, and the operations are natural “manipulations” of relations. This area goes back to 140 years ago to works of De Morgan, Peirce, Schröder . Well known examples of algebras of relations are the varieties RCAn of cylindric algebras of n-ary relations, RPEAn of polyadic equality algebras of n-ary relations, and RRA of binary relations with composition. We prove that any axiomatization, say E, of RCAn has to be very complex in the following sense: (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography   8 citations  
  43. Hajnal Andréka & Ivo Düntsch (1995). Binary Relations and Permutation Groups. Mathematical Logic Quarterly 41 (2):197-216.
    We discuss some new properties of the natural Galois connection among set relation algebras, permutation groups, and first order logic. In particular, we exhibit infinitely many permutational relation algebras without a Galois closed representation, and we also show that every relation algebra on a set with at most six elements is Galois closed and essentially unique. Thus, we obtain the surprising result that on such sets, logic with three variables is as powerful in expression as full first order logic.
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  44. Hajnal Andréka & István Németi (1979). Not All Representable Cylindric Algebras Are Neat Reducts. Bulletin of the Section of Logic 8 (3):145-147.
    Remove from this list   Direct download  
     
    Export citation  
     
    My bibliography  
  45. Hajnal Andréka & István Németi (1978). On Universal Algebraic Logic and Cylindric Algebras. Bulletin of the Section of Logic 7 (4):152-158.
    Remove from this list   Direct download  
     
    Export citation  
     
    My bibliography  
  46. Alessandro Andretta (2012). REVIEWS-AS Kechris, B. Löwe, and JR Steel (Editors), Games, Scales, and Suslin Cardinals. The Cabal Seminar, Volume I. Bulletin of Symbolic Logic 18 (1):122.
    Remove from this list  
     
    Export citation  
     
    My bibliography  
  47. Irving H. Anellis (2012). Jean van Heijenoort's Conception of Modern Logic, in Historical Perspective. Logica Universalis 6 (3-4):339-409.
    I use van Heijenoort’s published writings and manuscript materials to provide a comprehensive overview of his conception of modern logic as a first-order functional calculus and of the historical developments which led to this conception of mathematical logic, its defining characteristics, and in particular to provide an integral account, from his most important publications as well as his unpublished notes and scattered shorter historico-philosophical articles, of how and why the mathematical logic, whose he traced to Frege and the culmination of (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  48. Zakariya ibn Muhammad Ansari & Al-Mufaddal Ibn Umar Athir Al-Din Al-Abhari (1867). Al-Matla Sharh Isaghuji. [Dar Al-Tiba Ah].
    Remove from this list  
    Translate
     
     
    Export citation  
     
    My bibliography  
  49. O. M. Anshakov, D. V. Vinogradov & V. K. Finn (eds.) (2008). Mnogoznachnye Logiki I Ikh Primenenii͡a. Lki.
    Tom 1. Logicheskie ischisleni͡a, algebry i funkt͡sionalnye svoĭstva.
    Remove from this list  
    Translate
     
     
    Export citation  
     
    My bibliography  
  50. Kenneth Appel (1966). Review: Erik Ellentuck, Infinite Products of Isols. [REVIEW] Journal of Symbolic Logic 31 (4):652-653.
1 — 50 / 6584