A three-valued free logic for presuppositional languages

Notre Dame Journal of Formal Logic 21 (3):549-571 (1980)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1305/ndjfl/1093883179

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,202

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

How to avoid deviance (in logic).Walter Sinnott-Armstrong & Amit Malhotra - 2002 - History and Philosophy of Logic 23 (3):215--36.
Kleene's three valued logics and their children.Melvin Fitting - unknown
Three-valued logics in modal logic.Barteld Kooi & Allard Tamminga - 2013 - Studia Logica 101 (5):1061-1072.
Dual Equivalent Two-valued Under-determined and Over-determined Interpretations for Łukasiewicz's 3-valued Logic Ł3.Gemma Robles, Francisco Salto & José M. Méndez - 2013 - Journal of Philosophical Logic (2-3):1-30.
How to be R eally Contraction-Free.Greg Restall - 1993 - Studia Logica 52 (3):381 - 391.
Three-valued free tense logic.Robert P. McArthur - 1977 - Notre Dame Journal of Formal Logic 18 (1):101-106.
Algorithmic logic. Multiple-valued extensions.Helena Rasiowa - 1979 - Studia Logica 38 (4):317 - 335.
Bilattices and the Semantics of Logic Programming.Melvin Fitting - unknown
A descriptive characterisation of linear languages.Tore Langholm - 2006 - Journal of Logic, Language and Information 15 (3):233-250.
Bilattices In Logic Programming.Melvin Fitting - unknown
Finiteness in infinite-valued łukasiewicz logic.Stefano Aguzzoli & Agata Ciabattoni - 2000 - Journal of Logic, Language and Information 9 (1):5-29.
Conceptual Schemes and Presuppositional Languages.Xinli Wang - 2007 reprint - The Proceedings of the Twenty-First World Congress of Philosophy 6:119-124.
Formal languages defined by the underlying structure of their words.J. P. Ressayre - 1988 - Journal of Symbolic Logic 53 (4):1009-1026.
Learning without negative examples via variable-valued logic characterizations: the uniclass inductive program AQ7UNI.Robert Stepp - 1979 - Urbana: Dept. of Computer Science, University of Illinois at Urbana-Champaign.

Analytics

Added to PP
2010-08-24

Downloads
14 (#934,671)

6 months
5 (#544,079)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references