On Simplification Algorithms for Disjunctive Normal Forms

Journal of Symbolic Logic 31 (1):141-141 (1966)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2270684

Links

PhilArchive



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

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

Review: Yu. I. Zuravlev, E. Mendelson, On Simplification Algorithms for Disjunctive Normal Forms. [REVIEW]Andrzej Rowicki - 1966 - Journal of Symbolic Logic 31 (1):141-141.
Review: U. I. Zuravlev, Algorithms with Finite Memory on Disjunctive Normal Forms. [REVIEW]Andrzej Rowicki - 1968 - Journal of Symbolic Logic 33 (4):630-630.
Review: U. I. Zuravlev, On Various Concepts, of Minimality for Disjunctive Normal Forms. [REVIEW]Andrzej Rowicki - 1968 - Journal of Symbolic Logic 33 (4):630-630.
Review: F.I. Andon, Ob odnom podhode k minimizacii sistem buleoyh funkcij (On One Approach to the Minimization of Systems of Boolean Functions); F. I. Andon, Algoritm uproscenia d.n.f. bulevyh funckij (A Simplification Alogorithm of a Disjunctive Normal Form of the Boolean Functions). [REVIEW]A. Adam - 1970 - Journal of Symbolic Logic 35 (2):330-330.
Review: U. I. Zuravlev, On Constructing Minimal Disjunctive normal Forms for Functions of the Algebra of Logic. [REVIEW]Andrzej Rowicki - 1966 - Journal of Symbolic Logic 31 (1):140-141.
Classes of Markov-like k-ALGORITHMS.Zdzislaw Grodzki & Jerzy Mycka - 1996 - Reports on Mathematical Logic:83-99.
Review: J. W. Swanson, A Reduction Theorem for Normal Algorithms. [REVIEW]Elliott Mendelson - 1967 - Journal of Symbolic Logic 32 (1):123-123.
Normal forms for elementary patterns.Timothy J. Carlson & Gunnar Wilken - 2012 - Journal of Symbolic Logic 77 (1):174-194.
Normal forms of Levi-flat hypersurfaces with Arnold type singularities.Arturo Fernandez-Pérez - 2014 - Annali della Scuola Normale Superiore di Pisa- Classe di Scienze 13 (3):745-774.
Normal forms for fuzzy logics: a proof-theoretic approach. [REVIEW]Petr Cintula & George Metcalfe - 2007 - Archive for Mathematical Logic 46 (5-6):347-363.
Prover9's Simplification Explained Away.Paweł Garbacz - 2012 - Australasian Journal of Philosophy 90 (3):585 - 592.
A simplification procedure for alternational normal schemata.John Riser - 1979 - Notre Dame Journal of Formal Logic 20 (4):765-767.
Disjunctive Predicates.David H. Sanford - 1993 - American Philosophical Quarterly 30 (2):167-1722.
How to Rule Out Disjunctive Properties.Paul Audi - 2013 - Noûs 47 (4):748-766.
Normal bimodal logics of ability and action.Mark A. Brown - 1992 - Studia Logica 51 (3-4):519 - 532.

Analytics

Added to PP
2015-02-05

Downloads
10 (#1,185,833)

6 months
3 (#967,806)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references