scientific article; zbMATH DE number 3150816
From MaRDI portal
Publication:3268312
zbMATH Open0092.25101MaRDI QIDQ3268312FDOQ3268312
Authors: S. V. Yablonskij 
Publication date: 1958
Title of this publication is not available (Why is that?)
Cited In (49)
- Characteristic measures of switching functions
- Complexity of the satisfiability problem for multilinear forms over a finite field
- Title not available (Why is that?)
- Elementary decompositions of arbitrary maps over finite sets
- On the three-valued expansions of Kleene's logic
- Polynomially rich algebras
- Checking the polynomiality of single-variable functions of \({k}\)-valued logic composite modulo \({k}\)
- Closed classes in the functional system of polynomials with real coefficients
- Decompositions of functions based on arity gap
- Title not available (Why is that?)
- Some implicitly precomplete classes of functions of three-valued logic preserving subsets
- On Sheffer symmetric functions in three-valued logic
- The number of maximal closed classes in the set of functions over a finite domain
- Title not available (Why is that?)
- Four-valued logics \(\mathbf {BD}\) and \(\mathbf {DM4}\): expansions
- On the equality problem of finitely generated classes of exponentially-polynomial functions
- The number of orthogonal permutations
- Finite nets of dimension d
- Reduction theorems in the social choice theory
- 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
- Maximal clones on algebras A and A\(^r\)
- Theories of propositional logics and the converse of substitution
- Classification of three-valued logical functions preserving 0
- Equational closure and closure with respect to enumeration on a set of partial multivalued logic functions
- On the number of functions of \(k\)-valued logic which are polynomials modulo composite \(k\)
- Implicitly maximal classes and implicit completeness criterion in the three-valued logic
- Classification of \(P_{k2}\)
- Completeness for concrete near-rings.
- Completeness theory for the product of finite partial algebras
- On three-valued random variable transformations by bivariate functions
- Issues of algorithmics and Glushkov's systems of algorithmic algebras
- A completeness criterion for sets of multifunctions in full partial ultraclone of rank 2
- On weak positive predicates over a finite set
- The set of closed classes \(P_{k+1}\) that can be homomorphically mapped on \(P_k\) has the cardinality of continuum
- Natural deduction for Yuriev's logic
- Title not available (Why is that?)
- On superstructure of class of \(k\)-valued quasiuniform functions
- Meet-irreducible submaximal clones determined by nontrivial equivalence relations
- Completeness criterion with respect to the enumeration closure operator in the three-valued logic
- On the classes of autodual functions implicitly maximal in \(P_k \)
- Some families of closed classes in \(P_k\) defined by additive formulas
- On bijunctive predicates over a finite set
- On properties of multiaffine predicates on a finite set
- A family of closed classes in \(k\)-valued logic
- Title not available (Why is that?)
- On the role of logical connectives for primality and functional completeness of algebras of logics
- 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
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3268312)
