Switch to: Citations

References in:

Bilattices are nice things

In Thomas Bolander (ed.), Self-reference. Center for the Study of Language and Inf (2008)

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   159 citations  
  • Outline of a theory of truth.Saul Kripke - 1975 - Journal of Philosophy 72 (19):690-716.
    A formal theory of truth, alternative to tarski's 'orthodox' theory, based on truth-value gaps, is presented. the theory is proposed as a fairly plausible model for natural language and as one which allows rigorous definitions to be given for various intuitive concepts, such as those of 'grounded' and 'paradoxical' sentences.
    Download  
     
    Export citation  
     
    Bookmark   892 citations  
  • Reasoning with logical bilattices.Ofer Arieli & Arnon Avron - 1996 - Journal of Logic, Language and Information 5 (1):25--63.
    The notion of bilattice was introduced by Ginsberg, and further examined by Fitting, as a general framework for many applications. In the present paper we develop proof systems, which correspond to bilattices in an essential way. For this goal we introduce the notion of logical bilattices. We also show how they can be used for efficient inferences from possibly inconsistent data. For this we incorporate certain ideas of Kifer and Lozinskii, which happen to suit well the context of our work. (...)
    Download  
     
    Export citation  
     
    Bookmark   112 citations  
  • Multivalued logics: a uniform approach to reasoning in AI.Matthew Ginsberg - 1988 - Computer Intelligence 4 (1):256--316.
    Download  
     
    Export citation  
     
    Bookmark   32 citations  
  • Singular terms, truth-value gaps, and free logic.Bas C. van Fraassen - 1966 - Journal of Philosophy 63 (17):481-495.
    Download  
     
    Export citation  
     
    Bookmark   230 citations  
  • A theory of truth that prefers falsehood.Melvin Fitting - 1997 - Journal of Philosophical Logic 26 (5):477-500.
    We introduce a subclass of Kripke's fixed points in which falsehood is the preferred truth value. In all of these the truthteller evaluates to false, while the liar evaluates to undefined (or overdefined). The mathematical structure of this family of fixed points is investigated and is shown to have many nice features. It is noted that a similar class of fixed points, preferring truth, can also be studied. The notion of intrinsic is shown to relativize to these two subclasses. The (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Truth and reflection.Stephen Yablo - 1985 - Journal of Philosophical Logic 14 (3):297 - 349.
    Many topics have not been covered, in most cases because I don't know quite what to say about them. Would it be possible to add a decidability predicate to the language? What about stronger connectives, like exclusion negation or Lukasiewicz implication? Would an expanded language do better at expressing its own semantics? Would it contain new and more terrible paradoxes? Can the account be supplemented with a workable notion of inherent truth (see note 36)? In what sense does stage semantics (...)
    Download  
     
    Export citation  
     
    Bookmark   74 citations  
  • Notes on the mathematical aspects of Kripke’s theory of truth.Melvin Fitting - 1986 - Notre Dame Journal of Formal Logic 27 (1):75-88.
    Download  
     
    Export citation  
     
    Bookmark   23 citations  
  • (2 other versions)The Stable Model Semantics for Logic Programming.Melvin Fitting - 1992 - Journal of Symbolic Logic 57 (1):274-277.
    Download  
     
    Export citation  
     
    Bookmark   57 citations  
  • Bilattices In Logic Programming.Melvin Fitting - unknown
    Bilattices, introduced by M. Ginsberg, constitute an elegant family of multiple-valued logics. Those meeting certain natural conditions have provided the basis for the semantics of a family of logic programming languages. Now we consider further restrictions on bilattices, to narrow things down to logic programming languages that can, at least in principle, be implemented. Appropriate bilattice background information is presented, so the paper is relatively self-contained.
    Download  
     
    Export citation  
     
    Bookmark   31 citations  
  • Knowledge, Uncertainty and Ignorance in Logic: Bilattices and beyond.George Gargov - 1999 - Journal of Applied Non-Classical Logics 9 (2-3):195-283.
    ABSTRACT In the paper we present a survey of some approaches to the semantics of many-valued propositional systems. These approaches are inspired on one hand by classical problems in the investigations of logical aspects of epistemic activity: knowledge and truth, contradictions, beliefs, reliability of data, etc. On the other hand they reflect contemporary concerns of researchers in Artificial Intelligence (and Cognitive Science in general) with inferences drawn from imperfect information, even from total ignorance. We treat the mathematical apparatus that has (...)
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • Kleene's logic, generalized.Melvin Fitting - unknown
    Kleene’s well-known strong three-valued logic is shown to be one of a family of logics with similar mathematical properties. These logics are produced by an intuitively natural construction. The resulting logics have direct relationships with bilattices. In addition they possess mathematical features that lend themselves well to semantical constructions based on fixpoint procedures, as in logic programming.
    Download  
     
    Export citation  
     
    Bookmark   31 citations