scientific article
From MaRDI portal
Publication:3268312
zbMath0092.25101MaRDI QIDQ3268312
Publication date: 1958
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (48)
Completeness for concrete near-rings. ⋮ The number of orthogonal permutations ⋮ Complexity of systems of functions of Boolean algebra and systems of functions of three-valued logic in classes of polarized polynomial forms ⋮ Galois theory for clones and superclones ⋮ Galois theory for semiclones ⋮ Elementary decompositions of arbitrary maps over finite sets ⋮ On Sheffer symmetric functions in three-valued logic ⋮ Finite nets of dimension d ⋮ Classification of \(P_{k2}\) ⋮ On the number of functions of \(k\)-valued logic which are polynomials modulo composite \(k\) ⋮ Countability of the set of closed overclasses of some minimal classes in the partly ordered set \(\mathcal{L}_{2}^{3}\) of all closed classes of three-valued logic that can be mapped homomorphically onto two-valued logic ⋮ Meet-irreducible submaximal clones determined by nontrivial equivalence relations ⋮ On three-valued random variable transformations by bivariate functions ⋮ On properties of multiaffine predicates on a finite set ⋮ Theories of propositional logics and the converse of substitution ⋮ Unnamed Item ⋮ On the three-valued expansions of Kleene's logic ⋮ Closed classes in the functional system of polynomials with real coefficients ⋮ On the equality problem of finitely generated classes of exponentially-polynomial functions ⋮ Reduction theorems in the social choice theory ⋮ Four-Valued Logics BD and DM4: Expansions ⋮ Completeness theory for the product of finite partial algebras ⋮ Unnamed Item ⋮ Decompositions of functions based on arity gap ⋮ On bijunctive predicates over a finite set ⋮ Complexity of the satisfiability problem for multilinear forms over a finite field ⋮ Polynomially rich algebras ⋮ On the role of logical connectives for primality and functional completeness of algebras of logics ⋮ Characteristic measures of switching functions ⋮ A completeness criterion for sets of multifunctions in full partial ultraclone of rank 2 ⋮ Equational closure and closure with respect to enumeration on a set of partial multivalued logic functions ⋮ Implicitly maximal classes and implicit completeness criterion in the three-valued logic ⋮ Classification of three-valued logical functions preserving 0 ⋮ A family of closed classes in \(k\)-valued logic ⋮ Some implicitly precomplete classes of functions of three-valued logic preserving subsets ⋮ Maximal clones on algebras A and A\(^r\) ⋮ The number of maximal closed classes in the set of functions over a finite domain ⋮ Issues of algorithmics and Glushkov's systems of algorithmic algebras ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On weak positive predicates over a finite set ⋮ Unnamed Item ⋮ The set of closed classes \(P_{k+1}\) that can be homomorphically mapped on \(P_k\) has the cardinality of continuum ⋮ Completeness criterion with respect to the enumeration closure operator in the three-valued logic ⋮ Some families of closed classes in \(P_k\) defined by additive formulas ⋮ On the classes of autodual functions implicitly maximal in \(P_k \)
This page was built for publication:
