This category needs an editor. We encourage you to help if you are qualified.
Volunteer, or read more about what this involves.
Related categories
Subcategories:
3955 found
Search inside:
(import / add options)   Sort by:
1 — 50 / 3955
Material to categorize
  1. Renato A. Lewin, Irene F. Mikenberg & Marı́a G. Schwarze (2001). On Free Annotated Algebras. Annals of Pure and Applied Logic 108 (1):249-259.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  2. E. J. A. (1965). Elements of Formal Logic. [REVIEW] Review of Metaphysics 19 (2):379-379.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  3. R. A. A. (1957). Workbook for an Elementary Course in Logic. [REVIEW] Review of Metaphysics 11 (2):345-345.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  4. Manuel Abad, Diego Castaño & José P. Díaz Varela (2010). Zariski‐Type Topology for Implication Algebras. Mathematical Logic Quarterly 56 (3):299-309.
    In this work we provide a new topological representation for implication algebras in such a way that its one-point compactification is the topological space given in [1]. Some applications are given thereof.
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  5. Charles J. Abaté (1979). Fallaciousness and Invalidity. Philosophy and Rhetoric 12 (4):262 - 266.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  6. Kuanysh Abeshev (forthcoming). On the Existence of Universal Numberings for Finite Families of D.C.E. Sets. Mathematical Logic Quarterly:n/a-n/a.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  7. Alexander Abian (1973). The Consistency of the Continuum Hypothesis Via Synergistic Models. Mathematical Logic Quarterly 19 (13):193-198.
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  8. Alexander Abian (1970). Generalized Completeness Theorem and Solvability of Systems of Boolean Polynomial Equations. Mathematical Logic Quarterly 16 (3):263-264.
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  9. Alexander Abian (1968). On Definitions of Cuts and Completion of Partially Ordered Sets. Mathematical Logic Quarterly 14 (19):299-302.
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  10. Alexander Abian & David Deever (1967). On the Minimal Length of Sequences Representing Simply Ordered Sets. Mathematical Logic Quarterly 13 (1‐2):21-23.
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  11. Uri Abraham & Saharon Shelah (1996). Martin's Axiom and Delta^2_1 Well-Ordering of the Reals. Archive for Mathematical Logic 35 (5-6):287-298.
    Assuming an inaccessible cardinal $\kappa$ , there is a generic extension in which $MA + 2^{\aleph_0} = \kappa$ holds and the reals have a $\Delta^2_1$ well-ordering.
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  12. Uri Abraham & Saharon Shelah (1996). Martin's Axiom and Well-Ordering of the Reals. Archive for Mathematical Logic 35 (5):287-298.
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  13. Samson Abramsky (2012). Logic and Categories as Tools for Building Theories. Journal of the Indian Council of Philosophical Research 1.
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  14. Samson Abramsky, Dov M. Gabbay & Thomas S. E. Maibaum (1992). Handbook of Logic in Computer Science. Monograph Collection (Matt - Pseudo).
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  15. V. M. Abrusci & C. Casadio (2002). New Perspectives in Logic and Formal Linguistics Proceedings of the Vth Roma Workshop. Monograph Collection (Matt - Pseudo).
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  16. V. Michele Abrusci (1989). Some Uses of Dilators in Combinatorial Problems. Archive for Mathematical Logic 29 (2):85-109.
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  17. Diana Ackerman (1981). Two Paradoxes of Analysis. Journal of Philosophy 78 (11):733-735.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  18. Felicia Ackerman (1992). Analysis and its Paradoxes. In Edna Ullmann-Margalit (ed.), The Scientific Enterprise. Kluwer. 169--178.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  19. Zofia Adamowicz & Leszek Aleksander Kolodziejczyk (2010). A Note on the E1 Collection Scheme and Fragments of Bounded Arithmetic. 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 (5 more)  
     
    My bibliography  
     
    Export citation  
  20. Alan Adamson (1980). Saturated Structures, Unions of Chains, and Preservation Theorems. Annals of Mathematical Logic 19 (1-2):67-96.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  21. Alan Adamson (1978). Admissible Sets and the Saturation of Structures. Annals of Mathematical Logic 14 (2):111-157.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  22. Robert Adamson & W. R. Sorley (1911). A Short History of Logic. W. Blackwood and Sons.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  23. J. W. Addison, Leon Henkin & Alfred Tarski (1965). The Theory of Models Proceedings of the 1963 International Symposium at Berkeley.
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  24. R. Adillon & Ventura Verdú (1996). A Gentzen System Equivalent to the BCK-Logic'. Bulletin of the Section of Logic 25 (2):73-79.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  25. Andrew Adler (1969). Extensions of Non‐Standard Models of Number Theory. Mathematical Logic Quarterly 15 (19):289-290.
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  26. Jonathan E. Adler (1994). Fallacies and Alternative Interpretations. Australasian Journal of Philosophy 72 (3):271 – 282.
    Remove from this list | Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  27. Miloš Adžić & Miloš Arsenijević (2014). Gunkology and Pointilism: Two Mutually Supervening Models of the Region–Based and the Point-Based Theory of the Infinite Twodimensional Continuum. In Giovanni Macchia, Francesco Orilia & Vincenzo Fano (eds.), Space and Time: A Priori and a Posteriori Studies. De Gruyter. 137-170.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  28. Maria L. Affatato, Thomas F. Kent & Andrea Sorbi (2008). Branching in the {Sigma^0_2} -Enumeration Degrees: A New Perspective. [REVIEW] Archive for Mathematical Logic 47 (3):221-231.
    We give an alternative and more informative proof that every incomplete ${\Sigma^{0}_{2}}$ -enumeration degree is the meet of two incomparable ${\Sigma^{0}_{2}}$ -degrees, which allows us to show the stronger result that for every incomplete ${\Sigma^{0}_{2}}$ -enumeration degree a, there exist enumeration degrees x 1 and x 2 such that a, x 1, x 2 are incomparable, and for all b ≤ a, b = (b ∨ x 1 ) ∧ (b ∨ x 2 ).
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  29. Bahareh Afshari & Michael Rathjen (2012). Ordinal Analysis and the Infinite Ramsey Theorem. In S. Barry Cooper (ed.), How the World Computes. 1--10.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  30. David Agler (2012). Symbolic Logic: Syntax, Semantics, and Proof. Rowman & Littlefield Publishers.
    Brimming with visual examples of concepts, derivation rules, and proof strategies, this introductory text is ideal for students with no previous experience in logic. Students will learn translation both from formal language into English and from English into formal language; how to use truth trees and truth tables to test propositions for logical properties; and how to construct and strategically use derivation rules in proofs.
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  31. Thomas Ågotnes, Valentin Goranko & Wojciech Jamroga (2008). Strategic Commitment and Release in Logics for Multi-Agent Systems. In Giacomo Bonanno, Wiebe van der Hoek & Michael Wooldridge (eds.), Logic and the Foundations of Game and Decision Theory. Amsterdam University Press. 6006.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  32. Thomas Ågotnes, Wiebe van der Hoek & Michael Wooldridge (2008). Quantified Coalition Logic. Synthese 165 (2):269 - 294.
    We add a limited but useful form of quantification to Coalition Logic, a popular formalism for reasoning about cooperation in game-like multi-agent systems. The basic constructs of Quantified Coalition Logic (QCL) allow us to express such properties as "every coalition satisfying property P can achieve φ" and "there exists a coalition C satisfying property P such that C can achieve φ". We give an axiomatisation of QCL, and show that while it is no more expressive than Coalition Logic, it is (...)
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  33. G. Ahlbrandt & John T. Baldwin (1988). Categoricity and Generalized Model Completeness. Archive for Mathematical Logic 27 (1):1-4.
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  34. Seema Ahmad & Alistair H. Lachlan (1998). Some Special Pairs of Σ2 E-Degrees. Mathematical Logic Quarterly 44 (4):431-449.
    It is shown that there are incomparable Σ2 e-degrees a, b such that every e-degree strictly less than a is also less than b.
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  35. Tarek Sayed Ahmed (2011). On the Complexity of Axiomatizations of the Class of Representable Quasi‐Polyadic Equality Algebras. Mathematical Logic Quarterly 57 (4):384-394.
    Using games, as introduced by Hirsch and Hodkinson in algebraic logic, we give a recursive axiomatization of the class RQPEAα of representable quasi-polyadic equality algebras of any dimension α. Following Sain and Thompson in modifying Andréka’s methods of splitting, to adapt the quasi-polyadic equality case, we show that if Σ is a set of equations axiomatizing RPEAn for equation image and equation imageequation image, k′ < ω are natural numbers, then Σ contains infinitely equations in which − occurs, one of (...)
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  36. Tarek Sayed Ahmed (2010). The Class of Polyadic Algebras has the Super Amalgamation Property. Mathematical Logic Quarterly 56 (1):103-112.
    We show that for infinite ordinals α the class of polyadic algebras of dimension α has the super amalgamation property.
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  37. Tarek Sayed Ahmed (2009). A Note on Substitutions in Representable Cylindric Algebras. Mathematical Logic Quarterly 55 (3):280-287.
    We show that it is impossible to define a substitution operator for arbitrary representable cylindric algebras that agrees in its basic properties with the notion of substitutions introduced for dimension complemented algebras.
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  38. Tarek Sayed Ahmed (2009). A Simple Construction of Representable Relation Algebras with Non‐Representable Completions. Mathematical Logic Quarterly 55 (3):237-244.
    We give a simple new construction of representable relation algebras with non-representable completions. Using variations on our construction, we show that the elementary closure of the class of completely representable relation algebras is not finitely axiomatizable.
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  39. Tarek Sayed Ahmed (2008). Amalgamation for Reducts of Polyadic Equality Algebras, a Negative Result. Bulletin of the Section of Logic 37 (1):37-50.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  40. Tarek Sayed Ahmed (2008). Classes of Representable Algebras with the Amalgamation Property. Bulletin of the Section of Logic 37 (2):115-121.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  41. Tarek Sayed Ahmed (2008). The Class of Neat Reducts is Not Boolean Closed. Bulletin of the Section of Logic 37 (1):51-61.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  42. Tarek Sayed Ahmed (2007). A Non-Finitizability Result in Algebraic Logic. Bulletin of the Section of Logic 36 (1/2):21-27.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  43. Tarek Sayed Ahmed (2006). Algebras of Sentences. Bulletin of the Section of Logic 35 (1):1-10.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  44. Tarek Sayed Ahmed (2005). A Sufficient and Necessary Condition for Omitting Types. Bulletin of the Section of Logic 34 (1):23-27.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  45. Tarek Sayed Ahmed & Basim Samir (2007). An Omitting Types Theorem for First Order Logic with Infinitary Relation Symbols. Mathematical Logic Quarterly 53 (6):564-570.
    In this paper, an extension of first order logic is introduced. In such logics atomic formulas may have infinite lengths. An Omitting Types Theorem is proved.
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  46. Marco Aiello, Guram Bezhanishvili, Isabelle Bloch & Valentin Goranko (2012). Logic for Physical Space. Synthese 186 (3):619-632.
    Since the early days of physics, space has called for means to represent, experiment, and reason about it. Apart from physicists, the concept of space has intrigued also philosophers, mathematicians and, more recently, computer scientists. This longstanding interest has left us with a plethora of mathematical tools developed to represent and work with space. Here we take a special look at this evolution by considering the perspective of Logic. From the initial axiomatic efforts of Euclid, we revisit the major milestones (...)
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  47. Marco Aiello, Guram Bezhanishvili, Isabelle Bloch & Valentin Goranko (2012). Logic for Physical Space: From Antiquity to Present Days. Synthese 186 (3):619 - 632.
    Since the early days of physics, space has called for means to represent, experiment, and reason about it. Apart from physicists, the concept of space has intrigued also philosophers, mathematicians and, more recently, computer scientists. This longstanding interest has left us with a plethora of mathematical tools developed to represent and work with space. Here we take a special look at this evolution by considering the perspective of Logic. From the initial axiomatic efforts of Euclid, we revisit the major milestones (...)
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  48. Marco Aiello, Ian E. Pratt-Hartmann & Johan van Benthem (eds.) (2007). Handbook of Spatial Logics. Springer-Verlag.
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  49. Douglas Ainslie (1920). Logic as the Science of the Pure Concept. Philosophical Review 29 (3):283-288.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  50. Seiki Akama (1988). On the Proof Method for Constructive Falsity. Mathematical Logic Quarterly 34 (5):385-392.
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
1 — 50 / 3955