A generalization of Nelson's algorithm for obtaining prime implicants
Journal of Symbolic Logic 30 (1):8-12 (1965)
| Abstract | This article has no associated abstract. (fix it) | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,705 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesAndrzej Sendlewski (1990). Nelson Algebras Through Heyting Ones: I. Studia Logica 49 (1):105 - 126.
Crawford L. Elder (1999). Ontology and Realism About Modality. Australasian Journal of Philosophy 77 (3):292 – 302.
Wojciech Buszkowski & Gerald Penn (1990). Categorial Grammars Determined From Linguistic Data by Unification. Studia Logica 49 (4):431 - 454.
Marjorie Rhodes & Daniel Brickman (2010). The Role of Within-Category Variability in Category-Based Induction: A Developmental Study. Cognitive Science 34 (8):1561-1573.
Barbara F. Csima, Denis R. Hirschfeldt, Julia F. Knight & Robert I. Soare (2004). Bounding Prime Models. Journal of Symbolic Logic 69 (4):1117 - 1142.
David A. Nelson (1992). Deductive Program Verification (a Practitioner's Commentary). Minds and Machines 2 (3).
Sauro Tulipani (1985). An Algorithm to Determine, for Any Prime P, a Polynomial-Sized Horn Sentence Which Expresses "the Cardinality is Not P". Journal of Symbolic Logic 50 (4):1062-1064.
Alexander S. Karpenko (1989). Characterization of Prime Numbers in Łukasiewicz's Logical Matrix. Studia Logica 48 (4):465 - 478.
Sergiu Rudeanu (1967). Axiomatization of Certain Problems of Minimization. Studia Logica 20 (1):37 - 61.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads4 ( #178,800 of 549,196 )Recent downloads (6 months)1 ( #63,397 of 549,196 )How can I increase my downloads? |
My notes
Discussion
