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.
- Optimal satisfiability for propositional calculi and constraint satisfaction problems. (Q1426002) (← links)
- Learnability of quantified formulas. (Q1426470) (← links)
- Inherently nonfinitely based lattices (Q1612484) (← links)
- Endoprimal distributive lattices (Q1802259) (← links)
- Some maximal closed classes of operations on infinite sets (Q1843583) (← links)
- Definability of Boolean function classes by linear equations over \(\mathbf{GF}(2)\) (Q1878398) (← links)
- Post classes characterized by functional terms (Q1878400) (← links)
- The median in multidimensional spaces (Q1883384) (← links)
- On the centralizer of the join operation of a finite lattice (Q1902534) (← links)
- Algebra of algorithms and Kaluzhnin's graph-schemas (Q1905123) (← links)
- Finite sublattices in the lattice of clones (Q1908449) (← links)
- Monoid intervals in lattices of clones (Q1918781) (← links)
- On separation of Boolean clones by means of hyperidentities (Q1921845) (← links)
- Functional completeness criteria in Dijkstra algebra (Q1922339) (← links)
- Classes of valuations closed under operations Galois-dual to Boolean sentence connectives (Q1922666) (← 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 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)
- 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)
- 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)
- 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)
- TERM EQUATION SATISFIABILITY OVER FINITE ALGEBRAS (Q3067781) (← links)
- UNCOUNTABLY MANY DUALISABLE ALGEBRAS (Q3094340) (← 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)
- Parallelizable algebras (Q3773330) (← links)
- Satisfiability problems for propositional calculi (Q3864500) (← links)
- (Q4389691) (← links)
- (Q4508825) (← links)
- Partial clones containing all permutations (Q4859671) (← links)
- A-classification of idempotent functions of many-valued logic (Q4947377) (← links)