Related categories
Subcategories:
4748 found
Search inside:
(import / add options)   Sort by:
1 — 50 / 4748
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. M. Abad, J. P. D.\'{\I.}az Varela & M. Zander (2003). Boolean Algebras With A Distinguished Automorphism. Reports on Mathematical Logic:101-112.
    In this paper we investigate a subvariety $\BA$ of tense algebras, which we call Boolean algebras with a distinguished automorphism. This variety provides a unifying framework for the algebras studied by Monteiro in [4] and by Moisil in [5,6]. Among others we prove that $\BA$ is generated by its finite members and we characterize the locally finite subvarieties of $\BA$.
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  5. 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  
  6. Manuel Abad, Alicia Fernandez & Nelli Meske (1996). Free Boolean Correlations Lattices. Reports on Mathematical Logic:2-11.
    In this paper we study some algebraic properties of the variety of Boolean correlation lattices. We give a characterization of congruences and simple algebras of the variety and we describe the algebra with a finite set of free generators.
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  7. Celina Abar & Mineko Yamashita (1986). Remarks on Variable Binding Term Operators. Bulletin of the Section of Logic 15 (4):145-149.
    A variable binding term operator is an operator which binds variables of formulas to give origin to terms. Examples of vbtos are the description operator ι, Hilbert’s ε-symbol, the classifier { : }, and Russell’s abstraction operator ˆx1xˆ2 . . . xˆnF. It is usual to introduce vbtos by contextual definition, though their treatment in first- and higherorder languages as new primitive symbols, added to them, is more convenient, especially from the semantic point of view. A semantic approach to vbtos (...)
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  8. 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  
  9. 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  
  10. 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  
  11. 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  
  12. 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  
  13. 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  
  14. 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  
  15. 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  
  16. 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  
  17. 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  
  18. 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  
  19. 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  
  20. Theodora Achourioti, Context-Dependence and the Defining of Logical Fallacies.
    This paper illustrates the difficulties that context-dependence poses for defining the so-called logical fallacies of affirming the consequent and denying the antecedent. In particular, I question whether these fallacies can be identified with specific argument patterns. I argue that judging such patterns as fallacious is relative to a) the type of underlying reasoning, and b) the world-knowledge deemed relevant to the argumentation at hand. It is concluded that a more context-sensitive definition should be pursued.
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  21. Amy Ackerberg-Hastings (2002). Analysis and Synthesis in John Playfair's Elements of Geometry. British Journal for the History of Science 35 (1):43-72.
    John Playfair , professor of mathematics and natural philosophy at the University of Edinburgh, is a relatively obscure figure today, best known as the popularizer of James Hutton's theory of geology. However, Playfair was also involved in mathematics for most of his active career, with his most widely distributed publication, Elements of Geometry , shaping the mathematics education for at least thirteen thousand British students during the nineteenth century. This study focuses on the mathematical context surrounding Elements of Geometry. Specifically, (...)
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  22. Diana Ackerman (1981). Two Paradoxes of Analysis. Journal of Philosophy 78 (11):733-735.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  23. 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  
  24. Peter Aczel (1988). Non-Well-Founded Sets. Csli Lecture Notes.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  25. 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  
  26. Zofia Adamowicz & Pawel Zbierski (1997). Logic of Mathematics a Modern Course of Classical Logic.
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  27. Zofia Adamowicz & Pawel Zbierski (1991). Logika Matematyczna.
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  28. 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  
  29. 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  
  30. 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  
  31. 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  
  32. S. I. Adian & Anil Nerode (1997). Logical Foundations of Computer Science 4th International Symposium, Lfcs '97, Yaroslavl, Russia, July 6-12, 1997 : Proceedings. [REVIEW]
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  33. 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  
  34. 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  
  35. 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  
  36. Pieter Adriaans, Henning Fernau & Menno van Zaanen (2002). Grammatical Inference Algorithms and Applications : 6th International Colloquium, Icgi 2002, Amsterdam, the Netherlands, September 23-25, 2002 : Proceedings. [REVIEW]
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  37. 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  
  38. 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  
  39. 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  
  40. Cassian Agera (1989). Cut the Syllogism to its Size! Some Reflections on Indian Syllogism. Indian Philosophical Quarterly 16 (4):465.
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  41. 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  
  42. Franco Agostini (1983). Mathematical and Logical Games.
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  43. 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  
  44. 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  
  45. 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  
  46. 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  
  47. 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  
  48. 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  
  49. 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  
  50. 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  
1 — 50 / 4748