Dualising Intuitionictic Negation

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dualising Initial Algebras

Whilst the relationship between initial algebras and monads is well understood, the relationship between final coalgebras and comonads is less well explored. This paper shows that the problem is more subtle than might appear at first glance: final coalgebras can form monads just as easily as comonads, and, dually, initial algebras form both monads and comonads. In developing these theories we s...

متن کامل

On the Relative Dualising Sheaf of a Symplectic Lefschetz Fibration

For the dualising sheaf ωX/B of a relatively minimal symplectic Lefschetz fibration π : X → B, we show that c21(ωX/B) ≥ 0. Some consequences related to the Hodge bundle are obtained.

متن کامل

Negation Without Negation in Probabilistic Logic Programming

Probabilistic logic programs without negation can have cycles (with a preference for false), but cannot represent all conditional distributions. Probabilistic logic programs with negation can represent arbitrary conditional probabilities, but with cycles they create logical inconsistencies. We show how allowing negative noise probabilities allows us to represent arbitrary conditional probabilit...

متن کامل

Negation and Double-Negation of Chinese Oppositeness

Oppositeness refers to the paradigmatic relationship of two words holding the contrast meanings. The fact that linguistic opposite differs from logical contrast has been discussed in theories, but has not been tested in practice. In this paper, we investigate three main subtypes of Chinese oppositeness, via using logical tests of negation and double-negation. Result shows that purely logical te...

متن کامل

Combining Explicit Negation and Negation by Failure via Belnap's Logic Combining Explicit Negation and Negation by Failure via Belnap's Logic

This paper deals with logic programs containing two kinds of negation: negation as failure and explicit negation, allowing two diierent forms of uncertainty reasoning in the presence of incomplete information. Such programs have been introduced by Gelfond and Lifschitz and called extended programs. We provide them with a logical semantics in the style of Kunen, based on Belnap's four-valued log...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Principia: an international journal of epistemology

سال: 2009

ISSN: 1808-1711,1414-4247

DOI: 10.5007/1808-1711.2009v13n2p165