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 36 items.
- Minimal partial ultraclones on a two-element set. (Q278534) (← links)
- Dualizing clones as models of Lawvere theories. (Q280192) (← links)
- A short introduction to clones. (Q280194) (← links)
- Polynomial-time algorithms for checking some properties of Boolean functions given by polynomials (Q285507) (← links)
- On maximal clones of ultrafunctions of rank 2 (Q326275) (← links)
- Strong partial clones and the time complexity of SAT problems (Q340559) (← links)
- Closed classes of the three-valued logic generated by systems containing symmetric functions (Q355308) (← links)
- Rational equivalence of algebras, its clone generalizations, and clone categoricity. (Q359381) (← links)
- Fully invariant and verbal congruence relations (Q364686) (← links)
- Meet-irreducible submaximal clones determined by nontrivial equivalence relations (Q382339) (← links)
- Generalized satisfiability for the description logic \(\mathcal{ALC}\) (Q393137) (← links)
- Binary central relations and submaximal clones determined by nontrivial equivalence relations. (Q422338) (← links)
- A stronger LP bound for formula size lower bounds via clique constraints (Q428879) (← links)
- On the applicability of Post's lattice (Q436335) (← links)
- Commuting polynomial operations of distributive lattices (Q438810) (← links)
- Clones of topological spaces (Q439313) (← links)
- Disjunctive closures for knowledge compilation (Q460617) (← links)
- Dualizing clones into categories of topological spaces. (Q485103) (← links)
- Boolean max-co-clones (Q494629) (← links)
- On the parameterized complexity of non-monotonic logics (Q494658) (← links)
- First-order logic and first-order functions (Q497872) (← links)
- Transformation monoids with finite monoidal intervals (Q522226) (← links)
- Key (critical) relations preserved by a weak near-unanimity function (Q522228) (← links)
- Gap theorems for robust satisfiability: Boolean CSPs and beyond (Q527405) (← links)
- Clones with finitely many relative \({\mathcal R}\)-classes (Q535115) (← links)
- Automata algebras (Q548748) (← links)
- Polynomial clones of Mal'cev algebras with small congruence lattices (Q625963) (← links)
- The complexity of satisfiability for fragments of hybrid logic. I. (Q631087) (← links)
- Tree search and quantum computation (Q638594) (← links)
- Structure of clones in the precomplete class of self-dual functions in three-valued logic (Q656306) (← links)
- A criterion for the decidability of the \(A\)-completeness problem for definite automata (Q656372) (← links)
- The complexity of circumscriptive inference in Post's lattice (Q692903) (← links)
- Trichotomies in the complexity of minimal inference (Q692908) (← links)
- Recognizing frozen variables in constraint satisfaction problems (Q706617) (← links)
- Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms (Q710720) (← links)
- A functional completeness theorem for De Morgan functions. (Q741709) (← links)