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:
858 found
Search inside:
(import / add options)   Sort by:
1 — 50 / 858
Material to categorize
  1. M. Abad, J. P. Díaz Varela, L. A. Rueda & A. M. Suardíaz (2000). Varieties of Three-Valued Heyting Algebras with a Quantifier. Studia Logica 65 (2):181-198.
    This paper is devoted to the study of some subvarieties of the variety Qof Q-Heyting algebras, that is, Heyting algebras with a quantifier. In particular, a deeper investigation is carried out in the variety Q 3 of three-valued Q-Heyting algebras to show that the structure of the lattice of subvarieties of Qis far more complicated that the lattice of subvarieties of Heyting algebras. We determine the simple and subdirectly irreducible algebras in Q 3 and we construct the lattice of subvarieties (...)
    Remove from this list | Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  2. J. C. Abbott (1976). Orthoimplication Algebras. Studia Logica 35 (2):173 - 177.
    Orthologic is defined by weakening the axioms and rules of inference of the classical propositional calculus. The resulting Lindenbaum-Tarski quotient algebra is an orthoimplication algebra which generalizes the author's implication algebra. The associated order structure is a semi-orthomodular lattice. The theory of orthomodular lattices is obtained by adjoining a falsity symbol to the underlying orthologic or a least element to the orthoimplication algebra.
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  3. Samson Abramsky & Radha Jagadeesan (1994). Games and Full Completeness for Multiplicative Linear Logic. Journal of Symbolic Logic 59 (2):543-574.
    We present a game semantics for Linear Logic, in which formulas denote games and proofs denote winning strategies. We show that our semantics yields a categorical model of Linear Logic and prove full completeness for Multiplicative Linear Logic with the MIX rule: every winning strategy is the denotation of a unique cut-free proof net. A key role is played by the notion of history-free strategy; strong connections are made between history-free strategies and the Geometry of Interaction. Our semantics incorporates a (...)
    Remove from this list | Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  4. V. Michele Abrusci (1991). Phase Semantics and Sequent Calculus for Pure Noncommutative Classical Linear Propositional Logic. Journal of Symbolic Logic 56 (4):1403-1451.
    Remove from this list | Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  5. Ernest W. Adams (1986). On the Logic of High Probability. Journal of Philosophical Logic 15 (3):255 - 279.
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  6. M. E. Adams & R. Cignoli (1990). A Note on the Axiomatization of Equational Classes of $N$-Valued Ł Ukasiewicz Algebras. Notre Dame Journal of Formal Logic 31 (2):304-307.
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  7. Romà J. Adillon & Ventura Verdú (2000). On a Contraction-Less Intuitionistic Propositional Logic with Conjunction and Fusion. Studia Logica 65 (1):11-30.
    In this paper we prove the equivalence between the Gentzen system G LJ*\c , obtained by deleting the contraction rule from the sequent calculus LJ* (which is a redundant version of LJ), the deductive system IPC*\c and the equational system associated with the variety RL of residuated lattices. This means that the variety RL is the equivalent algebraic semantics for both systems G LJ*\c in the sense of [18] and [4], respectively. The equivalence between G LJ*\c and IPC*\c is a (...)
    Remove from this list | Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  8. Stefano Aguzzoli, Matteo Bianchi & Vincenzo Marra (2009). A Temporal Semantics for Basic Logic. Studia Logica 92 (2):147 - 162.
    In the context of truth-functional propositional many-valued logics, Hájek’s Basic Fuzzy Logic BL [14] plays a major rôle. The completeness theorem proved in [7] shows that BL is the logic of all continuous t -norms and their residua. This result, however, does not directly yield any meaningful interpretation of the truth values in BL per se . In an attempt to address this issue, in this paper we introduce a complete temporal semantics for BL. Specifically, we show that BL formulas (...)
    Remove from this list | Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  9. Gerard Allwein & J. Michael Dunn (1993). Kripke Models for Linear Logic. Journal of Symbolic Logic 58 (2):514-545.
    We present a Kripke model for Girard's Linear Logic (without exponentials) in a conservative fashion where the logical functors beyond the basic lattice operations may be added one by one without recourse to such things as negation. You can either have some logical functors or not as you choose. Commutatively and associatively are isolated in such a way that the base Kripke model is a model for noncommutative, nonassociative Linear Logic. We also extend the logic by adding a coimplication operator, (...)
    Remove from this list | Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  10. Irving H. Anellis (2009). Russell and His Sources for Non-Classical Logics. Logica Universalis 3 (2):153-218.
    My purpose here is purely historical. It is not an attempt to resolve the question as to whether Russell did or did not countenance nonclassical logics, and if so, which nonclassical logics, and still less to demonstrate whether he himself contributed, in any manner, to the development of nonclassical logic. Rather, I want merely to explore and insofar as possible document, whether, and to what extent, if any, Russell interacted with the various, either the various candidates or their, ideas that (...)
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  11. G. Aldo Antonelli (2000). Book Review To Appear in the Bulletin of Symbolic Logic. [REVIEW] Bulletin of Symbolic Logic 6 (4):480-84.
    The emergence, over the last twenty years or so, of so-called “non-monotonic” logics represents one of the most significant developments both in logic and artificial intelligence. These logics were devised in order to represent defeasible reasoning, i.e., that kind of inference in which reasoners draw conclusions tentatively, reserving the right to retract them in the light of further evidence.
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  12. G. Aldo Antonelli (1999). A Directly Cautious Theory of Defeasible Consequence for Default Logic Via the Notion of General Extension. Artificial Intelligence 109 (1-2):71-109.
    This paper introduces a generalization of Reiter’s notion of “extension” for default logic. The main difference from the original version mainly lies in the way conflicts among defaults are handled: in particular, this notion of “general extension” allows defaults not explicitly triggered to pre-empt other defaults. A consequence of the adoption of such a notion of extension is that the collection of all the general extensions of a default theory turns out to have a nontrivial algebraic structure. This fact has (...)
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  13. G. Aldo Antonelli (1992). Revision Rules: An Investigation Into Non-Monotonic Inductive Definitions. Dissertation, University of Pittsburgh
    Many different modes of definition have been proposed over time, but none of them allows for circular definitions, since, according to the prevalent view, the term defined would then be lacking a precise signification. I argue that although circular definitions may at times fail uniquely to pick out a concept or an object, sense still can be made of them by using a rule of revision in the style adopted by Anil Gupta and Nuel Belnap in the theory of truth.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  14. Hiroshi Aoyama (1994). The Strong Completeness of a System Based on Kleene's Strong Three-Valued Logic. Notre Dame Journal of Formal Logic 35 (3):355-368.
    The present work, which was inspired by Kripke and McCarthy, is about a non-classical predicate logic system containing a truth predicate symbol. In this system, each sentence A is referred to not by a Gödel number but by its quotation name 'A'.
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  15. Mohammad Ardeshir & Mojtaba Moniri (1998). Intuitionistic Open Induction and Least Number Principle and the Buss Operator. Notre Dame Journal of Formal Logic 39 (2):212-220.
    In "Intuitionistic validity in -normal Kripke structures," Buss asked whether every intuitionistic theory is, for some classical theory , that of all -normal Kripke structures for which he gave an r.e. axiomatization. In the language of arithmetic and denote PA plus Open Induction or Open LNP, and are their intuitionistic deductive closures. We show is recursively axiomatizable and , while . If proves PEM but not totality of a classically provably total Diophantine function of , then and so . A (...)
    Remove from this list | Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  16. Ayda I. Arruda, R. Chuaqui & Newton C. A. Costdaa (eds.) (1980). Mathematical Logic in Latin America: Proceedings of the Iv Latin American Symposium on Mathematical Logic Held in Santiago, December 1978. Sole Distributors for the U.S.A. And Canada, Elsevier North-Holland.
    (or not oveA-complete.) . Let * be a unary operator defined on the set F of formulas of the language £ (ie, if A is a formula of £, then *A is also a ...
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  17. Charles Ashbacher (2002). Introduction to Neutrosophic Logic. American Research Press.
    Neutrosophic Logic was created by Florentin Smarandache (1995) and is an extension / combination of the fuzzy logic, intuitionistic logic, paraconsistent logic, ...
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  18. C. M. Asmus (2009). Restricted Arrow. Journal of Philosophical Logic 38 (4):405 - 431.
    In this paper I present a range of substructural logics for a conditional connective ↦. This connective was original introduced semantically via restriction on the ternary accessibility relation R for a relevant conditional. I give sound and complete proof systems for a number of variations of this semantic definition. The completeness result in this paper proceeds by step-by-step improvements of models, rather than by the one-step canonical model method. This gradual technique allows for the additional control, lacking in the canonical (...)
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  19. Jeremy Avigad, Algebraic Proofs of Cut Elimination.
    Algebraic proofs of the cut-elimination theorems for classical and intuitionistic logic are presented, and are used to show how one can sometimes extract a constructive proof and an algorithm from a proof that is nonconstructive. A variation of the double-negation translation is also discussed: if ϕ is provable classically, then ¬(¬ϕ)nf is provable in minimal logic, where θnf denotes the negation-normal form of θ. The translation is used to show that cut-elimination theorems for classical logic can be viewed as special (...)
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  20. Jeremy Avigad (2000). Interpreting Classical Theories in Constructive Ones. Journal of Symbolic Logic 65 (4):1785-1812.
    A number of classical theories are interpreted in analogous theories that are based on intuitionistic logic. The classical theories considered include subsystems of first- and second-order arithmetic, bounded arithmetic, and admissible set theory.
    Remove from this list | Direct download (11 more)  
     
    My bibliography  
     
    Export citation  
  21. A. Avron (1998). Multiplicative Conjunction and an Algebraic Meaning of Contraction and Weakening. Journal of Symbolic Logic 63 (3):831-859.
    We show that the elimination rule for the multiplicative (or intensional) conjunction $\wedge$ is admissible in many important multiplicative substructural logics. These include LL m (the multiplicative fragment of Linear Logic) and RMI m (the system obtained from LL m by adding the contraction axiom and its converse, the mingle axiom.) An exception is R m (the intensional fragment of the relevance logic R, which is LL m together with the contraction axiom). Let SLL m and SR m be, respectively, (...)
    Remove from this list | Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  22. A. Avron & B. Konikowska (2008). Rough Sets and 3-Valued Logics. Studia Logica 90 (1):69 - 92.
    In the paper we explore the idea of describing Pawlak’s rough sets using three-valued logic, whereby the value t corresponds to the positive region of a set, the value f — to the negative region, and the undefined value u — to the border of the set. Due to the properties of the above regions in rough set theory, the semantics of the logic is described using a non-deterministic matrix (Nmatrix). With the strong semantics, where only the value t is (...)
    Remove from this list | Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  23. Arnon Avron, A Formula-Preferential Base for Paraconsistent and Plausible Reasoning Systems.
    in models. We show that these natural preferential In the research on paraconsistency, preferential systems systems that were originally designed for paraconwere used for constructing logics which are paraconsistent sistent reasoning fulfill a key condition (stopperedbut stronger than substructural paraconsistent logics. The ness or smoothness) from the theoretical research preferences in these systems were defined in different ways. of nonmonotonic reasoning. Consequently, the Some were based on checking which abnormal formulas nonmonotonic consequence relations that they in-.
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  24. Arnon Avron, A Model-Theoretic Approach for Recovering Consistent Data From Inconsistent Knowledge-Bases.
    One of the most signi cant drawbacks of classical logic is its being useless in the presence of an inconsistency. Nevertheless, the classical calculus is a very convenient framework to work with. In this work we propose means for drawing conclusions from systems that are based on classical logic, although the informationmightbe inconsistent. The idea is to detect those parts of the knowledge-base that \cause" the inconsistency, and isolate the parts that are \recoverable". We do this by temporarily switching into (...)
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  25. Arnon Avron, General Patterns for Nonmonotonic Reasoning: From Basic Entailments to Plausible Relations.
    This paper has two goals. First, we develop frameworks for logical systems which are able to re ect not only nonmonotonic patterns of reasoning, but also paraconsistent reasoning. Our second goal is to have a better understanding of the conditions that a useful relation for nonmonotonic reasoning should satisfy. For this we consider a sequence of generalizations of the pioneering works of Gabbay, Kraus, Lehmann, Magidor and Makinson. These generalizations allow the use of monotonic nonclassical logics as the underlying logic (...)
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  26. Arnon Avron (1990). Relevance and Paraconsistency--A New Approach. Journal of Symbolic Logic 55 (2):707-732.
    Remove from this list | Direct download (9 more)  
     
    My bibliography  
     
    Export citation  
  27. Arnon Avron (1987). A Constructive Analysis of RM. Journal of Symbolic Logic 52 (4):939 - 951.
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  28. Arnon Avron (1986). On an Implication Connective of ${\Rm RM}$. Notre Dame Journal of Formal Logic 27 (2):201-209.
  29. Arnon Avron (1984). Relevant Entailment--Semantics and Formal Systems. Journal of Symbolic Logic 49 (2):334-342.
  30. Matthias Baaz, Christian G. Fermüller, Gernot Salzer & Richard Zach (1998). Labeled Calculi and Finite-Valued Logics. Studia Logica 61 (1):7-33.
    A general class of labeled sequent calculi is investigated, and necessary and sufficient conditions are given for when such a calculus is sound and complete for a finite-valued logic if the labels are interpreted as sets of truth values (sets-as-signs). Furthermore, it is shown that any finite-valued logic can be given an axiomatization by such a labeled calculus using arbitrary "systems of signs," i.e., of sets of truth values, as labels. The number of labels needed is logarithmic in the number (...)
    Remove from this list | Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  31. Matthias Baaz & Rosalie Iemhoff (2006). Gentzen Calculi for the Existence Predicate. Studia Logica 82 (1):7 - 23.
    We introduce Gentzen calculi for intuitionistic logic extended with an existence predicate. Such a logic was first introduced by Dana Scott, who provided a proof system for it in Hilbert style. We prove that the Gentzen calculus has cut elimination in so far that all cuts can be restricted to very simple ones. Applications of this logic to Skolemization, truth value logics and linear frames are also discussed.
    Remove from this list | Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  32. David Basin, Seán Matthews & Luca Viganò (1998). Natural Deduction for Non-Classical Logics. Studia Logica 60 (1):119-160.
    We present a framework for machine implementation of families of non-classical logics with Kripke-style semantics. We decompose a logic into two interacting parts, each a natural deduction system: a base logic of labelled formulae, and a theory of labels characterizing the properties of the Kripke models. By appropriate combinations we capture both partial and complete fragments of large families of non-classical logics such as modal, relevance, and intuitionistic logics. Our approach is modular and supports uniform proofs of soundness, completeness and (...)
    Remove from this list | Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  33. Diderik Batens (2007). A Universal Logic Approach to Adaptive Logics. Logica Universalis 1 (1):221-242.
    . In this paper, adaptive logics are studied from the viewpoint of universal logic (in the sense of the study of common structures of logics). The common structure of a large set of adaptive logics is described. It is shown that this structure determines the proof theory as well as the semantics of the adaptive logics, and moreover that most properties of the logics can be proved by relying solely on the structure, viz. without invoking any specific properties of the (...)
    Remove from this list | Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  34. Diderik Batens (2000). Minimally Abnormal Models in Some Adaptive Logics. Synthese 125 (1-2):5-18.
    In an adaptive logic APL, based on a (monotonic) non-standardlogic PL the consequences of can be defined in terms ofa selection of the PL-models of . An important property ofthe adaptive logics ACLuN1, ACLuN2, ACLuNs1, andACLuNs2 logics is proved: whenever a model is not selected, this isjustified in terms of a selected model (Strong Reassurance). Theproperty fails for Priest's LP m because its way of measuring thedegree of abnormality of a model is incoherent – correcting thisdelivers the property.
    Remove from this list | Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  35. Diderik Batens & Joke Meheus (2001). Shortcuts and Dynamic Marking in the Tableau Method for Adaptive Logics. Studia Logica 69 (2):221-248.
    Adaptive logics typically pertain to reasoning procedures for which there is no positive test. In [7], we presented a tableau method for two inconsistency-adaptive logics. In the present paper, we describe these methods and present several ways to increase their efficiency. This culminates in a dynamic marking procedure that indicates which branches have to be extended first, and thus guides one towards a decision — the conclusion follows or does not follow — in a very economical way.
    Remove from this list | Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  36. Diderik Batens & Joke Meheus (2000). The Adaptive Logic of Compatibility. Studia Logica 66 (3):327-348.
    This paper describes the adaptive logic of compatibility and its dynamic proof theory. The results derive from insights in inconsistency-adaptive logic, but are themselves very simple and philosophically unobjectionable. In the absence of a positive test, dynamic proof theories lead, in the long run, to correct results and, in the short run, sometimes to final decisions but always to sensible estimates. The paper contains a new and natural kind of semantics for S5from which it follows that a specific subset of (...)
    Remove from this list | Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  37. Frank A. Bäuerle, David Albrecht, John N. Crossley & John S. Jeavons (1998). Curry-Howard Terms for Linear Logic. Studia Logica 61 (2):223-235.
    In this paper we 1. provide a natural deduction system for full first-order linear logic, 2. introduce Curry-Howard-style terms for this version of linear logic, 3. extend the notion of substitution of Curry-Howard terms for term variables, 4. define the reduction rules for the Curry-Howard terms and 5. outline a proof of the strong normalization for the full system of linear logic using a development of Girard's candidates for reducibility, thereby providing an alternative to Girard's proof using proof-nets.
    Remove from this list | Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  38. Edward Baŀuka (1965). On Verification of the Expressions of Many-Valued Sentential Calculi. I. Studia Logica 17 (1):53 - 73.
    Remove from this list | Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  39. Jc Beall (2003). Algebraic Methods in Philosophical Logic. Australasian Journal of Philosophy 81 (3):442 – 444.
    Book Information Algebraic Methods in Philosophical Logic. By J. Michael Dunn and Gary Hardegree. Clarendon Press. Oxford. 2001. Pp. xv + 470. 60.50.
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  40. Jc Beall & David Ripley, Nonclassical Theories of Truth.
    This chapter attempts to give a brief overview of nonclassical (-logic) theories of truth. Due to space limitations, we follow a victory-through-sacrifice policy: sacrifice details in exchange for clarity of big-picture ideas. This policy results in our giving all-too-brief treatment to certain topics that have dominated discussion in the non-classical-logic area of truth studies. (This is particularly so of the ‘suitable conditoinal’ issue: §4.3.) Still, we present enough representative ideas that one may fruitfully turn from this essay to the more-detailed (...)
    Remove from this list |
    Translate to English
    | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  41. Gordon Beavers (1993). Automated Theorem Proving for Łukasiewicz Logics. Studia Logica 52 (2):183 - 195.
    This paper is concerned with decision proceedures for the 0-valued ukasiewicz logics,. It is shown how linear algebra can be used to construct an automated theorem checker. Two decision proceedures are described which depend on a linear programming package. An algorithm is given for the verification of consequence relations in, and a connection is made between theorem checking in two-valued logic and theorem checking in which implies that determing of a -free formula whether it takes the value one is NP-complete (...)
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  42. W. J. Blok & J. G. Raftery (2004). Fragments of R-Mingle. Studia Logica 78 (1-2):59 - 106.
    The logic RM and its basic fragments (always with implication) are considered here as entire consequence relations, rather than as sets of theorems. A new observation made here is that the disjunction of RM is definable in terms of its other positive propositional connectives, unlike that of R. The basic fragments of RM therefore fall naturally into two classes, according to whether disjunction is or is not definable. In the equivalent quasivariety semantics of these fragments, which consist of subreducts of (...)
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  43. V. A. Bocharov (1983). Subject-Predicate Calculus Free From Existential Import. Studia Logica 42 (2-3):209 - 221.
    Two subject-predicate calculi with equality,SP = and its extensionUSP =, are presented as systems of natural deduction. Both the calculi are systems of free logic. Their presentation is preceded by an intuitive motivation.It is shown that Aristotle's syllogistics without the laws of identitySaP andSiP is definable withinSP =, and that the first-order predicate logic is definable withinUSP =.
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  44. M. W. Bunder (1982). Deduction Theorems for Weak Implicational Logics. Studia Logica 41 (2-3):95 - 108.
    The standard deduction theorem or introduction rule for implication, for classical logic is also valid for intuitionistic logic, but just as with predicate logic, other rules of inference have to be restricted if the theorem is to hold for weaker implicational logics.In this paper we look in detail at special cases of the Gentzen rule for and show that various subsets of these in effect constitute deduction theorems determining all the theorems of many well known as well as not well (...)
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  45. Ricardo Caferra, Stéphane Demri & Michel Herment (1993). A Framework for the Transfer of Proofs, Lemmas and Strategies From Classical to Non Classical Logics. Studia Logica 52 (2):197 - 232.
    There exist valuable methods for theorem proving in non classical logics based on translation from these logics into first-order classical logic (abbreviated henceforth FOL). The key notion in these approaches istranslation from aSource Logic (henceforth abbreviated SL) to aTarget Logic (henceforth abbreviated TL). These methods are concerned with the problem offinding a proof in TL by translating a formula in SL, but they do not address the very important problem ofpresenting proofs in SL via a backward translation. We propose a (...)
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  46. Walter A. Carnielli, Marcelo E. Coniglio & Itala M. L. D'Ottaviano (2009). New Dimensions on Translations Between Logics. Logica Universalis 3 (1):1-18.
    After a brief promenade on the several notions of translations that appear in the literature, we concentrate on three paradigms of translations between logics: ( conservative ) translations , transfers and contextual translations . Though independent, such approaches are here compared and assessed against questions about the meaning of a translation and about comparative strength and extensibility of a logic with respect to another.
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  47. Alexander Chagrov & Michael Zakharyashchev (1991). The Disjunction Property of Intermediate Propositional Logics. Studia Logica 50 (2):189 - 216.
    This paper is a survey of results concerning the disjunction property, Halldén-completeness, and other related properties of intermediate prepositional logics and normal modal logics containing S4.
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  48. Gérard Chazal (2009). Logiques Non-Standard. Editions Universitaires de Dijon.
    Remove from this list |
    Translate to English
    |
     
    My bibliography  
     
    Export citation  
  49. Michael Clark (1976). Review of Goddard & Routley, The Logic of Significance and Context. [REVIEW] Mind 85.
    Remove from this list |
    Translate to English
    |
     
    My bibliography  
     
    Export citation  
  50. J. Delgrande & T. Schaub (eds.) (2004). Proceedings of NMR 2004. AAAI.
    Remove from this list |
    Translate to English
    |
     
    My bibliography  
     
    Export citation  
1 — 50 / 858