This category needs an editor. We encourage you to help if you are qualified.
Volunteer, or read more about what this involves.
Related categories

15631 found
Order:
1 — 50 / 15631
Material to categorize
  1. Information for Authors. &Na - 2000 - Jona's Healthcare Law, Ethics, and Regulation 2 (3):102.
    Remove from this list   Direct download (7 more)  
     
    Export citation  
     
    My bibliography  
  2. The Logical Systems of Lesniewski. [REVIEW]E. F. A. - 1964 - Review of Metaphysics 18 (1):179-179.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  3. Readings on Logic. [REVIEW]E. J. A. - 1966 - Review of Metaphysics 19 (4):823-823.
  4. Introduction To Logic. [REVIEW]R. A. A. - 1957 - Review of Metaphysics 11 (2):353-353.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  5. Remarks on Variable Binding Term Operators.Celina Abar & Mineko Yamashita - 1986 - 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  
     
    Export citation  
     
    My bibliography  
  6. On the Solvability of Infinite Systems of Boolean Polynomial Equations.Alexander Abian, Paul D. Bacsich, S. Bulman-Fleming & H. Lakser - 1975 - Journal of Symbolic Logic 40 (1):88-92.
  7. KAT-ML: An Interactive Theorem Prover for Kleene Algebra with Tests.Kamal Aboul-Hosn & Dexter Kozen - 2006 - Journal of Applied Non-Classical Logics 16 (1-2):9-33.
  8. Analysis of the Talmudic Argumentum A Fortiori Inference Rule Using Matrix Abduction.M. Abraham, Dov M. Gabbay & U. Schild - 2009 - Studia Logica 92 (3):281-364.
    We motivate and introduce a new method of abduction, Matrix Abduction, and apply it to modelling the use of non-deductive inferences in the Talmud such as Analogy and the rule of Argumentum A Fortiori. Given a matrix with entries in {0,1}, we allow for one or more blank squares in the matrix, say $a_{i,j} =?.$ The method allows us to decide whether to declare $a_{i,j} = 0$ or $a_{i,j} = 1$ or $a_{i,j} =?$ undecided. This algorithmic method is then applied (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography   4 citations  
  9. A Δ22 Well-Order of the Reals and Incompactness of L.Uri Abraham & Saharon Shelah - 1993 - Annals of Pure and Applied Logic 59 (1):1-32.
    A forcing poset of size 221 which adds no new reals is described and shown to provide a Δ22 definable well-order of the reals . The encoding of this well-order is obtained by playing with products of Aronszajn trees: some products are special while other are Suslin trees. The paper also deals with the Magidor–Malitz logic: it is consistent that this logic is highly noncompact.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography   10 citations  
  10. Socially Responsive, Environmentally Friendly Logic.Samson Abramsky - 2006 - Acta Philosophica Fennica 78:17.
    Remove from this list   Direct download  
     
    Export citation  
     
    My bibliography   1 citation  
  11. Domain Theory in Logical Form.Samson Abramsky - 1991 - Annals of Pure and Applied Logic 51 (1-2):1-77.
    Abramsky, S., Domain theory in logical form, Annals of Pure and Applied Logic 51 1–77. The mathematical framework of Stone duality is used to synthesise a number of hitherto separate developments in theoretical computer science.• Domain theory, the mathematical theory of computation introduced by Scott as a foundation for detonational semantics• The theory of concurrency and systems behaviour developed by Milner, Hennesy based on operational semantics.• Logics of programsStone duality provides a junction between semantics and logics . Moreover, the underlying (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography   8 citations  
  12. 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  
  13. Über die beziehung zwischen strikter und strenger implikation.Von Wilhelm Ackermann - 1958 - Dialectica 12 (3‐4):213-222.
    ZusammenfassungDer Verfasser geht auf Beziehungen zwischen dem von C. I. Lewis eingeführten Begriff der « strikten » Implikation und dem von ihm selbst eingeführten Begriff der « strengen » Implikation ein. Er zeigt, dass sich innerhalb des Systems der strengen Implikation ein weiterer Folgebegriff definieren lässt, der alle Eigenschaften hat, die von der strikten Implikation verlangt werden. Als dieser Folgebegriff wird genommen, dass die Konjunktion von A und dem Gegenteil von B unmöglich ist, was in dem System der strengen Implikation (...)
    Remove from this list   Direct download (3 more)  
    Translate
     
     
    Export citation  
     
    My bibliography  
  14. Review: Toshio Umezawa, On Intermediate Propositional Logics. [REVIEW]W. Ackermann - 1960 - Journal of Symbolic Logic 25 (2):180-180.
    Remove from this list  
     
    Export citation  
     
    My bibliography  
  15. Umezawa Toshio. On Intermediate Propositional Logics. Ebd., Bd. 24 Nr. 1 , S. 20–36.W. Ackermann - 1960 - Journal of Symbolic Logic 25 (2):180.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  16. Review: W. V. Quine, Reduction to a Dyadic Predicate; Alan Cobham, Reduction to a Symmetric Predicate. [REVIEW]Wilhelm Ackermann - 1957 - Journal of Symbolic Logic 22 (3):297-297.
    Remove from this list  
     
    Export citation  
     
    My bibliography  
  17. Erweitertes System.Wilhelm Ackermann - 1954 - Journal of Symbolic Logic 19 (4):295-296.
    Remove from this list   Direct download  
     
    Export citation  
     
    My bibliography  
  18. Review: Soren Hallden, The Logic of Nonsense. [REVIEW]Wilhelm Ackermann - 1950 - Journal of Symbolic Logic 15 (3):225-226.
    Remove from this list   Direct download  
     
    Export citation  
     
    My bibliography  
  19. Situation Theory and its Applications.Peter Aczel & Conference on Situation Theory and Its Applications - 1993
    Remove from this list  
     
    Export citation  
     
    My bibliography   2 citations  
  20. W. H. S. Monck, An Introduction to Logic. [REVIEW]R. Adamson - 1880 - Mind 5:563.
    Remove from this list  
     
    Export citation  
     
    My bibliography  
  21. Tarski's Theory of Definability: Common Themes in Descriptive Set Theory, Recursive Function Theory, Classical Pure Logic, and Finite-Universe Logic.J. W. Addison - 2004 - Annals of Pure and Applied Logic 126 (1-3):77-92.
    Although the theory of definability had many important antecedents—such as the descriptive set theory initiated by the French semi-intuitionists in the early 1900s—the main ideas were first laid out in precise mathematical terms by Alfred Tarski beginning in 1929. We review here the basic notions of languages, explicit definability, and grammatical complexity, and emphasize common themes in the theories of definability for four important languages underlying, respectively, descriptive set theory, recursive function theory, classical pure logic, and finite-universe logic. We review (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  22. Truth, Etc.: Six Lectures on Ancient Logic.Francesco Ademollo - 2009 - Philosophical Review 118 (4):546-551.
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  23. Ontology and Logic.Mortimer J. Adler - 1941 - Thought: A Journal of Philosophy 16 (1):200-204.
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  24. Presuppositions for Logic.Joseph Agassi - 1982 - The Monist 65 (4):465-480.
    Positivists identify science and certainty and in the name of the utter rationality of science deny that it rests on speculative presuppositions. The Logical Positivists took a step further and tried to show such presuppositions really no presuppositions at all but rather poorly worded sentences. Rules of sentence formation, however, rest on the presuppositions about the nature of language. This makes us unable to determine the status of mathematics, which is these days particularly irksome since this question is now-since Abraham (...)
    Remove from this list   Direct download (6 more)  
     
    Export citation  
     
    My bibliography  
  25. Foreword.Evandro Agazzi, Ítala M. Loffredo D'ottaviano & Daniele Mundici - 2011 - Principia: An International Journal of Epistemology 15 (2):223.
    Foreword DOI:10.5007/1808-1711.2011v15n2p223.
    Remove from this list   Direct download (12 more)  
     
    Export citation  
     
    My bibliography  
  26. Logic and Intelligent Interaction.Ågotnes Thomas, Benthem Johan van & Pacuit Eric - 2009 - Synthese 169 (2):219 - 221.
    Remove from this list   Direct download (7 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  27. Multi-Modal CTL: Completeness, Complexity, and an Application.Ågotnes Thomas, Hoek Wiebe Van Der, A. Rodríguez-Aguilar Juan, Sierra Carles & Wooldridge Michael - 2009 - Studia Logica 92 (1):1 - 26.
    We define a multi-modal version of Computation Tree Logic (CTL) by extending the language with path quantifiers $E^\delta $ and $E^\delta $ where δ denotes one of finitely many dimensions, interpreted over Kripke structures with one total relation for each dimension. As expected, the logic is axiomatised by taking a copy of a CTL axiomatisation for each dimension. Completeness is proved by employing the completeness result for CTL to obtain a model along each dimension in turn. We also show that (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  28. Logic and Games: An Introduction.Thomas Ågotnes - 2014 - Studia Logica 102 (2):231-234.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  29. Strategic Commitment and Release in Logics for Multi-Agent Systems.Thomas Ågotnes, Valentin Goranko & Wojciech Jamroga - 2008 - In Giacomo Bonanno, Wiebe van der Hoek & Michael Wooldridge (eds.), Logic and the Foundations of Game and Decision Theory. Amsterdam University Press. pp. 6006.
    Remove from this list  
     
    Export citation  
     
    My bibliography  
  30. Question–Answer Games.Thomas Ågotnes, Johan van Benthem, Hans van Ditmarsch & Stefan Minica - 2011 - Journal of Applied Non-Classical Logics 21 (3-4):265-288.
    We propose strategic games wherein the strategies consist of players asking each other questions and answering those questions. We study simplifications of such games wherein two players simultaneously ask each other a question that the opponent is then obliged to answer. The motivation for our research is to model conversation including the dynamics of questions and answers, to provide new links between game theory and dynamic logics of information, and to exploit the dynamic/strategic structure that, we think, lies implicitly inside (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    My bibliography   6 citations  
  31. A Logic of Strategic Ability Under Bounded Memory.Thomas Ågotnes & Dirk Walther - 2009 - Journal of Logic, Language and Information 18 (1):55-77.
    We study the logic of strategic ability of coalitions of agents with bounded memory by introducing Alternating-time Temporal Logic with Bounded Memory (ATLBM), a variant of Alternating-time Temporal Logic (ATL). ATLBM accounts for two main consequences of the assumption that agents have bounded memory. First, an agent can only remember a strategy that specifies actions in a bounded number of different circumstances. While the ATL-formula means that coalition C has a joint strategy which will make φ true forever, the ATLBM-formula (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  32. Increasing the Efficiency of Automated Theorem Proving.Gabriel Aguilera, Inma P. de Guzmán & Manuel Ojeda - 1995 - Journal of Applied Non-Classical Logics 5 (1):9-29.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  33. The Free N-Generated BL-Algebra.Stefano Aguzzoli & Simone Bova - 2010 - Annals of Pure and Applied Logic 161 (9):1144-1170.
    For each integer n≥0, we provide an explicit functional characterization of the free n-generated BL-algebra, together with an explicit construction of the corresponding normal forms.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  34. De Finetti's No-Dutch-Book Criterion for Gödel Logic.Stefano Aguzzoli, Brunella Gerla & Vincenzo Marra - 2008 - Studia Logica 90 (1):25 - 41.
    We extend de Finetti’s No-Dutch-Book Criterion to Gödel infinite-valued propositional logic.
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  35. De Finetti’s No-Dutch-Book Criterion for Gödel Logic.Stefano Aguzzoli, Brunella Gerla & Vincenzo Marra - 2008 - Studia Logica 90 (1):25-41.
    We extend de Finetti's No-Dutch-Book Criterion to Gödel infinite-valued propositional logic.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  36. Omitting Types for Finite Variable Fragments of First Order Logic.T. Sayed Ahmed - 2003 - Bulletin of the Section of Logic 32 (3):103-107.
  37. Some Results on Amalgamation in Algebraic Logic.Tarek Ahmed - 2006 - Logic Journal of the IGPL 14 (4):623-627.
    We solve some open questions on the amalgamation porperty in various algebras of logic . Some of these problems first appeared in Pigozzi [3].
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  38. On the Complexity of Axiomatizations of the Class of Representable Quasi‐Polyadic Equality Algebras.Tarek Sayed Ahmed - 2011 - 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)  
     
    Export citation  
     
    My bibliography   1 citation  
  39. The Principles of Logic.H. A. Aikens - 1903 - The Monist 13:474.
    Remove from this list  
     
    Export citation  
     
    My bibliography  
  40. The Principles of Logic.Herbert Austin Aikins - 1903 - Philosophical Review 12:481.
    Remove from this list  
     
    Export citation  
     
    My bibliography  
  41. The Axiomatic Systems From the Methodological Point of viewSystemy Aksjomatyczne Z Metodologicznego Punktu widzeniaАксиоматические Системы С Методологической Точки Зрения.Kazimierz Ajdukiewicz - 1960 - Studia Logica 9 (1):205-220.
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    My bibliography   1 citation  
  42. Tableau-Based Decision Procedure for the Multiagent Epistemic Logic with All Coalitional Operators for Common and Distributed Knowledge.M. Ajspur, V. Goranko & D. Shkatov - 2013 - Logic Journal of the IGPL 21 (3):407-437.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  43. A Three-Valued Modal Tense Logic for the Master Argument.Seiki Akama, Tetsuya Murai & Sadaaki Miyamoto - 2011 - Logique Et Analyse 54 (213):19-30.
    Remove from this list  
     
    Export citation  
     
    My bibliography   1 citation  
  44. Error Analysis of Digital Filters Using HOL Theorem Proving.Behzad Akbarpour & Sofiène Tahar - 2007 - Journal of Applied Logic 5 (4):651-666.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  45. Mechanisms of Modal and Amodal Interpolation.Marc K. Albert - 2007 - Psychological Review 114 (2):455-468.
    Remove from this list   Direct download  
     
    Export citation  
     
    My bibliography   1 citation  
  46. "Mechanisms of Modal and Amodal Interpolation": Postscript.Marc K. Albert - 2007 - Psychological Review 114 (2):468-469.
    Remove from this list   Direct download  
     
    Export citation  
     
    My bibliography  
  47. On Modal Μ-Calculus and Gödel-Löb Logic.Luca Alberucci & Alessandro Facchini - 2009 - Studia Logica 91 (2):145-169.
    We show that the modal µ-calculus over GL collapses to the modal fragment by showing that the fixpoint formula is reached after two iterations and answer to a question posed by van Benthem in [4]. Further, we introduce the modal µ~-calculus by allowing fixpoint constructors for any formula where the fixpoint variable appears guarded but not necessarily positive and show that this calculus over GL collapses to the modal fragment, too. The latter result allows us a new proof of the (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  48. On the Logic of Law.Carlos Alchourrón - 1996 - Ratio Juris 9 (4):331-48.
    Remove from this list  
     
    Export citation  
     
    My bibliography  
  49. Logic of Norms and Logic of Normative Propositions.Carlos E. Alchourrón - 1969 - Logique Et Analyse 12 (47):242-268.
    Remove from this list   Direct download  
     
    Export citation  
     
    My bibliography   7 citations  
  50. Logic in 3 Schools of Linguistics.Mv Aldridge - 1988 - South African Journal of Philosophy-Suid-Afrikaanse Tydskrif Vir Wysbegeerte 7 (2):57-65.
    Remove from this list  
     
    Export citation  
     
    My bibliography  
1 — 50 / 15631