Pages that link to "Item:Q5845380"
From MaRDI portal
The following pages link to The Two-Valued Iterative Systems of Mathematical Logic. (AM-5) (Q5845380):
Displayed 50 items.
- The cardinality of the set of all clones containing a given minimal clone on three elements (Q1935019) (← links)
- Lewis dichotomies in many-valued logics (Q1935553) (← links)
- The complexity of problems for quantified constraints (Q1959381) (← links)
- From logical gates synthesis to chromatic bicritical clutters (Q1961457) (← links)
- Maximal clones in monoidal intervals. I (Q1972204) (← links)
- Criteria of functional completeness for meta-algebras without assignments of logical constants (Q1974307) (← links)
- Algebra of algorithmics and design of systems for synthesis of multimedia applications in the windows environment (Q1974334) (← links)
- On the efficiency of normal form systems for representing Boolean functions (Q1989340) (← links)
- Subalgebra lattices of totally reflexive sub-preprimal algebras (Q1999234) (← links)
- On the complexity of the clone membership problem (Q2048213) (← links)
- Closed sets of finitary functions between products of finite fields of coprime order (Q2057102) (← links)
- Infinitely generated classes of 01-functions of three-valued logic (Q2058708) (← links)
- On the number of universal algebraic geometries (Q2108528) (← links)
- Idempotent variations on the theme of exclusive disjunction (Q2115285) (← links)
- On classes of superfunctions on two-element set (Q2131408) (← links)
- The orbit of closure-involution operations: the case of Boolean functions (Q2143383) (← links)
- An unexpected Boolean connective (Q2169126) (← links)
- On bases of closed classes of Boolean vector functions (Q2209254) (← links)
- Closed sets of finitary functions between finite fields of coprime order (Q2210121) (← links)
- Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem (Q2221799) (← links)
- The maximal cardinality of the base in \(P_2\times P_2 \) (Q2221968) (← links)
- The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems (Q2235760) (← links)
- The lattice of monomial clones on finite fields (Q2238022) (← links)
- On self-correcting logic circuits of unreliable gates (Q2241352) (← links)
- Dichotomy results for fixed point counting in Boolean dynamical systems (Q2257296) (← links)
- On congruences in closed Post classes (Q2264663) (← links)
- On the role of logical connectives for primality and functional completeness of algebras of logics (Q2269795) (← links)
- The complexity of deciding if a Boolean function can be computed by circuits over a restricted basis (Q2272200) (← links)
- Solution sets of systems of equations over finite lattices and semilattices (Q2297806) (← links)
- Two-element structures modulo primitive positive constructability (Q2310436) (← links)
- Term operations in \(\mathcal{V}(N_5)\) (Q2314984) (← links)
- Combining fragments of classical logic: when are interaction principles needed? (Q2317512) (← links)
- The model checking fingerprints of CTL operators (Q2317834) (← links)
- Solvability of the problem of completeness of automaton basis depending on its Boolean part (Q2319977) (← links)
- On some properties of vector functions of Boolean algebra (Q2322394) (← links)
- Cardinality of generating sets for operations from the Post lattice classes (Q2332805) (← links)
- Finite degree clones are undecidable (Q2333801) (← links)
- Existence of finite total equivalence systems for certain closed classes of 3-valued logic functions (Q2342799) (← links)
- Set-reconstructibility of Post classes (Q2348047) (← links)
- Hypomorphic Sperner systems and non-reconstructible functions (Q2351723) (← links)
- Functional clones and expressibility of partition functions (Q2357376) (← links)
- Closure operators with positive connectives and quantifiers (Q2364246) (← links)
- Characterizations of closed classes of Boolean functions in terms of forbidden subfunctions and Post classes (Q2387440) (← links)
- What makes propositional abduction tractable (Q2389658) (← links)
- Superassociative systems and logical functors (Q2394071) (← links)
- Classes of functions of multi-valued logic closed with respect to superposition and inversion operations (Q2399400) (← links)
- The connectivity of Boolean satisfiability: dichotomies for formulas and circuits (Q2411031) (← links)
- Polynomial clone reducibility (Q2436621) (← links)
- Weak bases of Boolean co-clones (Q2448853) (← links)
- Monoidal intervals of clones on infinite sets (Q2463469) (← links)