Switch to: Citations

Add references

You must login to add references.
  1. How a computer should think.Nuel Belnap - 1977 - In Gilbert Ryle (ed.), Contemporary aspects of philosophy. Boston: Oriel Press.
    Download  
     
    Export citation  
     
    Bookmark   158 citations  
  • Some investigations of varieties of N -lattices-lattices.Andrzej Sendlewski - 1984 - Studia Logica 43 (3):257-280.
    We examine some extensions of the constructive propositional logic with strong negation in the setting of varieties of $\mathcal{N}$ -lattices. The main aim of the paper is to give a description of all pretabular, primitive and preprimitive varieties of $\mathcal{N}$ -lattices.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • On extensions of intermediate logics by strong negation.Marcus Kracht - 1998 - Journal of Philosophical Logic 27 (1):49-73.
    In this paper we will study the properties of the least extension n(Λ) of a given intermediate logic Λ by a strong negation. It is shown that the mapping from Λ to n(Λ) is a homomorphism of complete lattices, preserving and reflecting finite model property, frame-completeness, interpolation and decidability. A general characterization of those constructive logics is given which are of the form n(Λ). This summarizes results that can be found already in [13, 14] and [4]. Furthermore, we determine the (...)
    Download  
     
    Export citation  
     
    Bookmark   33 citations  
  • The Craig interpolation theorem for prepositional logics with strong negation.Valentin Goranko - 1985 - Studia Logica 44 (3):291 - 317.
    This paper deals with, prepositional calculi with strong negation (N-logics) in which the Craig interpolation theorem holds. N-logics are defined to be axiomatic strengthenings of the intuitionistic calculus enriched with a unary connective called strong negation. There exists continuum of N-logics, but the Craig interpolation theorem holds only in 14 of them.
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • Natural 3-valued logics—characterization and proof theory.Arnon Avron - 1991 - Journal of Symbolic Logic 56 (1):276-294.
    Download  
     
    Export citation  
     
    Bookmark   83 citations  
  • A useful four-valued logic.N. D. Belnap - 1977 - In J. M. Dunn & G. Epstein (eds.), Modern Uses of Multiple-Valued Logic. D. Reidel.
    Download  
     
    Export citation  
     
    Bookmark   261 citations  
  • Some Investigations of Varieties of N-Lattices.Andrzej Sendlewski - 1984 - Studia Logica 43 (3):257 - 280.
    We examine some extensions of the constructive propositional logic with strong negation in the setting of varieties of N-lattices. The main aim of the paper is to give a description of all pretabular, primitive and preprimitive varieties of N-lattices.
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • Notes on N-lattices and constructive logic with strong negation.D. Vakarelov - 1977 - Studia Logica 36 (1-2):109-125.
    Download  
     
    Export citation  
     
    Bookmark   77 citations  
  • Intuitive semantics for some three-valued logics connected with information, contrariety and subcontrariety.Dimiter Vakarelov - 1989 - Studia Logica 48 (4):565 - 575.
    Four known three-valued logics are formulated axiomatically and several completeness theorems with respect to nonstandard intuitive semantics, connected with the notions of information, contrariety and subcontrariety is given.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Axiomatic extensions of the constructive logic with strong negation and the disjunction property.Andrzej Sendlewski - 1995 - Studia Logica 55 (3):377 - 388.
    We study axiomatic extensions of the propositional constructive logic with strong negation having the disjunction property in terms of corresponding to them varieties of Nelson algebras. Any such varietyV is characterized by the property: (PQWC) ifA,B V, thenA×B is a homomorphic image of some well-connected algebra ofV.We prove:• each varietyV of Nelson algebras with PQWC lies in the fibre –1(W) for some varietyW of Heyting algebras having PQWC, • for any varietyW of Heyting algebras with PQWC the least and the (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • N-Lattices and Constructive Logic with Strong Negation.H. Rasiowa - 1969 - Journal of Symbolic Logic 34 (1):118-118.
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • On the structure of paraconsistent extensions of Johansson's logic.Sergei P. Odintsov - 2005 - Journal of Applied Logic 3 (1):43-65.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • On the representation of n4-lattices.Sergei P. Odintsov - 2004 - Studia Logica 76 (3):385 - 405.
    N4-lattices provide algebraic semantics for the logic N4, the paraconsistent variant of Nelson's logic with strong negation. We obtain the representation of N4-lattices showing that the structure of an arbitrary N4-lattice is completely determined by a suitable implicative lattice with distinguished filter and ideal. We introduce also special filters on N4-lattices and prove that special filters are exactly kernels of homomorphisms. Criteria of embeddability and to be a homomorphic image are obtained for N4-lattices in terms of the above mentioned representation. (...)
    Download  
     
    Export citation  
     
    Bookmark   31 citations  
  • On an implication connective of RM.Arnon Avron - 1986 - Notre Dame Journal of Formal Logic 27 (2):201-209.
    Download  
     
    Export citation  
     
    Bookmark   23 citations