A Double-Iteration Property of Boolean Functions

Journal of Symbolic Logic 25 (3):299-300 (1960)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2964742

Links

PhilArchive



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

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

A double-iteration property of Boolean functions.Carl Lyngholm - 1960 - Notre Dame Journal of Formal Logic 1 (3):111-114.
Errata: ``A double-iteration property of Boolean functions''.Carl Lyngholm & Wolfgang Yourgrau - 1961 - Notre Dame Journal of Formal Logic 2 (4):259-259.
Review: Carl Lyngholm, Wolfgang Yourgrau, A Double-Iteration Property of Boolean Functions. [REVIEW]William Wernick - 1960 - Journal of Symbolic Logic 25 (3):299-300.
Lyngholm Carl and Yourgrau Wolfgang. A double-iteration property of Boolean functions. Notre Dame journal of formal logic, vol. 1 , pp. 111–114. [REVIEW]William Wernick - 1960 - Journal of Symbolic Logic 25 (3):299-300.
Bounded iteration and unary functions.Stefano Mazzanti - 2005 - Mathematical Logic Quarterly 51 (1):89-94.
Almost All Complex Quantifiers are Simple.Jakub Szymanik - 2010 - In C. Ebert, G. Jäger, M. Kracht & J. Michaelis (eds.), Mathematics of Language 10/11, Lecture Notes in Computer Science 6149. Springer.
Minimum‐sized Infinite Partitions of Boolean Algebras.J. Donald Monk - 1996 - Mathematical Logic Quarterly 42 (1):537-550.
Applications of the ergodic iteration theorem.Jindřich Zapletal - 2010 - Mathematical Logic Quarterly 56 (2):116-125.
P ≠ NP for all infinite Boolean algebras.Mihai Prunescu - 2003 - Mathematical Logic Quarterly 49 (2):210-213.
Factor Congruence Lifting Property.George Georgescu & Claudia Mureşan - 2017 - Studia Logica 105 (1):179-216.
General iteration and unary functions.G. M. Germano & S. Mazzanti - 1991 - Annals of Pure and Applied Logic 54 (2):137-178.
The Number of Transitivity Sets of Boolean FunctionsThe Number of Equivalence Classes of Boolean Functions under Groups Containing negation.On the Number of Classes of Switching Networks.The Number of Classes of Invertible Boolean Functions. [REVIEW]J. Kuntzmann & Michael A. Harrison - 1970 - Journal of Symbolic Logic 35 (1):160.
Independence of Boolean algebras and forcing.Miloš S. Kurilić - 2003 - Annals of Pure and Applied Logic 124 (1-3):179-191.
Partial orderings with the weak Freese-Nation property.Sakaé Fuchino, Sabine Koppelberg & Saharon Shelah - 1996 - Annals of Pure and Applied Logic 80 (1):35-54.
Large cardinals and iteration trees of height ω.Alessandro Andretta - 1991 - Annals of Pure and Applied Logic 54 (1):1-15.

Analytics

Added to PP
2017-02-21

Downloads
5 (#1,533,504)

6 months
3 (#967,057)

Historical graph of downloads
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