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:
5970 found
Search inside:
(import / add options)   Sort by:
1 — 50 / 5970
Material to categorize
  1. &Na (2000). Information for Authors. Jona's Healthcare Law, Ethics, and Regulation 2 (3):102.
    Remove from this list | Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  2. A. R. A. (1957). Introduction To Logic. Review of Metaphysics 11 (2):353-353.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  3. E. F. A. (1964). The Logical Systems of Lesniewski. [REVIEW] Review of Metaphysics 18 (1):179-179.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  4. E. J. A. (1966). Readings on Logic. [REVIEW] Review of Metaphysics 19 (4):823-823.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  5. R. A. A. (1957). Introduction To Logic. [REVIEW] Review of Metaphysics 11 (2):353-353.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  6. Samson Abramsky (2006). Socially Responsive, Environmentally Friendly Logic. Acta Philosophica Fennica 78:17.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  7. V. Michele Abrusci, Jean-Yves Girard & Jacques Van De Wiele (1990). Some Uses of Dilators in Combinatorial Problems. II. 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 (4 more)  
     
    My bibliography  
     
    Export citation  
  8. Von Wilhelm Ackermann (1958). Über die beziehung zwischen strikter und strenger implikation. 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 |
    Translate to English
    | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  9. Joseph Agassi (1982). Presuppositions for Logic. 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)  
     
    My bibliography  
     
    Export citation  
  10. Evandro Agazzi, Ítala M. Loffredo D'ottaviano & Daniele Mundici (2012). Foreword. Principia 15 (2):223.
    Foreword DOI:10.5007/1808-1711.2011v15n2p223.
    Remove from this list | Direct download (12 more)  
     
    My bibliography  
     
    Export citation  
  11. T. Sayed Ahmed (2003). Omitting Types for Finite Variable Fragments of First Order Logic. Bulletin of the Section of Logic 32 (3):103-107.
  12. Luca Alberucci & Gerhard Jäger (2005). About Cut Elimination for Logics of Common Knowledge. Annals of Pure and Applied Logic 133 (1):73-99.
    The notions of common knowledge or common belief play an important role in several areas of computer science , in philosophy, game theory, artificial intelligence, psychology and many other fields which deal with the interaction within a group of “agents”, agreement or coordinated actions. In the following we will present several deductive systems for common knowledge above epistemic logics –such as K, T, S4 and S5 –with a fixed number of agents. We focus on structural and proof-theoretic properties of these (...)
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  13. Carlos E. Alchourrón (1969). Logic of Norms and Logic of Normative Propositions. Logique Et Analyse 12 (47):242-268.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  14. Mv Aldridge (1988). Logic in 3 Schools of Linguistics. South African Journal of Philosophy-Suid-Afrikaanse Tydskrif Vir Wysbegeerte 7 (2):57-65.
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  15. Natasha Alechina, Philippe Balbiani & Dmitry Shkatov (2012). Modal Logics for Reasoning About Infinite Unions and Intersections of Binary Relations. Journal of Applied Non-Classical Logics 22 (4):275 - 294.
    (2012). Modal logics for reasoning about infinite unions and intersections of binary relations. Journal of Applied Non-Classical Logics: Vol. 22, No. 4, pp. 275-294. doi: 10.1080/11663081.2012.705960.
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  16. José Júlio Alferes, Federico Banti, Antonio Brogi & João Alexandre Leite (2005). The Refined Extension Principle for Semantics of Dynamic Logic Programming. Studia Logica 79 (1):7 - 32.
    Over recent years, various semantics have been proposed for dealing with updates in the setting of logic programs. The availability of different semantics naturally raises the question of which are most adequate to model updates. A systematic approach to face this question is to identify general principles against which such semantics could be evaluated. In this paper we motivate and introduce a new such principle the refined extension principle. Such principle is complied with by the stable model semantics for (single) (...)
    Remove from this list | Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  17. Carl J. Allen (1962). The Scientific Art of Logic. Modern Schoolman 39 (4):410-414.
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  18. Layman E. Allen (1968). Review: H. N. Castaneda, Obligation and Modal Logic. [REVIEW] Journal of Symbolic Logic 33 (4):612-612.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  19. Layman E. Allen (1968). Review: P. H. Nowell-Smith, E. J. Lemmon, Escapism: The Logical Basis of Ethics. [REVIEW] Journal of Symbolic Logic 33 (4):611-612.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  20. Patrick Allo (2013). Adaptive Logic as a Modal Logic. Studia Logica 101 (5):933-958.
    Modal logics have in the past been used as a unifying framework for the minimality semantics used in defeasible inference, conditional logic, and belief revision. The main aim of the present paper is to add adaptive logics, a general framework for a wide range of defeasible reasoning forms developed by Diderik Batens and his co-workers, to the growing list of formalisms that can be studied with the tools and methods of contemporary modal logic. By characterising the class of abnormality models, (...)
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  21. G. Allwein, C. Areces, G. Ben-Avi, R. la BerkBernardi, P. Blackburn, J. Bos, T. Braüner, J. M. Castano & R. Cooper (2004). Index of Authors of Volume 13. Journal of Logic, Language and Information 13 (535):535-535.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  22. Joseph Almog (1989). Logic and the World. Journal of Philosophical Logic 18 (2):197 - 220.
  23. R. Amadio, P. L. Curien & Rene David (2004). REVIEWS-Domains and Lambda-Calculi. Bulletin of Symbolic Logic 10 (2):211-212.
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  24. D. A. Anapolitanos & J. A. Väänänen (1981). Decidability of Some Logics with Free Quantifier Variables. Mathematical Logic Quarterly 27 (2‐6):17-22.
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  25. C. Anthony Anderson & Michael Zelëny (eds.) (2001). Logic, Meaning, and Computation: Essays in Memory of Alonzo Church. Kluwer.
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  26. J. G. Anderson (1972). Superconstructive Propositional Calculi with Extra Axiom Schemes Containing One Variable. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 18 (8-11):113-130.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  27. R. B. Angell (1970). Review: Kiyoshi Iséki, An Algebra Related with a Propositional Calculus; Yoshinari Arai, Kiyoshi Iséki, Shôtarô Tanaka, Characterizations of BCI, BCK-Algebras; Kiyoshi Iséki, Algebraic Formulation of Propositional Calculi with General Detachment Rule. [REVIEW] Journal of Symbolic Logic 35 (3):465-466.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  28. Takahito Aoto & Hiroakira Ono (1994). Non-Uniqueness of Normal Proofs for Minimal Formulas in Implication-Conjunction Fragment of BCK. Bulletin of the Section of Logic 23 (3):104-112.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  29. Toshiyasu Arai (2008). Non‐Elementary Speed‐Ups in Logic Calculi. Mathematical Logic Quarterly 54 (6):629-640.
    In this paper we show some non-elementary speed-ups in logic calculi: Both a predicative second-order logic and a logic for fixed points of positive formulas are shown to have non-elementary speed-ups over first-order logic. Also it is shown that eliminating second-order cut formulas in second-order logic has to increase sizes of proofs super-exponentially, and the same in eliminating second-order epsilon axioms. These are proved by relying on results due to P. Pudlák.
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  30. Mohammad Ardeshir & Wim Ruitenburg (2001). Basic Propositional Calculus II. Interpolation. Archive for Mathematical Logic 40 (5):349-364.
    Let ℒ and ? be propositional languages over Basic Propositional Calculus, and ℳ = ℒ∩?. Weprove two different but interrelated interpolation theorems. First, suppose that Π is a sequent theory over ℒ, and Σ∪ {C⇒C′} is a set of sequents over ?, such that Π,Σ⊢C⇒C′. Then there is a sequent theory Φ over ℳ such that Π⊢Φ and Φ, Σ⊢C⇒C′. Second, let A be a formula over ℒ, and C 1, C 2 be formulas over ?, such that A∧C 1⊢C (...)
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  31. Mohammad Ardeshir & Wim Ruitenburg (1998). Basic Propositional Calculus I. Mathematical Logic Quarterly 44 (3):317-343.
    We present an axiomatization for Basic Propositional Calculus BPC and give a completeness theorem for the class of transitive Kripke structures. We present several refinements, including a completeness theorem for irreflexive trees. The class of intermediate logics includes two maximal nodes, one being Classical Propositional Calculus CPC, the other being E1, a theory axiomatized by T → ⊥. The intersection CPC ∩ E1 is axiomatizable by the Principle of the Excluded Middle A V ∨ ⌝A. If B is a formula (...)
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  32. Bruce A. Arrigo (1998). Language, Propositional Logic, and Real World Applications: A Comment on Ascription. International Journal for the Semiotics of Law - Revue Internationale de Sémiotique Juridique 11 (1):73-77.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  33. Sergei N. Artemov (2012). The Ontology of Justifications in the Logical Setting. Studia Logica 100 (1-2):17-30.
    Justification Logic provides an axiomatic description of justifications and delegates the question of their nature to semantics. In this note, we address the conceptual issue of the logical type of justifications: we argue that justifications in the logical setting are naturally interpreted as sets of formulas which leads to a class of epistemic models that we call modular models . We show that Fitting models for Justification Logic naturally encode modular models and can be regarded as convenient pre-models of the (...)
    Remove from this list | Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  34. Guillaume Aucher, Guido Boella & Leendert van der Torre (2011). A Dynamic Logic for Privacy Compliance. Artificial Intelligence and Law 19 (2-3):187-231.
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  35. R. J. B. (1970). Negations. Review of Metaphysics 23 (4):745-745.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  36. Fahiem Bacchus (1999). Review: Anil Nerode, Richard A. Shore, Logic for Applications. [REVIEW] Journal of Symbolic Logic 64 (1):404-405.
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  37. Allan Bäck (1996). Richard Patterson, Aristotle's Modal Logic Reviewed By. Philosophy in Review 16 (4):278-279.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  38. Seyed Mohammad Bagheri & Morteza Moniri (2003). Some Results on Kripke Models Over an Arbitrary Fixed Frame. Mathematical Logic Quarterly 49 (5):479-484.
    We study the relations of being substructure and elementary substructure between Kripke models of intuitionistic predicate logic with the same arbitrary frame. We prove analogues of Tarski's test and Löwenheim-Skolem's theorems as determined by our definitions. The relations between corresponding worlds of two Kripke models [MATHEMATICAL SCRIPT CAPITAL K] ⪯ [MATHEMATICAL SCRIPT CAPITAL K]′ are studied.
    Remove from this list | Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  39. Philippe Balbiani, Propositional Dynamic Logic. Stanford Encyclopedia of Philosophy.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  40. Philippe Balbiani (1991). Nonmonotonic Reasoning and Modal Logic, From Negation as Failure to Default Logic. In B. Bouchon-Meunier, R. R. Yager & L. A. Zadeh (eds.), Uncertainty in Knowledge Bases. Springer. 223--231.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  41. Pedro Baltazar (2013). Probabilization of Logics: Completeness and Decidability. [REVIEW] Logica Universalis 7 (4):403-440.
    The probabilization of a logic system consists of enriching the language (the formulas) and the semantics (the models) with probabilistic features. Such an operation is said to be exogenous if the enrichment is done on top, without internal changes to the structure, and is called endogenous otherwise. These two different enrichments can be applied simultaneously to the language and semantics of a same logic. We address the problem of studying the transference of metaproperties, such as completeness and decidability, to the (...)
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  42. Y. Bar-Hillel (1966). Review: Paul Henle, Mysticism and Semantics. [REVIEW] Journal of Symbolic Logic 31 (3):497-497.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  43. Chitta Baral & Nam Tran (2005). Representation and Reasoning About Evolutions of the World in the Context of Reasoning About Actions. Studia Logica 79 (1):33 - 46.
    The first step in reasoning about actions and change involves reasoning about how the world would evolve if a certain action is executed in a certain state. Most research on this assumes the evolution to be only a single step and focus on formulating the transition function that defines changes between states due to actions. In this paper we consider cases where the evolution is more than just a single change between one state and another. This is manifested when the (...)
    Remove from this list | Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  44. Stefano Baratella & Andrea Masini (2004). An Approach to Infinitary Temporal Proof Theory. Archive for Mathematical Logic 43 (8):965-990.
    Aim of this work is to investigate from a proof-theoretic viewpoint a propositional and a predicate sequent calculus with an ω–type schema of inference that naturally interpret the propositional and the predicate until–free fragments of Linear Time Logic LTL respectively. The two calculi are based on a natural extension of ordinary sequents and of standard modal rules. We examine the pure propositional case (no extralogical axioms), the propositional and the first order predicate cases (both with a possibly infinite set of (...)
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  45. H. P. Barendregt (2013). Lambda Calculus with Types. Cambridge University Press.
    This handbook with exercises reveals the mathematical beauty of formalisms hitherto mostly used for software and hardware design and verification.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  46. Robert Barnard & Allan Hillman (2003). Review of" A Philosophical Companion to First-Order Logic". [REVIEW] Essays in Philosophy 4 (2):17.
    This Philosophical Companion collects sixteen papers organized by theme and sequence to follow the broad outline of a generic course in the logic of first-order quantification. The papers range from 5-34 pages in length and vary widely in degree of technical difficulty. Most of the papers have previously appeared, and only one – the editor’s contribution—was written specifically for the volume. With the publication of this excellent little book, Hughes therefore provides a useful template for the instructor who wants to (...)
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  47. Em Barth (1989). Introduction: The Empirical Approach to Logic in Empirical Logic. Communication and Cognition. Monographies 22 (3-4):305-312.
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  48. Imants Barušs & Robert Woodrow (2013). A Reduction Theorem for the Kripke–Joyal Semantics: Forcing Over an Arbitrary Category Can Always Be Replaced by Forcing Over a Complete Heyting Algebra. [REVIEW] Logica Universalis 7 (3):323-334.
    It is assumed that a Kripke–Joyal semantics \({\mathcal{A} = \left\langle \mathbb{C},{\rm Cov}, {\it F},\Vdash \right\rangle}\) has been defined for a first-order language \({\mathcal{L}}\) . To transform \({\mathbb{C}}\) into a Heyting algebra \({\overline{\mathbb{C}}}\) on which the forcing relation is preserved, a standard construction is used to obtain a complete Heyting algebra made up of cribles of \({\mathbb{C}}\) . A pretopology \({\overline{{\rm Cov}}}\) is defined on \({\overline{\mathbb{C}}}\) using the pretopology on \({\mathbb{C}}\) . A sheaf \({\overline{{\it F}}}\) is made up of sections of (...)
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  49. Jon Barwise (1989). The Situation in Logic. Center for the Study of Language and Inf.
    The present volume collects some of Barwise's papers written since then, those directly concerned with relations among logic, situation theory, and situation semantics. Several papers appear here for the first time.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  50. C. A. N. Baskent (2011). Completeness of Public Announcement Logic in Topological Spaces. Bulletin of Symbolic Logic 17 (1):142.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
1 — 50 / 5970