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 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)
- Combinatorial problems raised from 2-semilattices (Q2496183) (← links)
- On the cardinality of the family of precomplete classes in \(P_{E}\) (Q2508750) (← links)
- The generation of clones with majority operations (Q2510717) (← links)
- Closed classes generated by symmetric functions in the three-valued logic (Q2513000) (← links)
- Classes generated by monotone symmetric functions in the three-valued logic (Q2513048) (← links)
- Equivalent transformations of formulas in \(P_2\). (Q2513087) (← links)
- Completeness of systems of functions for classes of extended superposition (Q2513192) (← links)
- Dichotomy for finite tournaments of mixed-type (Q2515599) (← links)
- On function classes in \(P _{3}\) precomplete with respect to a strengthened closure operator (Q2518016) (← links)
- A grammar of functions (Q2529469) (← links)
- A grammar of functions. II (Q2534288) (← links)
- Simple bases and the number of functions in certain classes introduced by Post (Q2543455) (← links)
- Über den Untergruppenverband der symmetrischen Gruppe, den Unterhablgruppenverband der symmetrischen Halbgruppe und den Unteralgebrenverband der Postschen Algebra. (The lattice of subgroups of the symmetric group, the lattice of subsemigroups of the symm (Q2548618) (← links)
- A classification of universal algebras by infinitary relations (Q2554347) (← links)
- Maximal clones on algebras A and A\(^r\) (Q2559402) (← links)
- Conditioned disjunction as a primitive connective for the \(m\)-valued propositional calculus (Q2649134) (← links)
- Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis (Q2922627) (← links)
- Monoidal intervals on three- and four-element sets (Q2973185) (← links)
- TERM EQUATION SATISFIABILITY OVER FINITE ALGEBRAS (Q3067781) (← links)
- UNCOUNTABLY MANY DUALISABLE ALGEBRAS (Q3094340) (← links)
- Characterization of zigzag De Morgan functions (Q3178160) (← links)
- Why Post Did [Not] Have Turing’s Thesis (Q3305321) (← links)
- CLONES CLOSED UNDER CONJUGATION I: CLONES WITH CONSTANTS (Q3502745) (← links)
- Menger Algebras and Clones of Cooperations (Q3521680) (← links)
- Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint (Q3540174) (← links)
- EVERY SHIFT AUTOMORPHISM VARIETY HAS AN INFINITE SUBDIRECTLY IRREDUCIBLE MEMBER (Q3560283) (← links)
- (Q3597354) (← links)