An algorithm for inferring multivalued dependencies that works also for a subclass of propositional logic

Urbana: Dept. of Computer Science, University of Illinois at Urbana-Champaign (1979)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Call number

QA9.45.I4 no. 954

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,459

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

Characterising nested database dependencies by fragments of propositional logic.Sven Hartmann & Sebastian Link - 2008 - Annals of Pure and Applied Logic 152 (1-3):84-106.
Proof of the Axiomatizability of full Many-Valued Systems of Propositional Calculus.Jerzy Slupecki - 1946 - Journal of Symbolic Logic 11 (3):92-93.
About Connection of the First‐Order Functional Calculus With Many Valued Propositional Calculi.Juliusz Reichbach - 1963 - Mathematical Logic Quarterly 9 (8‐9):117-124.
Review: Jerzy Slupecki, Proof of the Axiomatizability of full Many-Valued Systems of Propositional Calculus. [REVIEW]Henryk Stonert - 1946 - Journal of Symbolic Logic 11 (3):92-93.
Approximating Propositional Calculi by Finite-valued Logics.Matthias Baaz & Richard Zach - 1994 - In Baaz Matthias & Zach Richard (eds.), 24th International Symposium on Multiple-valued Logic, 1994. Proceedings. IEEE Press. pp. 257–263.
Why Fuzzy Logic?Petr Hájek - 2002 - In Dale Jacquette (ed.), A Companion to Philosophical Logic. Malden, MA, USA: Wiley-Blackwell. pp. 595–605.
Wajsberg's algorithm for the classical propositional calculus.Ewa Zarnecka-Bialy - 1973 - Bulletin of the Section of Logic 2 (2):97-102.
From Intuitionism to Many-Valued Logics Through Kripke Models.Saeed Salehi - 2021 - In Mojtaba Mojtahedi, Shahid Rahman & MohammadSaleh Zarepour (eds.), Mathematics, Logic, and their Philosophies: Essays in Honour of Mohammad Ardeshir. Springer. pp. 339-348.
Review: Alan Rose, Strong Completeness of Fragments of the Propositional Calculus; Alan Rose, The Degree of Completeness of a Partial System of the 2-Valued Propositional Calculus. [REVIEW]R. C. Lyndon - 1952 - Journal of Symbolic Logic 17 (2):147-147.

Analytics

Added to PP
2009-01-28

Downloads
1 (#1,946,798)

6 months
1 (#1,892,267)

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
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