Has a Post-Complete Axiomatization

Abstract

and I CaPI e D, then I Pl e D for all similar assignments. (2) For all values of P and q, I CPCNPql e D. (3) For all values of the variables in a, if la( e U then INal e D. (4) The F,P are constant functions such that, for all values of P, ~ FIP~ = 1, I F, Pl = 2,..., I F„t I = m.

Links

PhilArchive



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

External links

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

Through your library

  • Only published works are available at libraries.

Similar books and articles

The Power of a Propositional Constant.Robert Goldblatt & Tomasz Kowalski - 2012 - Journal of Philosophical Logic (1):1-20.
An axiomatization of full computation tree logic.M. Reynolds - 2001 - Journal of Symbolic Logic 66 (3):1011-1057.
Functional dependencies between variables.Natasha Alechina - 2000 - Studia Logica 66 (2):273-283.
Complementary Logics for Classical Propositional Languages.Achille C. Varzi - 1992 - Kriterion - Journal of Philosophy 4 (1):20-24.
Reasoning About Social Choice Functions.Nicolas Troquard, Wiebe Hoek & Michael Wooldridge - 2011 - Journal of Philosophical Logic 40 (4):473-498.

Analytics

Added to PP
2011-02-15

Downloads
33 (#470,805)

6 months
3 (#1,023,809)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Nuel Belnap
University of Pittsburgh

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references